Introduction to Internetworking

Transcription

1 Introduction to Internetworking Stefano Vissicchio UCL Computer Science COMP0023

2 Internetworking Goal: Connect many networks together into one Internet. Any computer can send to any other computer on any network.

3 Can t we just scale up LANs?

4 Can t we just scale up LANs? You can connect a lot of Ethernet segments together, just refreshing the signal Problem: all hosts hear all traffic, so that doesn t scale well. You can connect a lot of Ethernet segments together by tracking where hosts are Switches learn where hosts are by listening. Traffic only goes where it needs to go. Problem: each switch needs to learn where every host is. Lots of state Packets still go everywhere until switches learn.

5 Can t we just scale up LANs? You can connect a lot of Ethernet segments together, just refreshing the signal Problem: all hosts hear all traffic, so that doesn t scale well. You can connect a lot of Ethernet segments together with switches, tracking where hosts are Switches learn where hosts are by listening. Traffic only goes where it needs to go. Problem: each switch needs to learn where every host is. Lots of state Packets still go everywhere until switches learn.

6

7 Default answer to all systems problems: If it doesn t scale, add hierarchy. If it doesn t go fast enough, add a cache. 7

8 Default answer to all systems problems: If it doesn t scale, add hierarchy. If it doesn t go fast enough, add a cache. 8

9 Two-layer Internet Hierarchy 1. Connect hosts together into Local-Area Networks (LANs) Eg. Ethernet, WiFi, etc LAN addresses responsible for getting packets to each host on that LAN. 2. Add a router to each LAN; connect routers together to form a Wide-Area Network (WAN) Add an extra layer that s responsible for getting packets between LANs: an Internetwork protocol.... host host host... host host host LAN 1 LAN 2 router router router WAN WAN

10 Addressing Within a LAN: flat MAC addresses No structure. Can just plug any computer in anywhere. Between LANs: structured IP addresses All computers on the same LAN have close network addresses Routers only need to know how to reach a LAN, not which computers are on that network

11 Basic Internet Design Principles Layering Best effort service model End-to-end principle Datagram packet forwarding One internetwork protocol

12 Basic Internet Design Principles Layering Best effort service model End-to-end principle Datagram packet forwarding One internetwork protocol

13 Datagram Packet Forwarding Divide messages into a sequence of datagrams Network deals with each datagram individually Each datagram carries enough information to allow any switch to decide how to get it to its destination Each datagram must contain all relevant network information in its header: Every packet contains complete destination address Routers consult forwarding table Process of building forwarding tables: routing

14 Routers Routers are more powerful switches that use IP addresses to forward packets across the Internet What does a router consist of? Set of interfaces where packets arrive, and from which should depart Some form of interconnect between interfaces host host... host host host... host LAN 1 router router router WAN WAN LAN 2 Router

15 Routers Routers are more powerful switches that use IP addresses to forward packets across the Internet What does a router do? Talk to other routers to figure out paths Forward packets to corresponding output interface host host... host host host... host LAN 1 router router router WAN WAN LAN 2 Router

16 Why Datagram Packet Forwarding? 1. Achieve higher levels of utilization Statistical multiplexing: provision for upper end of expected demand, not worst-case demand 2. Avoid per-flow state inside the network Plenty of routing state, but no finer-grained (e.g., perapplication) state Enables robust failover if paths fail Helps scaling

17 IP: One Networking Layer Protocol Design goal #1 of the Internet: Connect existing heterogeneous networks together IP unifies the architecture of the network of networks As long as applications can run over IP, they can run on any network As long as networks support IP, they can run any application WWW phone...! SMTP HTTP RTP...! TCP UDP!! IP!! ethernet PPP! CSMA async sonet...! copper fiber radio...!

18 IP: One Networking Layer Protocol Design goal #1 Corollary: of the Internet: Connect existing To run heterogeneous over all networks, IP must be very networks together undemanding of the underlying networks. To support all applications, IP must TCP provide UDP! IP unifies the architecture of the network! of networks a very simple service. WWW phone...! SMTP HTTP RTP...! IP! As long as applications can run over IP, they can run on any network As long as networks support IP, they can run any application! ethernet PPP! CSMA async sonet...! copper fiber radio...!

