1 / 17

Address Translation

Address Translation. Outline Datalink layer intro ARP RARP DHCP. Context Reset. We have been talking about the network layer (IP) Routing algorithms Switch design Fragmentation ICMP Etc… Our model for networks thus far

ajansson
Télécharger la présentation

Address Translation

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. Address Translation Outline Datalink layer intro ARP RARP DHCP

  2. Context Reset • We have been talking about the network layer (IP) • Routing algorithms • Switch design • Fragmentation • ICMP • Etc… • Our model for networks thus far • Hosts (routers or end nodes) connected by point to point links typically in the wide area • Exception was discussion of bridging where local area networks were mentioned CS 640

  3. Moving below the Network Layer • Our model for networks in remaining lectures is a set of nodes for which a router would not forward packets • That is, a local area network (LAN) • LANs are enabled at the datalink and physical layers which will be our next focus areas • Data Link: defines how hosts access physical media • Copper, fiber, air • Physical: defines how bits are represented on wire • We’ll be skipping LOTS of material in these areas! CS 640

  4. A Quick Word about Datalink Layer • Also called Media Access Control (MAC) • Host access to physical media is enabled through Network Interface Cards (NICs) • Ethernet is the most common for LAN access • But, it used to be a closer call • Token ring, Fiber Distributed Data Interconnect (FDDI) • Datalink networks • Point to point, Shared bus, Bridged • Limited physical extent • Each NIC has a unique link layer address • Different from IP address CS 640

  5. Transition from Network to Datalink • How do we get datagrams to the right physical host? • Communication ultimately takes place at physical level • Tricky part comes when a router is forwarding to a LAN with multiple hosts (which is typically the case) • IP datagrams contain an IP address • Configured in OS • NIC’s only understand addressing of their particular network • Ethernet uses 48 bit MAC addresses (unique world wide) CS 640

  6. Address Translation Problem • We need a means for mapping IP addresses into MAC (physical) addresses • Destination host • Next hop router • We can then encapsulate (surpirse!) IP datagrams inside a frame with link level address • Possible mapping techniques • Encode physical address in host part of IP address • Make physical address the same as the host portion of IP address • Obviously not possible using IPv4 and Ethernet • Build a table of IP/MAC pairs • How is it maintained? CS 640

  7. Address Resolution Protocol (ARP) • ARP is part of the TCP/IP specification • Enable each host to build table of IP to physical address bindings • Dynamic binding protocol – no static entries in table • Allows new nodes to be easily added to broadcast network • Simple idea: broadcast request if an IP address not in table • Supported by link level technology • Determine host B’s physical address PB from it IP address IB • Host A broadcasts an ARP request containing IB to all hosts on LAN • Host B responds with an ARP reply containing the pair (IB ,PB ) CS 640

  8. ARP Implementation • ARP Packet Details • HardwareType: type of physical network (e.g., Ethernet) • ProtocolType: type of higher layer protocol (e.g., IP) • HLEN & PLEN: length of physical and protocol addresses • Provides for flexibility to handle a variety of network technologies • Operation: request or response • Source/Target-Physical/Protocol addresses • Notes • Table entries timeout in about 10 minutes (caching is important) • Update table with source when you are the target • Update table even if there is already an entry • Do not refresh table entries upon reference • IP addresses are assigned independently of a systems HW addresses CS 640

  9. 0 8 16 31 Hardware type = 1 ProtocolT ype = 0x0800 HLen = 48 PLen = 32 Operation SourceHardwareAddr (bytes 0 – 3) SourceHardwareAddr (bytes 4 – 5) SourceProtocolAddr (bytes 0 – 1) SourceProtocolAddr (bytes 2 – 3) T argetHardwareAddr (bytes 0 – 1) T argetHardwareAddr (bytes 2 – 5) T argetProtocolAddr (bytes 0 – 3) ARP Packet Format CS 640

  10. Determining an IP Address at Startup • How does a machine without permanent storage determine its IP address? • OS images with specific IP’s cannot be used on multiple machines • Critical for network appliances or embedded systems • Use the network to obtain an IP from a remote server • System must use its physical address to to communicate • Requests address from server which maintains table of IP’s • System doesn’t know the server - sends broadcast request for address CS 640

  11. Reverse Address Resolution Protocol • RARP is part of the TCP/IP specification • RARP operates much like ARP • A requestor broadcasts is RARP request • Servers respond by sending response directly to requestor • Requestor keeps IP delivered by first responder • Requestor keeps sending requests until it gets an IP • Clearly there is a need for redundant RARP servers for reliability • Timeouts can be used to activate backup RARP servers • Backup servers reply to a RARP request if they don’t hear the RARP response from the primary server after some time CS 640

  12. Alternatives to RARP • RARP has shortcomings • Most are subtle and all deal with fact that RARP operates at physical level • BOOTstrap Protocol (BOOTP) was developed as an alternative to RARP – moves process to network level • Uses UDP/IP packets to carry messages • Hosts are still identified by MAC address • How can UDP running over IP be used by a computer to discover its IP address? • Uses special case IP address 255.255.255.255 – limited broadcast – not forwarded by routers • Forces IP to broadcast on LAN before host IP is known • BOOTP server responds using limited broadcast • Request transmission via random timeout to avoid synchronization CS 640

  13. Dynamic Configuration • BOOTP was designed for relatively static environment where each host has a permanent network connection • Net manager creates a BOOTP config file with parameters for each host – file is typically stable for long periods • Wireless networking enables environments much more dynamic • BOOTP does not provide for dynamic address assignment • Dynamic configuration is the primary method for IP address allocation used today • Not only facilitates mobility but also efficient use of IPs CS 640

  14. Dynamic Host Configuration Protocol • DHCP extends BOOTP • Still supports static allocation • Supports automatic configuration where addresses are permanent but assigned by DHCP • Supports temporary allocation • Relies on existence of a DHCP server • Repository for host configuration information • Maintains a pool of available IP’s for use on demand • Considerably reduces administration overhead • Autoconfiguration of course depends on administrative policy • Uses UDP to send messages • Uses a relay agent to communicate with servers off LAN (same as BOOTP) • Relay agent is statically configured with DHCP server address CS 640

  15. DHCP Implementation • State machine (6 states) which determines DHCP operation • Host boots into INITIALIZE state • To contact the DHCP server(s) a client sends DHCPDISCOVER message to IP broadcast address and moves to SELECT state • Unique header format with variable length options field • UDP packet sent to well known BOOTP port 67 • Server(s) respond with DHCPOFFER message • Client can receive 0 or more responses and responds to one • Client moves to REQUEST state to negotiate IP lease with 1 server • Sends DHCPREQUEST message to server which responds with DHCPACK • Client is then in BOUND (normal) state CS 640

  16. DHCP Implementation contd. • From BOUND, client can issue DHCPRELEASE and return to INITIALIZE state • This is simply client deciding it no longer needs the IP • When lease reaches 50% of lease expiration time, it issues DHCPREQUEST to extend lease of current IP with server and moves to RENEW state • Receipt of DHCPACK moves client back to BOUND state • Receipt of DHCPNACK moves client back to INITIALIZE state • If no response is received by 87.5% of lease expiration time, the client resends the DHCPREQUEST and moves to REBIND state • Receipt of DHCPACK moves client back to BOUND state • Receipt of DHCPNACK or timeout moves client back to INITIALIZE state CS 640

  17. DHCP Details • Without relay agent, DHCP would not scale since it would require large number of servers (one per LAN) • Addresses which are leased over a given period of time and must be updated • This means that DHCP requests might have to be made multiple times by the same system (RENEW requests) • DHCP does not interact with DNS • Binding between IP assigned by DHCP and host name must be made independently • Possible result 1: No host name given • Possible result 2: Host is automatically assigned a preallocated domain name with its IP • Possible results 3: Hosts are assigned permanent names • Requires additional mechanisms which do not yet exist CS 640

More Related