1 / 59

Network Layer

Network Layer. Goals: understand principles behind network layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, mobility instantiation and implementation in the Internet. Datagram vs Virtual Circuit Router IP: Internet Protocol

chantale-scott
Télécharger la présentation

Network Layer

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. Network Layer Goals: • understand principles behind network layer services: • routing (path selection) • dealing with scale • how a router works • advanced topics: IPv6, mobility • instantiation and implementation in the Internet Network Layer

  2. Datagram vs Virtual Circuit Router IP: Internet Protocol Datagram format, IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP, OSPF, BGP Topics: Network Layer

  3. transport segment from sending to receiving host on sending side encapsulates segments into datagrams on rcving side, delivers segments to transport layer network layer protocols in every host, router Router examines header fields in all IP datagrams passing through it 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 application transport network data link physical application transport network data link physical Network layer Network Layer

  4. Key Network-Layer Functions • forwarding: move packets from router’s input to appropriate router output • 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 Network Layer

  5. routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 2 2 1 value in arriving packet’s header 1 0111 2 3 Interplay between routing and forwarding Network Layer

  6. 3rd important function in some network arch.: Virtual circuits network provides network-layer conn service used in ATM, frame-relay, X.25 Signaling protocols used to setup, maintain teardown VC application transport network data link physical application transport network data link physical Connection setup 6. Receive data 5. Data flow begins 4. Call connected 3. Accept call 1. Initiate call 2. incoming call Network Layer

  7. VC implementation A VC consists of: • Path from source to destination • VC numbers, one number for each link along path • Entries in forwarding tables in routers along path • Packet belonging to VC carries a VC number. • VC number must be changed on each link. • New VC number comes from forwarding table Network Layer

  8. VC number 22 32 12 3 1 2 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 VC Forwarding table in northwest router: Routers maintain connection state information! Forwarding table is modified whenever there’s conn setup or teardown (happen at a microsecond timescale in a tier-1 router) Network Layer

  9. Example services for individual datagrams: guaranteed delivery Guaranteed delivery with less than certain delay (e.g. 40 msec)? Example services for a flow of datagrams: In-order datagram delivery Guaranteed minimum bandwidth to flow Restrictions on changes in inter-packet spacing Network service model Q: What service model for “channel” transporting datagrams from sender to rcvr? a service model defines the characteristics of end-to-end transport of packets between Network Layer

  10. two-byte ER (Explicit Rate) field in RM cell congested switch may lower ER value in cell sender’ send rate thus minimum supportable rate on path across all switches EFCI (Explicit Forward Congestion Indication) bit in data cells: set to 1 in congested switch to indicate congestion to destination host. when RM arrives at destination, if most recently received data cell has EFCI=1, sender sets CI bit in returned RM cell Case study: ATM ABR congestion control Network Layer

  11. Network layer service models: Guarantees ? Network Architecture Internet ATM ATM ATM ATM Service Model best effort CBR VBR ABR UBR Congestion feedback no (inferred via loss) no congestion no congestion yes no Bandwidth none constant rate guaranteed rate guaranteed minimum none Loss no yes yes no no Order no yes yes yes yes Timing no yes yes no no CBR: constant bit rate VBR: variable bit rate ABR: available bit rate UBR: unspecified bit rate Network Layer

  12. Internet data exchange among computers “elastic” service, no strict timing req. “smart” end systems can adapt, perform control, error recovery simple inside network, complexity at “edge” Additional func built in higher levels many link types different characteristics uniform service difficult VC network (e.g. ATM) evolved from telephony human conversation: strict timing, reliability requirements need for guaranteed service “dumb” end systems telephones complexity inside network (e.g. network-assisted congestion control) Datagram or VC network: why? Network Layer

  13. Router IP: Internet Protocol Datagram format, IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP, OSPF, BGP Topics: Network Layer

  14. Router Architecture Overview Two key router functions: • run routing algorithms/protocol (RIP, OSPF, BGP) • forwarding datagrams from incoming to outgoing link • E.g. Cisco 12K, Juniper M16, Foundry SuperX Network Layer

  15. Input Port Functions Decentralized switching: • given datagram dest., lookup output port using forwarding table in input port memory • 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 Network Layer

  16. Three types of switching fabrics Network Layer

  17. Memory Input Port Output Port System Bus 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) Recent development: Processors in input line cards perform lookup and storing packets into memory:  shared mem multiprocessors E.g. Cisco’s Catalyst 8500 Network Layer

  18. 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 • 1 Gbps bus, Cisco 1900: sufficient speed for access and enterprise routers (not regional or backbone) • E.g. 1Gbps bw supports up to 10 T3 (45- Mbps) links Network Layer

  19. Switching Via An Interconnection Network • overcome bus bandwidth limitations • A crossbar switch is an interconnection network consisting of 2n buses that connect n input to n output ports. • Advanced design: fragmenting datagram into fixed length cells at the input port, switch cells through the fabric and assemble at output ports. • Cisco 12000: switches 60 Gbps through the interconnection network Omega Network Layer

  20. Output Ports • Buffering required when datagrams arrive from fabric faster than the transmission rate • Queueing and Buffer management • Scheduling discipline chooses among queued datagrams for transmission Network Layer

  21. Output port queueing • buffering when arrival rate via switch exceeds output line speed (switching fabric speed: rate of moving pkt from in-ports to out-ports) • queueing (delay) and loss due to output port buffer overflow! • Buffer size = RTT times Link Capacity • A packet scheduler at output port must choose among queued to transmit using FIFO or more sophisticated such as weighted fair queuing (WFQ) that shares the outgoing link fairly among different end-to-end connections. Network Layer

  22. Input Port Queuing • If fabric slower than input ports combined then queueing may occur at input queues. It can be eliminated if the switching fabric speed is at least n times as fast as the input line speed, where n is the number of input ports • Head-of-the-Line (HOL) blocking: queued datagram at front of queue prevents others in queue from moving forward. Only occurs at input ports. As soon as the packet arrival rate on the input lines reaches 58% of their capacity, the input queue will grow to unbounded length, due to HOL blocking • queueing delay and loss due to input buffer overflow! Network Layer

  23. Active Queue Management • Drop-Tail policy • Drop arrival packets due to overflow • Random Early Detection (RED) • Maintain a weighted average for the length of the output queue • If queue length < Threshold_min, admit it • If queue length > Threshold_max, drop it • Otherwise, drop it with a probability (a function of the average queue length) • RED drops packets before the buffer is full in order to provide congestion signals to senders Network Layer

  24. Router Processor • Execute routing protocols • Maintain the routing information and forwarding tables • Perform network management functions CISCO 12000 Gigabit Router Processor (GRP) Network Layer

  25. Forwarding table • packets forwarded using destination host address • The tables are modified by routing alg anytime (every 1~5 minutes) • packets between same source-dest pair may take diff paths Destination Address RangeLink Interface 11001000 00010111 00010000 00000000 through 0 11001000 00010111 00010111 11111111 11001000 00010111 00011000 00000000 through 1 11001000 00010111 00011000 11111111 11001000 00010111 00011001 00000000 through 2 11001000 00010111 00011111 11111111 otherwise3 Network Layer

  26. Longest prefix matching Forwarding table with 4 entries and using longest prefix match: Prefix MatchLink Interface 11001000 00010111 00010 0 11001000 00010111 00011000 1 11001000 00010111 00011 2 otherwise 3 Examples Which interface? DA: 11001000 00010111 00010110 10100001 DA: 11001000 00010111 00011000 10101010 Network Layer

  27. HEADER Forwarding Engine Dstn Addr Next Hop Next HopComputation Forwarding Table Dstn-prefix Next Hop ---- ---- ---- ---- Incoming Packet ---- ---- Lookup in an IP Router Unicast destination address based lookup Need to be as fast as line speed!! e.g OC48 link runs at 2.5Gbps, packet=256bytes  1 million lookups/s Low storage : ~100K entries Fast updates: few thousands per second, but ideally at lookup speed Network Layer

  28. Location Prefix Next-hop 1 0 P1 103.23.122/23 171.3.2.22 1 P2 103.23/16 171.3.2.4 1 0 P3 101.1/16 120.33.32.98 2 Priority Encoder 103.23.122.7 P1 0 P4 101.20/13 320.3.3.1 3 0 P5 100/9 10.0.0.111 4 0 5 0 6 Route Lookup Using CAM • Content-Address Memory: Fully associative mem: Cisco 8500 • Exact match (fixed-length) search op in a single clock cycle To find the longest prefix cheaply, need to keep entries sorted in order of decreasing prefix lengths K. pagiamtzis, Intro to CAM pagiamtzis.com/cam/camintro.html Network Layer

  29. Router IP: Internet Protocol Datagram format, IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP, OSPF, BGP Topics: Network Layer

  30. Host, router network layer functions: • ICMP protocol • error reporting • router “signaling” • IP protocol • addressing conventions • datagram format • packet handling conventions • Routing protocols • path selection • RIP, OSPF, BGP forwarding table The Internet Network layer Transport layer: TCP, UDP Network layer Link layer physical layer Network Layer

  31. IP protocol version number 32 bits total datagram length, bytes) header length (bytes) type of service head. len ver Datagram length for fragmentation/ reassembly fragment offset “type” of data flgs 16-bit identifier max number remaining hops (decremented at each router) upper layer time to live Header checksum 32 bit source IP address 32 bit destination IP address upper layer protocol to deliver payload to 6 for tcp, 17 for udp E.g. timestamp, record route taken, specify list of routers to visit. Options (if any) data (variable length, typically a TCP or UDP segment) IP datagram format how much overhead with TCP? • 20 bytes of TCP • 20 bytes of IP • = 40 bytes + app layer overhead Network Layer

  32. network links have MTU (max.transfer size) - largest possible link-level frame. different link types, different MTUs large IP datagram divided (“fragmented”) within net one datagram becomes several datagrams “reassembled” only at final destination IP header bits used to identify, order related fragments IP Fragmentation & Reassembly fragmentation: in: one large datagram out: 3 smaller datagrams reassembly Network Layer

  33. length =1500 length =1500 length =1040 length =4000 ID =x ID =x ID =x ID =x fragflag =0 fragflag =0 fragflag =1 fragflag =1 offset =0 offset =0 offset =185 offset =370 One large datagram becomes several smaller datagrams IP Fragmentation and Reassembly Example • 4000 byte IP datagram • MTU = 1500 bytes • (4000-20 bytes header)=3980 bytes of data to be fragmented • 3 fragments (1480+1480+1020=3980) • amount of data in all but last fragment must be multiples of 8 offset = 1480/8 1480 bytes in data field Network Layer

  34. IP address: 32-bit identifier for host, router interface, in dotted-decimal notation interface: connection between host/router and physical link router’s typically have multiple interfaces host typically has one interface IP addresses associated with each interface 223.1.1.2 223.1.2.2 223.1.2.1 223.1.3.2 223.1.3.1 223.1.3.27 IP Addressing: introduction 223.1.1.1 223.1.2.9 223.1.1.4 223.1.1.3 223.1.1.1 = 11011111 00000001 00000001 00000001 223 1 1 1 Network Layer

  35. IP address: subnet part (high order bits) host part (low order bits) What’s a subnet ? device interfaces with same subnet part of IP address can physically reach each other without intervening router Subnets (aka IP networks) 223.1.1.1 223.1.2.1 223.1.1.2 223.1.2.9 223.1.1.4 223.1.2.2 223.1.1.3 223.1.3.27 subnet 223.1.3.2 223.1.3.1 network consisting of 3 subnets To determine the subnets, detach each interface from its host or router, creating islands of isolated networks. Each isolated network is called a subnet. Network Layer

  36. How many? Subnets 223.1.1.2 223.1.1.1 223.1.1.4 223.1.1.3 223.1.7.0 223.1.9.2 223.1.9.1 223.1.7.1 223.1.8.1 223.1.8.0 223.1.2.6 223.1.3.27 223.1.2.1 223.1.2.2 223.1.3.1 223.1.3.2 Network Layer

  37. host part subnet part 11001000 0001011100010000 00000000 200.23.16.0/23 IP addressing: CIDR CIDR:Classless InterDomain Routing • subnet portion of address of arbitrary length • address format: a.b.c.d/x, where x is # bits in subnet portion of address. • Notation /x is subnet mask. The high order x bits are the network prefix. • Before CIDR, classful addressing: A (/8), B(/16), C(/24). Replaced by CIDRized address. Network Layer

  38. IP addresses: how to get one? Q: How does host get IP address? • hard-coded by system admin in a file • Wintel: control-panel->network->configuration->tcp/ip->properties • UNIX: /etc/rc.config • DHCP:Dynamic Host Configuration Protocol: dynamically get address from as server • “plug-and-play” Network Layer

  39. DHCP (Dynamic Host Configuration Protocol) The DHCP relay agent (implemented in the IP router) records the subnet from which the message was received in the DHCP message header for use by the DHCP server. 5: DataLink Layer

  40. IP addresses: how to get one? Q: How does network get subnet part of IP addr? A: gets allocated portion of its provider ISP’s address space ISP's block 11001000 00010111 00010000 00000000 200.23.16.0/20 Organization 0 11001000 00010111 00010000 00000000 200.23.16.0/23 Organization 1 11001000 00010111 00010010 00000000 200.23.18.0/23 Organization 2 11001000 00010111 00010100 00000000 200.23.20.0/23 ... ….. …. …. Organization 7 11001000 00010111 00011110 00000000 200.23.30.0/23 Network Layer

  41. 200.23.16.0/23 200.23.18.0/23 200.23.30.0/23 200.23.20.0/23 . . . . . . Hierarchical addressing: route aggregation Hierarchical addressing allows efficient advertisement of routing information. Organization 0 Organization 1 “Send me anything with addresses beginning 200.23.16.0/20” Organization 2 Fly-By-Night-ISP Internet Organization 7 “Send me anything with addresses beginning 199.31.0.0/16” ISPs-R-Us Two example businesses Network Layer

  42. 200.23.16.0/23 200.23.18.0/23 200.23.30.0/23 200.23.20.0/23 . . . . . . Hierarchical addressing: more specific routes Assume ISPs-R-Us has been acquired by FBN-ISP and Org1 be transferred to ISPs-R-Us: Organization 0 “Send me anything with addresses beginning 200.23.16.0/20” Organization 2 Fly-By-Night-ISP Internet Organization 7 “Send me anything with addresses beginning 199.31.0.0/16 or 200.23.18.0/23” ISPs-R-Us Organization 1 Network Layer

  43. IP addressing: the last word... Q: How does an ISP get a block of addresses? A: ICANN: Internet Corporation for Assigned Names and Numbers: www.icann.org • allocates address space • Top-level domain name system management • manages DNS root servers • Protocol identifier assignment • assigns domain names, resolves disputes Network Layer

  44. NAT: Network Address Translation rest of Internet local network (e.g., home network) 10.0.0/24 10.0.0.1 10.0.0.4 10.0.0.2 138.76.29.7 10.0.0.3 Datagrams with source or destination in this network have 10.0.0/24 address for source, destination (as usual) All datagrams leaving local network have same single source NAT IP address: 138.76.29.7, different source port numbers Network Layer

  45. NAT: Network Address Translation • Motivation: local network uses just one IP address as far as outside world is concerned: • no need to be allocated range of addresses from ISP: - just one IP address is used for all devices • can change addresses of devices in local network without notifying outside world • can change ISP without changing addresses of devices in local network • devices inside local net not explicitly addressable, visible by outside world (a security plus). Network Layer

  46. NAT: Network Address Translation Implementation: NAT router must: • outgoing datagrams:replace (source IP address, port #) of every outgoing datagram to (NAT IP address, new port #) . . . remote clients/servers will respond using (NAT IP address, new port #) as destination addr. • remember (in NAT translation table) every (source IP address, port #) to (NAT IP address, new port #) translation pair • incoming datagrams:replace (NAT IP address, new port #) in dest fields of every incoming datagram with corresponding (source IP address, port #) stored in NAT table Network Layer

  47. 2 4 1 3 S: 138.76.29.7, 5001 D: 128.119.40.186, 80 S: 10.0.0.1, 3345 D: 128.119.40.186, 80 1: host 10.0.0.1 sends datagram to 128.119.40.186, 80 2: NAT router changes datagram source addr from 10.0.0.1, 3345 to 138.76.29.7, 5001, updates table S: 128.119.40.186, 80 D: 10.0.0.1, 3345 S: 128.119.40.186, 80 D: 138.76.29.7, 5001 NAT: Network Address Translation NAT translation table WAN side addr LAN side addr 138.76.29.7, 5001 10.0.0.1, 3345 …… …… 10.0.0.1 10.0.0.4 10.0.0.2 138.76.29.7 10.0.0.3 4: NAT router changes datagram dest addr from 138.76.29.7, 5001 to 10.0.0.1, 3345 3: Reply arrives dest. address: 138.76.29.7, 5001 Network Layer

  48. NAT: Network Address Translation • 16-bit port-number field: • 60,000 simultaneous connections with a single LAN-side address! • NAT is controversial: • routers should only process up to layer 3 but NAT router need to change the transport port. • violates end-to-end argument • NAT possibility must be taken into account by app designers, eg, P2P applications • address shortage should instead be solved by IPv6 Network Layer

  49. Skype through NAT • NAT prevents a connection from being initiated from outside. • How can Alice call Bob, both residing behind NAT (NAT traversal) ?? • Alice sign-in with its super-peer (Sa) • Bob sign-in with its super-peer (Sb) • Alice calls Bob: Alice  SaSbBob • If Bob takes the call, Sa and Sb select a non-NAT super-peer for voice relay • See chapter 2 (4th ed) for details Network Layer

  50. Host, router network layer functions: • ICMP protocol • error reporting • router “signaling” • IP protocol • addressing conventions • datagram format • packet handling conventions • Routing protocols • path selection • RIP, OSPF, BGP forwarding table Recap: Internet Network layer Transport layer: TCP, UDP Network layer Link layer physical layer Network Layer

More Related