19 RFC 1149: IP over Avian Carriers First implementa7on of RFC 1149 by Bergen Linux Users Group 20

20 RFC 1149: IP over Avian Carriers First implementa7on of RFC 1149 by Bergen Linux Users Group 21

21 Let s design the Internet Protocol (IP)

22 IP Header We ll add an IP header to each packet. Carried across each link in a link-layer (L2) packet such as Ethernet. IP header stays (mostly) the same as the packet traverses between networks. FDDI link Ethernet link Router 2 Router 1 Sender

23 IP Header We ll add an IP header to each packet. Carried across each link in a link-layer (L2) packet such as Ethernet. IP header stays (mostly) the same as the packet traverses between networks. Ethernet header IP header to R1 to Dst IP payload FDDI link Ethernet link Router 2 Router 1 Sender

24 IP Header We ll add an IP header to each packet. Carried across each link in a link-layer (L2) packet such as Ethernet. IP header stays (mostly) the same as the packet traverses between networks. FDDI header IP header to R2 to Dst IP payload FDDI link Ethernet link Router 2 Router 1 Sender

25 IP Header We ll add an IP header to each packet. Carried across each link in a link-layer (L2) packet such as Ethernet. IP header stays (mostly) the same as the packet traverses between networks. FDDI header IP header to R2 to Dst IP payload Ethernet link FDDI link Destination Router 2 Router 1

26 IP Header We ll add an IP header to each packet. Carried across each link in a link-layer (L2) packet such as Ethernet. IP header stays (mostly) the same as the packet traverses between networks. Ethernet header IP header to D to Dst IP payload Ethernet link FDDI link Destination Router 2 Router 1

27 IP Header (2) IP header needs to contain the destination address. Routers will look at this to decide where next to forward the packet. What else should be in the IP header?

28 What else should be in the IP header? Some questions to consider: How will you reply to the packet? How does the recipient know what to do with the packet? How big can a packet be? What happens if the routers get confused? Are some packets more important than others? What happens if a packet gets corrupted?

29 How will you reply to the packet? To reply, you need to know the source address of the packet. Do you need this in the IP header? Advantages: One common way to find out the source. Can be used to scope other identifiers to uniquely identify a conversation. Disadvantages: Waste bits in every packet. Could just send once at the start of a conversation, and use some conversation ID after that. On balance, simpler to include source address.

30 How does the recipient know what to do with the packet? We re going to build many protocols on top of IP. Reliable transport (TCP) Unreliable transport (UDP) Tunnelling (GRE), Control (ICMP), etc Need some way to tell the recipient which software (for which protocol) to hand the packet to. Solution: Include a next protocol ID in the IP header. Have well-defined values: TCP=6, UDP=17, etc.

31 How does the recipient know what to do with the packet? We re going to build many protocols on top of IP. Reliable transport (TCP) Unreliable transport (UDP) Tunnelling (GRE), Control (ICMP), etc Need some way to tell the recipient which software (for which protocol) to hand the packet to. Solution: Include a next protocol ID in the IP header. Have well-defined values: TCP=6, UDP=17, etc.

32 How big can a packet be? We d like to allow reasonably large IP packets. Can we allow arbitrary packet size?

33 How big can a packet be? We d like to allow reasonably large IP packets. Problem: Many link technologies have a maximum frame size. This differs depending on the link type. Assume we don t want to design for smallest known maximum frame size, a priori: What happens if a smaller one comes along later?

34 How big can a packet be? (2) Problem: Packet is too big Solution: IP fragmentation If a packet arrives at a router, and it s too big for the next link, have the router split the packet into smaller packets that will fit. New problem: Who puts it back together again?

35 Who puts fragments back together again? Host A MTU=1000B R1 MTU=500B MTU=1000B Host B 1000 R2 MTU = Maximum Transfer Unit

36 Who puts fragments back together again? Host A MTU=1000B R1 MTU=500B MTU=1000B Host B R2 MTU = Maximum Transfer Unit

37 Who puts fragments back together again? Host A MTU=1000B R1 MTU=500B MTU=1000B Host B R2 MTU = Maximum Transfer Unit

38 Who puts fragments back together again? Host A MTU=1000B R1 MTU=500B MTU=1000B Host B 1000 MTU = Maximum Transfer Unit R

39 Who puts fragments back together again? Answer #1: within the network, with no help from end-host B (receiver) Host A MTU=1000B R1 MTU=500B MTU=1000B Host B R MTU = Maximum Transfer Unit

40 Who puts fragments back together again? Answer #1: within the network, with no help from end-host B (receiver) Answer #2: at end-host B (receiver) with no help from the network Host A MTU=1000B R1 MTU=500B MTU=1000B Host B 1000 MTU = Maximum Transfer Unit R

41 Who puts fragments back together again? Answer #1: within the network, with no help from end-host B (receiver) Answer #2: at end-host B (receiver) with no help from the network Host A MTU=1000B R1 MTU=500B MTU=1000B Host B 1000 MTU = Maximum Transfer Unit R

42 Let s consider a slightly more complex case Answer #1: within the network, with no help from end-host B (receiver) Answer #2: at end-host B (receiver) with no help from the network Host A MTU=1000B R1 MTU=500B R3 MTU=1000B Host B R2 MTU = Maximum Transfer Unit

43 Fragments can take different paths... Answer #1: within the network, with no help from end-host B (receiver) Answer #2: at end-host B (receiver) with no help from the network Host A MTU=1000B R1 MTU=500B R3 500 MTU=1000B Host B R MTU = Maximum Transfer Unit

44 We must reassemble at the receiver Answer #1: within the network, with no help from end-host B (receiver) Answer #2: at end-host B (receiver) with no help from the network Host A MTU=1000B R1 MTU=500B R3 500 MTU=1000B Host B R MTU = Maximum Transfer Unit

45 We must reassemble at the receiver Answer #1: within the network, with no help from end-host B (receiver) Answer #2: at end-host B (receiver) with no help from the network Only the receiver is guaranteed to be on all the possible paths taken by fragments. MTU=1000B R3 MTU=1000B MTU=500B Receiver buffers fragmented packets until R1 500 all fragments arrive, and reassembles fragments before passing them to upper layer Host A 1000 MTU = Maximum Transfer Unit 500 R Host B 1000

46 What happens if the routers get confused? Routers talk to each other to figure out how to get to a destination network D S is sending to D S

47 What happens if the routers get confused? Routers talk to each other to figure out how to get to a destination network. What happens if they temporarily have inconsistent state? D S is sending to D S

48 What happens if the routers get confused? Routers talk to each other to figure out how to get to a destination network. What happens if they temporarily have inconsistent state? Link 2-3 fails D S

49 What happens if the routers get confused? Routers talk to each other to figure out how to get to a destination network. What happens if they temporarily have inconsistent state? Link 2-3 fails D S Routers 4 and 5 don t know about the failure yet and s7ll try to use old path 7

50 What happens if the routers get confused? Routers talk to each other to figure out how to get to a destination network. What happens if they temporarily have inconsistent state? Routers 1 and 2 know about a route that s7ll works and switch to that Link 2-3 fails D S Routers 4 and 5 don t know about the failure yet and s7ll try to use old path 7

51 What happens if the routers get confused? Routers talk to each other to figure out how to get to a destination network. What happens if they temporarily have inconsistent state? D S 4 5 Traffic from S to D loops un7l: it s dropped due to massive conges7on router 4 learns about the failure 6 7

52 What happens if the routers get confused? Solution: Add a counter to packets Have each router decrease the counter by one If the counter reaches zero, drop the packet... and send an ICMP time exceeded message back to the source In IP packets, we call this counter time-to-live (TTL)

53 Are some packets more important than others?

