Classful IP Addressing. Classless Addressing: CIDR. Routing & Forwarding: Logical View of a Router. IP Addressing: Basics

Transcription

1 Switching and Forwarding Switching and Forwarding Generic Router rchitecture Forwarding Tables: ridges/layer Switches; VLN Routers and Layer 3 Switches Forwarding in Layer 3 (Network Layer) Network Layer Functions Network Service Models: VC vs. Datagram TM and IP Datagram Forwarding IP ddressing Network vs. host: address blocks, longest prefix matching ddress allocation and DHCP IP Datagram Forwarding Model and RP Protocol IP and ICMP Protocols, IP Fragmentation and Re-assembly 5 D 3 3 C E Routing & Forwarding: Logical View of a Router 5 F Readings: Textbook: Chapter 4: Section 4.; IP ddressing: asics Globally unique (for public IP addresses) IP address: 3-bit identifier for host, router interface Interface: connection between host/router and physical link router s typically have multiple interfaces host may have multiple interfaces IP addresses associated with each interface Dot notation (for ease of human reading) 3... = IP ddressing: Network vs. Host Two-level hierarchy network part (high order bits) host part (low order bits) What s a network? (from IP address perspective) device interfaces with same network part of IP address can physically reach each other without intervening router multi-access LN point-to-point link class C D Classful IP ddressing 0network host 0 network host 0 network host 0 multicast address to to to to bits Disadvantage: inefficient use of address space; address space exhaustion e.g., class net allocated enough addresses for 65K hosts, even if only K hosts in that network Classless ddressing: CIDR CIDR: Classless InterDomain Routing Network portion of address is of arbitrary ddresses allocated in contiguous blocks Number of addresses assigned always power of ddress format: a.b.c.d/x x is number of bits in network portion of address network host part part /3 5 6

