What is Implementation of connection less services?

Connectionless service is a network communication method where packets are sent independently without establishing a dedicated path beforehand. In this service model, packets are often called datagrams because each packet is individually injected into the network and routed independently, similar to how telegrams are sent.

Unlike connection-oriented services that require establishing a virtual circuit before data transmission, connectionless services require no advance setup. Networks using this approach are called datagram networks or datagram subnets.

Connectionless Service Implementation Host H1 Process P1 Router A Router B Router C Router E Router F Host H2 Process P2 Packets 1,2,3,4 1,2,3 4 Reassembled Multiple Paths in Datagram Network Primary path (packets 1,2,3) Alternate path (packet 4)

How Datagram Networks Work

Step 1 − Process P1 on host H1 has a message to deliver to P2 on host H2. P1 hands the message to the transport layer with delivery instructions.

Step 2 − The transport layer running within the operating system prepends a transport header to the message and passes the result to the network layer.

Step 3 − If the packet exceeds the maximum transmission unit (MTU), it is fragmented into smaller packets. Each packet is sent independently to the first router using point-to-point protocol.

Step 4 − Each router maintains a routing table containing destination-to-outgoing-line mappings. Packets are forwarded based on these table entries, using only directly connected lines.

Step 5 − Router A has connections to routers B and C only. All incoming packets must be forwarded to one of these routers, regardless of the ultimate destination.

Step 6 − When packets 1, 2, and 3 arrive at router A, they are temporarily stored and then forwarded to router C based on A's routing table. From C, they travel to E, then F, and finally to host H2 via the LAN.

Step 7 − Packet 4 may take a different route (A?B?E?F) due to network conditions such as congestion on the A?C?E path. The routing algorithm dynamically updates routing tables based on current network state.

Key Features

  • Independent packet routing − Each packet is routed separately without knowledge of other packets in the same message.

  • No connection state − Routers do not maintain connection information, making the network more resilient to failures.

  • Dynamic routing − Packets can take different paths based on current network conditions and routing table updates.

  • Best-effort delivery − No guarantees on packet delivery order, timing, or success.

Conclusion

Connectionless service implementation using datagram networks provides flexible, resilient packet delivery without requiring connection establishment. Each packet is routed independently, allowing dynamic path selection based on current network conditions, though this approach offers no delivery guarantees.

Updated on: 2026-03-16T23:36:12+05:30

7K+ Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements