1. 1 Wide Area Networks and Internet CT1403 Lecture-8: Internet Network Layer (Part-3) By : Najla Al-Nabhan

2. Lecture goals:  understand principles behind:  Address Resolution Protocol (ARP) in the Internet  Network layer service models (Connection & Connectionless)  forwarding versus routing  how a router works  routing (path selection)  Internet broadcast, multicast

3. Network layer: Recall!  transport segment from sending to receiving host  on sending side encapsulates segments into datagrams  on receiving side, delivers segments to transport layer  network layer protocols in every host, router  router examines header fields in all IP datagrams passing through it application transport network data link physical application transport network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical

4. Network Layer 4-33 The Internet network layer forwarding table host, router network layer functions: routing protocols path selection RIP, OSPF, BGP IP protocol addressing conventions datagram format packet handling conventions ICMP protocol error reporting router “signaling” transport layer: TCP, UDP link layer physical layer network layer

5. IP Routing Process  When packet arrives, look up dest addr  local network?  send immediately to destination  distant network?  forward to next router on the interface given in routing table  not in the routing table?  forward to default gateway

6. Address Resolution Protocol (ARP)

7.  Because there are both network -layer addresses (IP address) and link- layer addresses (that is MAC address), there is a need to translate between them  For Internet, this translation is the job of the Address Resolution Protocol (ARB)  MAC address allocation administered by IEEE. Manufacturer buys portion of MAC address space (to ensure uniqueness)  Analogy:  MAC address: like Social Security Number  IP address: like postal address

8. ARP: address resolution protocol ARP table: each IP node (host, router) on LAN has table  IP/MAC address mappings for some LAN nodes:  TTL (Time To Live): time after which address mapping will be forgotten (typically 20 min) Question: how to determine interface’s MAC address, knowing its IP address? 1A-2F-BB-76-09-AD 58-23-D7-FA-20-B0 0C-C4-11-6F-E3-98 71-65-F7-2B-08-53 LAN 137.196.7.23 137.196.7.78 137.196.7.14 137.196.7.88

9. ARP protocol in the Internet: same LAN 1.A wants to send datagram to B  B’s MAC address not in A’s ARP table. 2.A broadcasts ARP query packet, containing B's IP address  dest MAC address = FF-FF-FF- FF-FF-FF  all nodes on LAN receive ARP query 3.B receives ARP packet, replies to A with its (B's) MAC address  frame sent to A’s MAC address (unicast) 4. A caches (saves) IP-to- MAC address pair in its ARP table until information becomes old (times out)  soft state: information that times out (goes away) unless refreshed 5. ARP is “plug-and-play”:  nodes create their ARP tables without intervention from net administrator

10. walkthrough: send datagram from A to B via R  focus on addressing – at IP (datagram) and MAC layer (frame)  assume A knows B’s IP address  assume A knows IP address of first hop router, R (how?)  assume A knows R’s MAC address (how?) Addressing: routing to another LAN R 1A-23-F9-CD-06-9B 222.222.222.220 111.111.111.11 0 E6-E9-00-17-BB-4B CC-49-DE-D0-AB-7D 111.111.111.11 2 111.111.111.11 1 74-29-9C-E8-FF-55 A 222.222.222.222 49-BD-D2-C7-56-2A 222.222.222.221 88-B2-2F-54-1A-0F B

11. R 1A-23-F9-CD-06-9B 222.222.222.220 111.111.111.11 0 E6-E9-00-17-BB-4B CC-49-DE-D0-AB-7D 111.111.111.11 2 111.111.111.11 1 74-29-9C-E8-FF-55 A 222.222.222.222 49-BD-D2-C7-56-2A 222.222.222.221 88-B2-2F-54-1A-0F B Addressing: routing to another LAN IP Eth Phy IP src: 111.111.111.111 IP dest: 222.222.222.222  A creates IP datagram with IP source A, destination B  A creates link-layer frame with R's MAC address as dest, frame contains A-to-B IP datagram MAC src: 74-29-9C-E8-FF-55 MAC dest: E6-E9-00-17-BB-4B

12. R 1A-23-F9-CD-06-9B 222.222.222.220 111.111.111.11 0 E6-E9-00-17-BB-4B CC-49-DE-D0-AB-7D 111.111.111.11 2 111.111.111.11 1 74-29-9C-E8-FF-55 A 222.222.222.222 49-BD-D2-C7-56-2A 222.222.222.221 88-B2-2F-54-1A-0F B Addressing: routing to another LAN IP src: 111.111.111.111 IP dest: 222.222.222.222  R forwards datagram with IP source A, destination B  R creates link-layer frame with B's MAC address as dest, frame contains A-to-B IP datagram MAC src: 1A-23-F9-CD-06-9B MAC dest: 49-BD-D2-C7-56-2A IP Eth Phy IP Eth Phy