2 Representation of ddress locks Human Readable address format: a.b.c.d/x x is number of bits in network portion of address, the network portion is also called the network prefix machine representation of a network (addr block): using a combination of first IP of address blocks of the network network mask ( x s followed by 3-x 0 s network w/ address block: /3 first IP address of address block: network mask: More Examples Three ddress locks: First IP address: Network mask: First IP address: Last IP address: what is the network prefix? First IP address: Last IP address: what is the network prefix? Given an IP address, which network (or address block) does it belong to? Example : Example : Use longest prefix matching! 7 8 nother Example Consider a datagram network using 3-bit host addresses, suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: Destination ddr Range Link Interface through through through 0000 O.W. 3 Provide the forwarding table a table containing the network prefix and the outgoing interface. IP ddresses: How to Get One? Q: How does host get IP address? static assigned: i.e., hard-coded in a file Wintel: control-panel->network->configuration->tcp/ip- >properties UNIX: /etc/rc.config Dynamically assigned: using DHCP (Dynamic Host Configuration Protocol) dynamically get address from a server plug-and-play 9 0 DHCP: Dynamic Host Configuration Protocol Goal: allow host to dynamically obtain its IP address from network DHCP server when it joins network Can renew its lease on address in use llows reuse of addresses (only hold address while connected as on ) Support for mobile users who want to join network (more shortly) DHCP overview: host broadcasts DHCP discover msg DHCP server responds with DHCP offer msg host requests IP address: DHCP request msg DHCP server sends address: DHCP ack msg DHCP Client-Server Scenario 3... DHCP server E arriving ii DHCP client needs address in this network

3 DHCP Client-Server Scenario DHCP server: time DHCP request DHCP discover src: , 68 dest:: , 67 yiaddrr: transaction ID: 655 Lifetime: 3600 secs src : , 68 dest.: ,67 yiaddr: transaction ID: 654 DHCP offer src: 3...5, 67 dest: , 68 yiaddrr: transaction ID: 654 Lifetime: 3600 secs DHCP CK src: 3...5, 67 dest: , 68 yiaddrr: transaction ID: 655 Lifetime: 3600 secs arriving client IP ddresses: How to Get One? Q: How does a network get network part of IP addr? : gets an allocated portion of its provider ISP s address space ISP's block /0 Organization /3 Organization /3 Organization / Organization /3 3 4 IP ddressing: the Last Word... Q: How does an ISP get block of addresses? : ICNN: Internet Corporation for ssigned Names and Numbers allocates addresses manages DNS assigns domain names, resolves disputes NT: Network ddress Translation rest of Internet ll datagrams leaving local network have same single source NT IP address: , different source port numbers local network (e.g., home network) 0.0.0/4 Datagrams with source or destination in this network have 0.0.0/4 address for source, destination (as usual) /8 has been reserved for private networks! 5 6 NT: Network ddress 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). NT: Network ddress Translation Implementation: NT router must: outgoing datagrams: replace (source IP address, port #) of every outgoing datagram to (NT IP address, new port #)... remote clients/servers will respond using (NT IP address, new port #) as destination addr. remember (in NT translation table) every (source IP address, port #) to (NT IP address, new port #) translation pair incoming datagrams: replace (NT IP address, new port #) in dest fields of every incoming datagram with corresponding (source IP address, port #) stored in NT table 7 8 3

4 : NT router changes datagram source addr from , 3345 to , 500, updates table NT: Network ddress Translation NT translation table WN side addr LN side addr , , 3345 S: , 500 D: , 80 S: , 80 D: , : Reply arrives dest. address: , S: , 3345 D: , S: , 80 4 D: , 3345 : host sends datagram to , : NT router changes datagram dest addr from , 500 to , 3345 NT: Network ddress Translation 6-bit port-number field: 60,000 simultaneous connections with a single LN-side address! NT is controversial: routers should only process up to layer 3 violates end-to-end argument NT possibility must be taken into account by app designers, eg, PP applications address shortage should instead be solved by IPv6 9 0 IP Forwarding & IP/ICMP Protocol Nt Network layer Routing protocols path selection RIP, OSPF, GP Transport layer: TCP, UDP routing table IP protocol addressing conventions packet handling conventions ICMP protocol error reporting router signaling Data Link layer (Ethernet, WiFi, PPP, ) Physical Layer (SONET, ) IP Service Model and Datagram Forwarding Connectionless (datagram-based) Each datagram carries source and destination est-effort delivery (unreliable service) packets may be lost packets can be delivered out of order duplicate copies of a packet may be delivered packets can be delayed for a long time Forwarding rdin and IP address forwarding based on network id Delivers packet to the appropriate network Once on destination network, direct delivery using host id IP destination-based next-hop forwarding paradigm Each host/router has IP forwarding table Entries like <network prefix, next-hop, output interface> IP protocol version number header (3-bit words) type of data max number remaining hops (decremented at each router) upper layer protocol to deliver payload to how much overhead with TCP? 0 bytes of TCP 0 bytes of IP = 40 bytes + app layer overhead IP Datagram Format 3 bits ver head. type of len service fragment 6-bit identifier flgs time to upper Internet live layer checksum 3 bit source IP address 3 bit destination IP address Options (if any) data (variable, typically a TCP or UDP segment) total datagram (bytes) for fragmentation/ reassembly E.g. timestamp, record route taken, specify list of routers to visit. IP Datagram Forwarding Model IP datagram: misc source dest fields IP addr IP addr data datagram remains unchanged, as it travels source to destination addr fields of interest here forwarding table in Dest. Net. next router Nhops E 3 4 4

5 IP Forwarding Table 4 billion possible entries! (in reality, far less, but can still have millions of routes ) forwarding table entry format destination network next-hop (IP address) link interface ( st IP address, network mask ) , , - (direct) Forwarding Table Lookup using Longest Prefix Matching Prefix Match Next Hop Link Interface otherwise Examples D: Which interface? , otherwise D: Which interface? 5 6 IP Forwarding: Destination in Same Net Dest. misc fields data Starting at, send IP datagram addressed to : look up net. address of in forwarding table find is on same net. as link layer will send datagram directly to inside link-layer frame and are directly connected forwarding table in Net. next router Nhops E IP Datagram Forwarding on Same LN: Interaction of IP and data link layers Starting at, given IP datagram addressed to : look up net. address of, find on same net. as link layer send datagram to inside link-layer frame frame source, dest address s MC addr s MC addr frame s IP addr s IP addr datagram source, dest address datagram E IP payload 7 8 MC (Physical) ddresses -- Revisited used to get frames from one interface to another physicallyconnected interface (same physical network, i.e., pp or LN) 48 bit MC address (for most LNs) fixed for each adaptor, burned in the adapter ROM MC address allocation administered by IEEE st bit: 0 unicast, multicast. all s : broadcast MC flat address -> portability can move LN card from one LN to another MC addressing operations on a LN: each adaptor on the LN sees all frames accept a frame if dest. MC address matches its own MC address accept all broadcast (MC= all s) frames accept all frames if set in promiscuous mode can configure to accept certain multicast addresses (first bit = ) MC vs. IP ddresses 3-bit IP address: network-layer address, logical i.e., not bound to any physical device, can be re-assigned IP hierarchical address NOT portable depends on IP network to which an interface is attached when move to another IP network, IP address re-assigned used to get IP packets to destination IP network Recall how IP datagram forwarding is performed IP network is virtual, actually packet delivery done by the underlying physical networks from source host to destination host, hop-by-hop via IP routers over each link, different link layer protocol used, with its own frame headers, and source and destination MC addresses Underlying physical networks do not understand IP protocol and datagram format!

6 RP: ddress Resolution Protocol RP Protocol Question: how to determine MC address of knowing s IP address? Each IP node (host, router) on LN has RP table RP Table: IP/MC address mappings for some LN nodes < IP address; MC address; timer> timer: time after which address mapping will be forgotten (typically 5 min) wants to send datagram to, and knows s IP address. looks up s MC address in its RP table Suppose s MC address is not in s RP table. broadcasts (why?) RP query packet, containing 's IP address all machines on LN receive RP query receives RP packet, replies to with its ('s) MC address frame sent to s MC address (unicast) caches (saves) IP-to-MC address pair in its RP table until information becomes old (times out) soft state: information that times out (goes away) unless refreshed RP is plug-and-play : nodes create their RP tables without intervention from net administrator 3 3 RP Messages Hardware ddress Type: e.g., Ethernet Protocol address Type: e.g., IP Operation: RP request or RP response RP Request & Response Processing The requester broadcasts RP request The target node unicasts (why?) RP reply to requester With its physical address dds the requester into its RP table (why?) On receiving the response, requester updates its table, sets timer Other nodes upon receiving the RP request Refresh the requester entry if already there No action otherwise (why?) Some questions to think about: Shall requester buffer IP datagram while performing RP? What shall requester do if never receive any RP response? RP Operation Illustration IP Forwarding: Destination in Diff. Net misc fields data forwarding table in Dest. Net. next router Nhops Starting at, dest. E: look up network address of E in forwarding table E on different network, E not directly attached routing table: next hop router to E is link layer sends datagram to router inside linklayer frame datagram arrives at continued E

