The concept of universal service, Computer Networking

The major problems with multiple networks are as given:

  • A computer attached to a given server can only interact with other computers attached to the similar network.

 

  • In the 1970s large organizations start to acquire multiple networks. Every network in the organization formed island. Employees required to select a computer appropriate for each and every task. So they required multiple screens, computers and keyboards.

UNIVERSAL SERVICES:

A interaction system that supplies universal services allows arbitrary pairs of computers to interact. Universal service is required because it increases individual productivity.

Posted Date: 7/31/2012 8:22:53 AM | Location : United States







Related Discussions:- The concept of universal service, Assignment Help, Ask Question on The concept of universal service, Get Answer, Expert's Help, The concept of universal service Discussions

Write discussion on The concept of universal service
Your posts are moderated
Related Questions
Design a Logical LAN Topology Step: Design an IP addressing scheme. Given the IP address block of 192.168.7.0 /24, design an IP addressing scheme that states the following r


PHYSICAL ADDRESSING IN A WAN:  The physical addressing in a WAN is same as in LAN in the following way: The data is send in packets equivalent to frames. Every pack

Get the network design for a company

Advantage of Repeaters Repeaters provide  the  advantage of increasing type size  of LAN or connecting LAN  segments. Repeater can overcome 10  base 5 Ethernet LANM restrictio

How two adjacent layers communicate in a layered network? (or What do you mean by Service Access Point?) In layered network, each layer has lots of entities and entities of lay

Q. Which steps are used at receiver end by check sum? The receiver follows these steps: The unit is divided into "k" sections each of "n" bits All sections are

Introduction of DNS While discussing about the Internet, one things comes automatically in the n=mind and hence it is directly or indirectly depended on DNS. The DNS which sta

We studied Dijkstra's link-state routing algorithm for computing the unicast paths that are individually the shortest paths from the source to all destinations. The union of these