1 / 7

Chapter 20 IP Datagrams and Datagram Forwarding

Chapter 20 IP Datagrams and Datagram Forwarding. Connectionless vs Connection-oriented Service. TCP/IP’s fundamental delivery service is connectionless Individual packets travel independently and contains information that identifies the intended recipient

oakes
Download Presentation

Chapter 20 IP Datagrams and Datagram Forwarding

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 20 IP Datagrams and Datagram Forwarding

  2. Connectionless vs Connection-oriented Service • TCP/IP’s fundamental delivery service is connectionless • Individual packets travel independently and contains information that identifies the intended recipient • A reliable connection-oriented service is added on top of the underlying connectionless service

  3. Datagram forwarding across heterogeneous networks • Heterogeneous networks use different frame formats • Router cannot forward a frame from one type of network to another without modification • Two networks may use incompatible address formats (ie. address in a frame may make no sense on another network).

  4. IP Datagram • a universal, virtual, hardware-independent internet packet consisting of an IP header followed by data (fig 20.1)F • Source and destination addresses in the datagram header are IP addresses • The size of an IP datagram(version 4) can vary from 1 byte of data to 64k bytes.

  5. Routing/Forwarding of Datagrams • process of using a routing table (fig 20.3) to select a next hop for a given datagram • datagram with destination address D is masked with the i-th entry in the routing table to determine next hop address • if ((Mask[i] & D ) == Destination[i] ) then forward to NextHop[i]

  6. IP Datagram Header • IP datagram header format (fig 20.4) • Data header contains the ultimate destination, not the frame header • When a router forwards the datagram to another router, the IP address of the next hop does not appear in the datagram header • The address of the next hop is used to translate to a corresponding hardware address for transmission (ARP).

  7. Unreliable Datagram Delivery • IP makes a best-effort attempt to deliver each datagram • No guarantee of datagram delivery • Problems that can occur at layer 3 • datagram duplication due to excessive delay • out-of-order delivery • data corruption • datagram loss • Higher layers of protocol software are needed to handle these errors.

More Related