Simple Internetworking

7/26/2013

BEE8B Computer Networks

internetwork n. &v.
1 logical network built out of a collection of physical networks. 2 tr. to interconnect physical networks into a single logical networks; to build an internet.

7/26/2013

BEE8B Computer Networks

Simple internetwork (example)

Network 1 (Ethernet) H1 H2 H3 H7 R3 H8

Network 2 (Ethernet) R1

Network 4 (point-to-point)

R2 H4 Network 3 (FDDI)

Question: What are the challenges in connecting two physical networks into a single logical network?

H5

H6

7/26/2013

BEE8B Computer Networks

Service model
H1 TCP IP ETH ETH IP FDDI FDDI R1 IP PPP PPP R2 IP ETH R3 H8 TCP IP ETH

IP is undemanding enough that any underlying physical network can work underneath

Host-to-host service

Philosophy: Define a model that is so undemanding that almost any network technology is able to provide the required service. (IP)

Addressing scheme
Datagram
7/26/2013

Best-effort
BEE8B Computer Networks

Questions: What does besteffort mean? How does it simplify internetworking?

4

Best Effort Delivery

The network does nothing when
Packet gets lost, corrupted, miss-delivered or fails to reach the destination It is said unreliable service

Best-effort connectionless service is the strength of IP

Providing best-effort reliable service ends up into a service delivering packets always taking the underneath hardware to support Without hardware support lots of functionally needs to be incorporated into the routers
7/26/2013 BEE8B Computer Networks 5

Data delivery model

0 4 Version HLen Ident TTL Protocol SourceAddr DestinationAddr Options (v ariable) Data Pad (v ariable) 8 TOS Flags 16 19 Length Of f set Checksum 31

Every datagram contains enough information for the network to forward it from source to destination.
Question: Why is Version on the top of the packet?

Aligned on 32-bit boundaries.

7/26/2013 BEE8B Computer Networks 6

Data delivery model

0 4 Version HLen Ident TTL Protocol SourceAddr 8 TOS Flags 16 19 Length Of f set Checksum 31

HLen: length of header. TOS: type of service. Length: length of datagram. Questions: What is the maximum length of a datagram? Will the underlying physical network support it?

DestinationAddr Options (v ariable) Data Pad (v ariable)

Aligned on 32-bit boundaries.

7/26/2013 BEE8B Computer Networks 7

Data delivery model

0 4 Version HLen Ident TTL Protocol SourceAddr DestinationAddr Options (v ariable) Data Pad (v ariable) 8 TOS Flags 16 19 Length Of f set Checksum 31

TTL: time to live (hop count). Protocol: identity of upperlevel protocol to which IP passes this packet. Checksum: applies to header. SourceAddr: to allow filtering based on source. DestinationAddr: used for data delivery. Options: header length determines if any are set.

Aligned on 32-bit boundaries.

8

7/26/2013

BEE8B Computer Networks

Fragmentation and Reassembly

Ethernet: max. frame length = 1500 B. FDDI: max. frame length = 4500 B.
MTU

MTU: The largest IP datagram that a network can carry in a single frame.

Question: How does the underlying network technology affect IP? How does one choose the maximum datagram size for IP? Design options: (1) Choose IP datagram max. length to be compatible with MTU. (2) Fragment IP datagram into multiple MTUs.
7/26/2013 BEE8B Computer Networks 9

Fragmentation and Reassembly

Gotcha: MTU

header

Payload: IP datagram

trailer

7/26/2013

BEE8B Computer Networks

10

Fragmentation and Reassembly

H1 R1 R1 R2 R2 R3 R3 H8

ETH IP (1400)

FDDI IP (1400)

PPP IP (512) PPP IP (512) PPP IP (376)

ETH IP (512) ETH IP (512) ETH IP (376)

1. Each fragment is itself a self-contained IP datagram that is transmitted over a sequence of physical networks, independent of other fragments. 2. Each IP datagram is re-encapsulated for each physical network over which it travels.
7/26/2013 BEE8B Computer Networks 11

Fragmentation and Reassembly

Start of header Ident = x 0 Offset = 0 Rest of header
(a)

1400 data bytes

Some nitty-gritty details

If a fragment is lost, the receiver still tries to assemble the datagram When this fails, it has to clean up the memory that was used in the attempt.
If hosts can do path MTU discovery, then IP fragmentation can be avoided altogether.

Start of header Ident = x 1 Offset = 0

Rest of header
512 data bytes
(b)

Start of header
Ident = x 1 Offset = 64 Rest of header 512 data bytes

Start of header Ident = x 0 Offset = 128 Rest of header 376 data bytes

7/26/2013

BEE8B Computer Networks

12

Global addresses
Question: What are the challenges?
Wish List:

Addresses are unique.

Address structure makes routing/forwarding as easy as possible.
7 (a) 0 Network 24 Host

CLASS A
16 Host

14 (b) 1 0 Network 21 (c) 1 1 0 Network

CLASS B
8

Host

CLASS C
13

7/26/2013

BEE8B Computer Networks

ARP (Address Resolution Protocol)

ARP: given a protocol address (e.g. IP address) find its hardware address (e.g. Ethernet hardware address) Link to the lecture notes about ARP

7/26/2013

BEE8B Computer Networks

14