7 IP Forwarding: Destination in Diff. Net misc forwarding table in router fields data Dest. Net router Nhops interface rriving at 3..4, destined for 3... look up network address of E in router s forwarding table E on same network as router s interface router, E directly attached link layer sends datagram to 3... inside link-layer frame via interface datagram arrives at 3...!!! (hooray!) E Forwarding to nother LN: Interaction of IP and Data Link Layer walkthrough: send datagram from to via R assume knows IP address R Two RP tables in router R, one for each IP network (LN) In routing table at source host, find router...0 In RP table at source, find MC address E6-E , etc R creates datagram with source, destination uses RP to get R s MC address for...0 creates link-layer frame with R's MC address as dest, frame contains -to- IP datagram s data link layer sends frame R s data link layer receives frame R removes IP datagram from Ethernet frame, sees its destined to R uses RP to get s physical layer address R creates frame containing -to- IP datagram sends to IP protocol version number header (bytes) type of data max number remaining hops (decremented at each router) upper layer protocol to deliver payload to how much overhead with TCP? 0 bytes of TCP 0 bytes of IP = 40 bytes + app layer overhead IP Datagram Format gain 3 bits ver head. type of len service fragment 6-bit identifier flgs time to upper Internet live layer checksum 3 bit source IP address 3 bit destination IP address Options (if any) data (variable, typically a TCP or UDP segment) total datagram (bytes) for fragmentation/ reassembly E.g. timestamp, record route taken, specify list of routers to visit Fields in IP Datagram IP protocol version: current version is 4, IPv4, new: IPv6 Header : number of 3-bit words in the header Type of Service: 3-bit priority,e.g, delay, throughput, reliability bits, Total : including header (maximum bytes) Identification: all fragments of a packet have same identification Flags: don t fragment, more fragments Fragment : where in the original packet (count in 8 byte units) Time to live: maximum life time of a packet Protocol Type: e.g., ICMP, TCP, UDP etc IP Option: non-default processing, e.g., IP source routing option, etc. IP Fragmentation & Reassembly: Why network links have MTU (maximum transmission unit) - largest possible data gram. 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 reassembly fragmentation: in: one large datagram out: 3 smaller datagrams 4 4 7

8 IP Fragmentation & Reassembly: How n IP datagram is chopped by a router into smaller pieces if datagram size is greater than network MTU Don t fragment option is not set Each datagram has unique datagram identification Generated by source hosts ll fragments of a packet carry original datagram id ll fragments except the last have more flag set Fragment and Length fields are modified appropriately Fragments of IP packet can be further fragmented by other routers along the way to destination! Reassembly only done at destination host (why?) Use IP datagram id, fragment, fragment flags. Length IP Fragmentation and Reassembly: Exp Example 4000 byte datagram MTU = 500 bytes =4000 ID =x fragflag =0 =0 One large datagram becomes several smaller datagrams ID fragflag =500 =x = =0 =500 =040 ID =x ID =x fragflag = fragflag =0 =85 = ICMP: Internet Control Message Protocol used by hosts, routers, gateways to communicate network-level information error reporting: unreachable host, network, port, protocol echo request/reply (used by ping) network-layer above IP: ICMP msgs carried in IP datagrams ICMP message: type, code plus first 8 bytes of IP datagram causing error Type Code description 0 0 echo reply (ping) 3 0 dest. network unreachable 3 dest host unreachable 3 dest protocol unreachable 3 3 dest port unreachable 3 6 dest network unknown 3 7 dest host unknown 4 0 source quench (congestion control - not used) 8 0 echo request (ping) 9 0 route advertisement 0 0 router discovery 0 TTL expired 0 bad IP header ICMP Message Transport & Usage ICMP messages carried in IP datagrams Treated like any other datagrams ut no error message sent if ICMP message causes error Message sent to the source 8 bytes of the original header included ICMP Usage (non-error, informational): Examples Testing reachability: ICMP echo request/reply ping Tracing route to a destination: Time-to-live field traceroute Path MTU discovery Don t fragment bit IP direct (for hosts only): inform hosts of better routes