Question

What is datagram Approach?​

Answer 1

$\huge{\boxed{\underline{\bold{Answer:)}}}}$

$\huge{\underline{\bold{Datagram\:Approach}}}$

Basic Concept

♦ No route is established before hand.

♦ Each packet is transmitted as an independent entity.

♦ Does not maintain any history.

Analogy

→ Postal System

♦ Every intermediate intermediate node has to take routing decisions dynamically.

→ Makes use of a routing table.

→ Every packet packet must contain source and destination addresses.

Problems

♦ Packets may be delivered out of order.

♦ If a node crashes momentarily, all of its queued packets are lost.

♦ Duplicate packets may also be generated.

Advantages

♦ Faster than virtual circuit for smaller number of packets.

→ No route establishment and termination.

♦ More flexible.

♦ Packets between two hosts may follow different paths.

♦ Can handle congestion / failed link.

Answer 2

Answer:

$\huge\bold{\underline{\mathbb{\pink{ANSWER}}}}$

• Datagram packet-switching is a packet switching by which each packet, now called a datagram, is treated as a separate entity. Each packet is routed independently through the network.

There are three primary types of datagram packet switches:

• Store and forward
• Fragment free
• Cut through