Packet switching - fundamentals of networks, Computer Networking

Packet Switching

In the  packet  switching network  type on specific  path is  used for  data  transfer. Instead the data is chopped up into  small  pieces called packed and sent over the network. We  can route combine or fragment the packets as required to get them to their eventual  destination. One  the  receiving end the process is reversed the data is read from the  packets and reassembled to form the original data. A packet switched network is more  analogous to the postal system that if is to the  telephone system through the comparison is not perfect. An  example is  shown  in figure                               

In a packet  switched network no circuit  is set up prior to sending  data  between  devices. Blocks of data even from  same file or communication may  take  any  number  of paths  as they journey  from one device to another.

 

 

655_packet swtiching.jpg

 

figure Packet switching

Posted Date: 3/2/2013 5:16:06 AM | Location : United States







Related Discussions:- Packet switching - fundamentals of networks, Assignment Help, Ask Question on Packet switching - fundamentals of networks, Get Answer, Expert's Help, Packet switching - fundamentals of networks Discussions

Write discussion on Packet switching - fundamentals of networks
Your posts are moderated
Related Questions

Many benefits of configuring VLAN as listed below: • Performance Enhancements: It reduces heavy load on the network by permitting operations at lower latencies by using VLAN t


What are the working of software team The software team has to learn every bit of things related to computers. Since different users work on different platforms and application

Brigdes Introduction - LAN may require to cover more distance than the media can handle effectively or - Number of stations may perhaps be too great for efficient frame d

Discuss the interdependence of networking hardware and software. Is it possible to have one without the other? Explain

Cost Saving Better performance  scalability  and viability  translates into  saving  for  website  operators.  Because  fewer  application  web servers are required  to meet

Compute the shortest path from t to all network nodes.

Control Frames for Lost Tokens If station goes down ... token lost Predecessor listens for data frame or token Noticing none, retransmits token Sends whofoll

Matric define as Formula of path selection