54 Are some packets more important than others? When packets arrive too fast at a router, they ll have to queue. queue of packets waiting to cross the link Do we need a way for some important packets to jump the queue?

55 Are some packets more important than others? Do we need a way for some important packets to jump the queue? It s easy to add a priority field to packets. Higher priority packets overtake lower priority ones at a queue. It s harder to police who gets high priority. Do you want to pay more to get high priority? Packets traverse many networks. Whom do you pay?

56 Are some packets more important than others? Do we need a way for some important packets to jump the queue? It s easy to add a priority field to packets. Higher priority packets overtake lower priority ones at a queue. It s harder to police who gets high priority. Do you want to pay more to get high priority? Packets traverse many networks. Who to pay?

57 What happens if a packet gets corrupted? Most errors will be detected by the link CRC. Some may escape detection (e.g. bit flipped in router memory). Do we care? Punt to higher layer protocol? Only the application knows how much error detection overhead is appropriate. Checksum in IP? Avoids misrouted packets if destination address corrupted General solution protects all application protocols Solution: End-to-end argument implies don t checksum payload. Add simple checksum protecting IP header only to avoid misrouting.

58 What happens if a packet gets corrupted? Most errors will be detected by the link CRC. Some may escape detection (e.g. bit flipped in router memory). Do we care? Punt to higher layer protocol? Only the application knows how much error detection overhead is appropriate. Checksum in IP? Avoids misrouted packets if destination address corrupted General solution protects all application protocols Solution: End-to-end argument implies don t checksum payload. Add simple checksum protecting IP header only to avoid misrouting.

59 What happens if a packet gets corrupted? Most errors will be detected by the link CRC. Some may escape detection (e.g. bit flipped in router memory). Do we care? Punt to higher layer protocol? Only the application knows how much error detection overhead is appropriate. Checksum in IP? Avoids misrouted packets if destination address corrupted General solution protects all application protocols Solution: End-to-end argument implies don t checksum payload. Add simple checksum protecting IP header only to avoid misrouting.

60 The IP Packet Header

61 The IP Packet Header Version: Indicates the version of the IP protocol (4 for this) HLen: Number of 32-bit words in the header 5 (20 bytes) if no options present. Type of Service: Allows some packets to be treated differently Length of packet in bytes TTL: time to live counter Protocol: next layer, eg TCP Checksum: only covers header Ident, Don t Frag / More Frag flags & offset: used for fragmentation Options: extra stuff to extend IP

62 The IP Packet Header Version: Indicates the version of the IP protocol (4 for this) HLen: Number of 32-bit words in the header 5 (20 bytes) if no options present. Type of Service: Allows some packets to be treated differently Length of packet in bytes Ident, Don t Frag / More Frag flags & offset: used for fragmentation TTL: time to live counter Protocol: next layer, eg TCP Checksum: only covers header Options: extra stuff to extend IP

63 The IP Packet Header Version: Indicates the version of the IP protocol (4 for this) HLen: Number of 32-bit words in the header 5 (20 bytes) if no options present. Type of Service: Allows some packets to be treated differently Length of packet in bytes Ident, Don t Frag / More Frag flags & offset: used for fragmentation TTL: time to live counter Protocol: next layer, eg TCP Checksum: only covers header Options: extra stuff to extend IP

64 The IP Packet Header Version: Indicates the version of the IP protocol (4 for this) HLen: Number of 32-bit words in the header 5 (20 bytes) if no options present. Type of Service: Allows some packets to be treated differently Length of packet in bytes Ident, Don t Frag / More Frag flags & offset: used for fragmentation TTL: time to live counter Protocol: next layer, eg TCP Checksum: only covers header Options: extra stuff to extend IP

65 The IP Packet Header Version: Indicates the version of the IP protocol (4 for this) HLen: Number of 32-bit words in the header 5 (20 bytes) if no options present. Type of Service: Allows some packets to be treated differently Length of packet in bytes Ident, Don t Frag / More Frag flags & offset: used for fragmentation TTL: time to live counter Protocol: next layer, eg TCP Checksum: only covers header Options: extra stuff to extend IP