13. R 1A-23-F9-CD-06-9B 222.222.222.220 111.111.111.11 0 E6-E9-00-17-BB-4B CC-49-DE-D0-AB-7D 111.111.111.11 2 111.111.111.11 1 74-29-9C-E8-FF-55 A 222.222.222.222 49-BD-D2-C7-56-2A 222.222.222.221 88-B2-2F-54-1A-0F B Addressing: routing to another LAN  R forwards datagram with IP source A, destination B  R creates link-layer frame with B's MAC address as dest, frame contains A-to-B IP datagram IP src: 111.111.111.111 IP dest: 222.222.222.222 MAC src: 1A-23-F9-CD-06-9B MAC dest: 49-BD-D2-C7-56-2A IP Eth Phy IP Eth Phy

14. R 1A-23-F9-CD-06-9B 222.222.222.220 111.111.111.11 0 E6-E9-00-17-BB-4B CC-49-DE-D0-AB-7D 111.111.111.11 2 111.111.111.11 1 74-29-9C-E8-FF-55 A 222.222.222.222 49-BD-D2-C7-56-2A 222.222.222.221 88-B2-2F-54-1A-0F B Addressing: routing to another LAN  R forwards datagram with IP source A, destination B  R creates link-layer frame with B's MAC address as dest, frame contains A-to-B IP datagram IP src: 111.111.111.111 IP dest: 222.222.222.222 MAC src: 1A-23-F9-CD-06-9B MAC dest: 49-BD-D2-C7-56-2A IP Eth Phy

15. Two key network-layer functions  network layer has three major functions: 1.forwarding: move packets from router’s input to appropriate router output 2.routing: determine route taken by packets from source to dest.  routing algorithms analogy: routing: process of planning trip from source to dest forwarding: process of getting through single interchange

16. 1 2 3 0111 value in arriving packet’s header routing algorithm local forwarding table header value output link 0100 0101 0111 1001 32213221 Interplay between routing and forwarding routing algorithm determines end-end-path through network forwarding table determines local forwarding at this router

17. Connection setup  Connection setup is the 3 rd important function in some network architectures; (such as ATM, frame relay, X.25)  Occurs before data transfer:  3-way handshake in TCP Connection  All routers in the Virtual Circuit (VC) need to handshake with each other in order to establish virtual connection  routers get involved  network vs transport layer connection service:  network: between two hosts (may also involve intervening routers in case of VCs)  transport: between two processes

18. Network service model Q: What service model for “channel” transporting datagrams from sender to receiver? example services for an individual datagram:  guaranteed delivery  guaranteed delivery with less than 40 msec delay example services for a flow of datagrams:  in-order datagram delivery  guaranteed minimum bandwidth to flow  restrictions on changes in inter-packet spacing

19. Network layer service models: Network Architecture Internet ATM Service Model best effort CBR ABR Bandwidth none constant rate guaranteed minimum No loss no yes no Order no yes Timing no yes no Congestion feedback no (inferred via loss) no congestion yes (indicated) Guarantees ?

20. virtual circuit and datagram networks

21. Connection, connection-less service  Transport layer provides connection & connection-less services between two processes  Network layer provides connection OR connection-less services between two hosts  datagram network provides network-layer connectionless service  virtual-circuit network provides network-layer connection service  analogous to TCP/UDP connection-oriented / connectionless transport-layer services, but:  service: host-to-host  no choice: network provides one or the other (not both)  implementation: in network core

22. Virtual circuits  call setup, teardown for each call before data can flow  each packet carries VC identifier (not destination host address)  every router on source-dest path maintains “state” for each passing connection  link, router resources (bandwidth, buffers) may be allocated to VC (dedicated resources = predictable service) “source-to-dest path behaves much like telephone circuit”  performance-wise  network actions along source-to-dest path

23. VC implementation a VC consists of: 1.path from source to destination 2.VC numbers, one number for each link along path 3.entries in forwarding tables in routers along path  packet belonging to VC carries VC number (rather than dest address)  VC number can be changed on each link.  new VC number comes from forwarding table

24. VC forwarding table 12 22 32 1 2 3 VC number interface number Incoming interface Incoming VC # Outgoing interface Outgoing VC # 1 12 3 22 2 63 1 18 3 7 2 17 1 97 3 87 … … forwarding table in northwest router: VC routers maintain connection state information!

