Packet Switching Datagram Approach
For Complete YouTube Video: Click Here
In this class, we will try to understand Packet Switching Datagram Approach.
We have already discussed the concepts of Routing and Forwarding in our previous class.
Packet Switching Datagram Approach
The packets received at the router will get switched to the other router, and the ‘packets are switched’ in two different ways.
- Datagram switching [Connectionless Service]
- Circuit Switching [Connection Oriented Service]
In this class, we will discuss datagram switching.
In the next class, we will discuss Circuit Switching.
To understand datagram switching consider the image below.
Packets 1, 2, 3, and 4 are transmitted by system A in the above image.
The packets are not destined to a particular interface in the datagram switching.
In datagram switching, packets get randomly transmitted through any interface.
The problem with the datagram switching is at the destination, and the packets get received in random order.
The destination has to rearrange them in order.