66 The IP Packet Header Version: Indicates the version of the IP protocol (4 for this) HLen: Number of 32-bit words in the header 5 (20 bytes) if no options present. Type of Service: Allows some packets to be treated differently Length of packet in bytes Ident, Don t Frag / More Frag flags & offset: used for fragmentation TTL: time to live counter Protocol: next layer, eg TCP Checksum: only covers header Options: extra stuff to extend IP

67 The IP Packet Header SourceAddr, DestinationAddr: IP addresses of packet source and destination. Version: Indicates the version of the IP protocol (4 for this) HLen: Number of 32-bit words in the header 5 (20 bytes) if no options present. Type of Service: Allows some packets to be treated differently Length of packet in bytes Ident, Don t Frag / More Frag flags & offset: used for fragmentation TTL: time to live counter Protocol: next layer, eg TCP Checksum: only covers header Options: extra stuff to extend IP

68 Designing IP Addresses Question #1: what should an address be associated with? e.g., a telephone number is associated not with a person, but with a handset Question #2: what structure should addresses have? What are the implications of different types of structure? Question #3: who determines the particular addresses used in the global Internet? What are the implications of how this is done?

69 IPv4 Addresses A unique 32-bit number Uniquely identifies and associated with an interface (on a host, on a router,...) For humans, represented in dotted-quad notation a.b.c.d where each component is an eight-bit decimal number between zero and 255 e.g

70 Structure of Internet Addresses Original Internet address structure First eight bits: network address block (/8) Last 24 bits: host address 8 24 Network Host Assumed 256 networks were more than enough! (They weren t )

71 Next Design: Classful Addressing Constrain network, host parts to be fixed lengths Class A: Very large blocks (e.g., IBM, MIT, HP have /8 s) Class B: Large blocks (e.g., medium-sized organizations) Class C: Small blocks (e.g., very small organizations) Class A: Networks Hosts/network million Class B: 16,384 65,534 Class C: 2 million 254

72 Address Classes Inhibited Growth Class C networks too small for mid-sized organizations, so most organizations got a class B Resulting demand lead to scarcity of class B networks If network reaches the physical size limit imposed by the link layer, then need to allocate a new network address block to that organization, even though it hasn t filled its class B block! Number of networks Hosts/network Class A million Class B 16,384 65,535 Class C 2 million 256

73 Addressing in Today s Internet: CIDR Classless Interdomain Routing Classless: CIDR removes the constraint on network, host address size Flexible boundary between network, host addresses, resulting in high address assignment efficiency

74 CIDR Addressing Use two 32-bit numbers to represent a network. Network number = IP address AND mask IP address: IP mask: Address: Mask: Network number Host part Mask must be a contiguous prefix of 1s, starting from the most significant bit, then 0s thereafter; this gives rise to a mask length Written as network number/mask length; e.g /15 or 12.4/15

75 CIDR: Hierarchal Address Allocation Prefixes are key to Internet scalability Addresses allocated in contiguous chunks (prefixes) Routing protocols and packet forwarding based on prefixes / / / / / / / / / / / / / /17

76 CIDR Scalability: Address Aggregation Customer # /24 Customer # /24 Customer # /24 Customer # /24 Provider A Provider B Send me anything with addresses beginning /20 Send me anything with addresses beginning /16 Routers in the rest of Internet just need to know how to reach /20 Provider A can then direct packets to the correct customer Internet

77 Forwarding Packets Link 1 Provider A Link 4 Link 2 Link 3 Customer 1 Customer 2 Customer 3 Customer / / / /23 Prefix Link /22 Link /24 Link /24 Link /23 Link 4

78 Prefix Matching in Routers Packets only contain addresses, not prefix lengths. Route information in routers contains addresses with prefix lens / / / /23 Consider incoming packet with dest : First 21 bits match four partial prefixes First 22 bits match three partial prefixes First 23 bits match two partial prefixes First 24 bits match exactly one full prefix