25. application transport network data link physical Virtual circuits: signaling protocols  used to setup, maintain and terminate VC  used in ATM, frame-relay, X.25  not used in today’s Internet 1. initiate call 2. incoming call 3. accept call 4. call connected 5. data flow begins 6. receive data application transport network data link physical

26. Datagram networks  no call setup at network layer  routers: no state about end-to-end connections  no network-level concept of “connection”  packets forwarded using destination host address 1. send datagrams application transport network data link physical application transport network data link physical 2. receive datagrams

27. 1 2 3 Datagram forwarding table IP destination address in arriving packet’s header routing algorithm local forwarding table dest address output link address-range 1 address-range 2 address-range 3 address-range 4 32213221 4 billion IP addresses, so rather than list individual destination address list range of addresses (aggregate table entries)

28. Destination Address Range 11001000 00010111 00010000 00000000 through 11001000 00010111 00010111 11111111 11001000 00010111 00011000 00000000 through 11001000 00010111 00011000 11111111 11001000 00010111 00011001 00000000 through 11001000 00010111 00011111 11111111 otherwise Link Interface 0 1 2 3 Q: but what happens if ranges don’t divide up so nicely? Datagram forwarding table

29. Longest prefix matching Destination Address Range 11001000 00010111 00010*** ********* 11001000 00010111 00011000 ********* 11001000 00010111 00011*** ********* otherwise DA: 11001000 00010111 00011000 10101010 examples: DA: 11001000 00010111 00010110 10100001 which interface? when looking for forwarding table entry for given destination address, use longest address prefix that matches destination address. longest prefix matching Link interface 0 1 2 3

30. Datagram or VC network: why? Internet (datagram)  data exchange among computers  “elastic” service, no strict timing req.  many link types  different characteristics  uniform service difficult  “smart” end systems (computers)  can adapt, perform control, error recovery  simple inside network, complexity at “edge” ATM (VC)  evolved from telephony  human conversation:  strict timing, reliability requirements  need for guaranteed service  “dumb” end systems  telephones  complexity inside network

31. what’s inside a router

32. Router architecture overview two key router functions:  run routing algorithms/protocol (RIP, OSPF, BGP)  forwarding datagrams from incoming to outgoing link high-seed switching fabric routing processor router input ports router output ports forwarding data plane (hardware) routing, management control plane (software) forwarding tables computed, pushed to input ports

33. line termination link layer protocol (receive) lookup, forwarding queueing Input port functions decentralized switching:  given datagram dest., lookup output port using forwarding table in input port memory (“match plus action”)  goal: complete input port processing at ‘line speed’  queuing: if datagrams arrive faster than forwarding rate into switch fabric physical layer: bit-level reception data link layer: e.g., Ethernet see chapter 5 switch fabric

34. Switching fabrics  transfer packet from input buffer to appropriate output buffer  switching rate: rate at which packets can be transfer from inputs to outputs  often measured as multiple of input/output line rate  N inputs: switching rate N times line rate desirable  three types of switching fabrics memory bus crossbar

35. Switching via memory first generation routers:  traditional computers with switching under direct control of CPU  packet copied to system’s memory  speed limited by memory bandwidth (2 bus crossings per datagram) input port (e.g., Ethernet) memory output port (e.g., Ethernet) system bus

36. Switching via a bus  datagram from input port memory to output port memory via a shared bus  bus contention: switching speed limited by bus bandwidth  32 Gbps bus, Cisco 5600: sufficient speed for access and enterprise routers bus

37. Switching via interconnection network  overcome bus bandwidth limitations  banyan networks, crossbar, other interconnection nets initially developed to connect processors in multiprocessor  advanced design: fragmenting datagram into fixed length cells, switch cells through the fabric.  Cisco 12000: switches 60 Gbps through the interconnection network crossbar

38. Output ports  buffering required when datagrams arrive from fabric faster than the transmission rate  scheduling discipline chooses among queued datagrams for transmission line termination link layer protocol (send) switch fabric datagram buffer queueing

39. Output port queueing  buffering when arrival rate via switch exceeds output line speed  queueing (delay) and loss due to output port buffer overflow! at t, packets more from input to output one packet time later switch fabric switch fabric

40. Input port queuing  fabric slower than input ports combined -> queueing may occur at input queues  queueing delay and loss due to input buffer overflow!  Head-of-the-Line (HOL) blocking: queued datagram at front of queue prevents others in queue from moving forward output port contention: only one red datagram can be transferred. lower red packet is blocked switch fabric one packet time later: green packet experiences HOL blocking switch fabric

41. Midterm Revision: Your Questions: Please Ask! Difficult to Understand Topics?