79 Prefix Matching in Routers Packets only contain addresses, not prefix lengths. Route information in routers contains addresses with prefix lens / / / /23 Consider incoming packet with dest : First 21 bits match four partial prefixes First 22 bits match three partial prefixes First 23 bits match two partial prefixes First 24 bits match exactly one full prefix

80 Prefix Matching in Routers Packets only contain addresses, not prefix lengths. Route information in routers contains addresses with prefix lens / / / /23 Consider incoming packet with dest : First 21 bits match four partial prefixes First 22 bits match three partial prefixes First 23 bits match two partial prefixes First 24 bits match exactly one full prefix

81 Prefix Matching in Routers Packets only contain addresses, not prefix lengths. Route information in routers contains addresses with prefix lens / / / /23 Consider incoming packet with dest : First 21 bits match four partial prefixes First 22 bits match three partial prefixes First 23 bits match two partial prefixes First 24 bits match exactly one full prefix

82 Prefix Matching in Routers Packets only contain addresses, not prefix lengths. Route information in routers contains addresses with prefix lens / / / /23 Consider incoming packet with dest : First 21 bits match four partial prefixes First 22 bits match three partial prefixes First 23 bits match two partial prefixes First 24 bits match exactly one full prefix

83 Is Exact Matching All We Need? Customer # /24 Customer # /24 Customer # /24 Customer # /24 Provider A Provider B Send me anything with addresses beginning /20 Send me anything with addresses beginning /16 Routers in the rest of Internet just need to know how to reach /20 Provider A can then direct packets to the correct customer Internet

84 What if a Customer has 2 Providers? Customer # /24 Customer # /24 Customer # /24 Provider A Send me /20 Customer #1 Provider B Send me / /16, /24 Internet Multi-homed Customer #1 ( /24) has two providers Rest of Internet needs to know how to reach Customer #1 through either Therefore, /24 route must be globally visible

85 Consider Any Provider Beyond A, B Customer # /24 Internet Customer # /24 Provider A Send me /20 Customer # /24 Provider C Customer # /24 Provider B Send me /16, /24 Multi-homed Customer #1 ( /24) has two providers Rest of Internet needs to know how to reach Customer #1 through either Therefore, /24 route must be globally visible

86 Whom Should Provider C Forward To? Someone s one prefix is covered completely by another. E.g /24 is a subset of /20 in previous slide / /24 Consider incoming packet with dest :

87 Whom Should Provider C Forward To? Someone s one prefix is covered completely by another. E.g /24 is a subset of /20 in previous slide / / Consider incoming packet with dest : First 20 bits precisely match all of first prefix First 24 bits precisely match all of second prefix Which one should the router use?

88 Whom Should Provider C Forward To? Someone s one prefix is covered completely by another. E.g /24 is a subset of /20 in previous slide / / Consider incoming packet with dest : First 20 bits precisely match all of first prefix First 24 bits precisely match all of second prefix Which one should the router use?

89 Whom Should Provider C Forward To? Someone s one prefix is covered completely by another. E.g /24 is a subset of /20 in previous slide / / Consider incoming packet with dest : First 20 bits precisely match all of first prefix First 24 bits precisely match all of second prefix Which one should the router use? Use the longest prefix that matches completely

90 CIDR: Aggregation Not Always Possible Customer # /24 Customer # /24 Customer # /24 Provider A Send me /20, /24 Customer #1 Provider B Send me / /16, /24 Internet Multi-homed Customer #1 ( /24) has two providers Rest of Internet needs to know how to reach Customer #1 through either Therefore, /24 route must be globally visible. Must advertise the more specific prefix from both, or only provider B will be used

91 Are 32-bit Addresses Enough? Not all that many unique addresses: 2 32 = 4,294,967,296 Just over four billion Some (many) reserved for special purposes And addresses are allocated in larger blocks Many devices need IP addresses Computers, phones, routers, tanks, toasters, Long-term solution (perhaps): larger address space IPv6 has 128-bit addresses (2 128 = ) Short-term solutions: limping along with IPv4 Network address translation (NAT) Dynamically-assigned addresses (DHCP) Private addresses