* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download IP: Datagram and Addressing
IEEE 802.1aq wikipedia , lookup
Deep packet inspection wikipedia , lookup
Distributed firewall wikipedia , lookup
Wake-on-LAN wikipedia , lookup
Internet protocol suite wikipedia , lookup
Network tap wikipedia , lookup
Computer network wikipedia , lookup
Piggybacking (Internet access) wikipedia , lookup
Airborne Networking wikipedia , lookup
Recursive InterNetwork Architecture (RINA) wikipedia , lookup
The Internet Protocol: Related Protocols and Standards (IP datagram, addressing, ARP) Network Protocols and Standards Winter 2007-2008 Jan 15, 2008 CS573: Network Protocols and Standards 1 IPv4 IP Datagram Format IPv4 Addressing ARP and RARP IP Routing Basics Subnetting and Supernetting ICMP Network Address Translation (NAT) Dynamic Addressing Jan 15, 2008 CS573: Network Protocols and Standards 2 The Internet Protocol A network layer protocol Not Reliable: delivery not guaranteed Connectionless: no virtual circuit Jan 15, 2008 Packets may take different paths Packets may arrive out of order Best Effort: packets may be discarded when network resources are exhausted Reference RFC 791 CS573: Network Protocols and Standards 3 The IP Datagram The IP datagram (or Internet datagram) is the basic information unit The IP datagram is transported from one network to another Header area Data area Encapsulated in the network frame (layer 2 frame) within a particular network IP allows its datagrams to be fragmented Jan 15, 2008 Once a datagram is fragmented, its fragments travel as separate datagrams all the way to the final destination CS573: Network Protocols and Standards 4 The IP Datagram Datagram Header Data in the Datagram IP Datagram Frame Header Complete Datagram treated as data MAC Frame Jan 15, 2008 CS573: Network Protocols and Standards 5 IP Datagram Format 4 VERS 8 IHL 16 TYPE OF SERVICE IDENTIFICATION Fixed Portion of Header TIME TO LIVE 19 23 31 TOTAL LENGTH FLAGS PROTOCOL FRAGMENT OFFSET HEADER CHECKSUM SOURCE IP ADDRESS Header DESTINATION IP ADDRESS OPTIONS PADDING DATA …… Jan 15, 2008 CS573: Network Protocols and Standards 6 IP Datagram Fields VERS IHL Specifies IP protocol version in use See RFC 1700 for assigned versions Currently, IP version 4 or IPv4 IP Datagram header length (32-bit words) 5 IHL value 15 Total Length Specifies total length (data+header) Jan 15, 2008 Length is given in octets Max value is 65,535 bytes CS573: Network Protocols and Standards 7 IP Datagram Fields Type of Service (TOS) Hint to Network Elements Precedence 3 1 T 1 R Unused 1 2 bits Precedence: (priority) specifies importance of a datagram 111 110 101 100 D - Network Control Internetwork Control CRITIC/ECP Flash Override 011 010 001 000 - Flash - Immediate - Priority – Routine D: Requests low delay service T: Requests high throughput service R: Requests high reliability service Jan 15, 2008 CS573: Network Protocols and Standards 8 Fragmentation Control The following fields of the datagram header control fragmentation: IDENTIFICATION: contains a unique integer which identifies the datagram. Any gateway that fragments a datagram copies the IDENTIFICATION field into every fragment (host chooses a number to uniquely identify each datagram) FLAGS: (3 bits) contains a do not fragment bit and a more fragments bit, the third bit is unused. The more fragments bit allows a destination to know where the end of the original datagram is more fragments Jan 15, 2008 unused do not fragment FRAGMENT OFFSET: specifies the offset (in units of 8 bytes) of this fragment into the original datagram (all fragments except the last one must be multiples of 8 bytes) CS573: Network Protocols and Standards 9 Datagram Lifetime (TTL) The TIME TO LIVE field specifies how long (in seconds) a datagram is allowed to remain on the Internet system. Packets that exceed their lifetime are discarded. Since it is difficult for routers to know exact transit time in networks, simple rules are used: Jan 15, 2008 Each router along the path from source to destination decrements TIME TO LIVE by 1 when it processes the datagram header To handle the case of overloaded routers that may introduce long delays, the local arrival time is recorded and the TIME TO LIVE counter decrements by the number of seconds the datagram waited for service inside the router. CS573: Network Protocols and Standards 10 Other Datagram Header Fields PROTOCOL: (protocol ID) specifies which transport layer process is to receive this datagram. Assigned protocol IDs can be found in RFC1700. HEADER CHECKSUM: Checksum is computed only on the header (including OPTIONS), which reduces processing time at gateways (adds up all the 16 bit half-words using 1’s complement arithmetic then takes the one’s complement of the result) PADDING: octets containing zeros that are needed to ensure that the Internet header extends to an exact multiple of 32 bits (since the header length is specified in 32-bit words). Jan 15, 2008 CS573: Network Protocols and Standards 11 Internet Datagram Options The OPTIONS field is used for testing and debugging in the Internet, and for signaling special options The length varies, depending upon which options are selected. There are two cases for the format of an option: Jan 15, 2008 A single option code byte; or An option code byte, an option length byte, and data bytes associated with the option CS573: Network Protocols and Standards 12 Internet Datagram Options The option code octet is divided into three fields, as shown below: Copy Option Class 1 2 Option Number 5 bits Copy specifies how a gateway handles options during fragmentation. Copy=1 means the option is copied onto all fragments; Copy = 0 specifies that the option is only copied onto the first fragment Option Class: Option Class Meaning 0 Datagram or network control 1 Reserved for future use 2 Debugging and measurement 3 Reserved for future use Jan 15, 2008 CS573: Network Protocols and Standards 13 IP Option Numbers Option Class Option Number Length Description 0 0 1 End of option list: Used if options do not end at end of datagram 0 1 1 No operation 0 2 11 Security and handling restrictions 0 3 Var Loose source routing: Used to route datagram along specified path 0 7 Var Record route: Used to trace route 0 9 Var Strict source routing: Used to route datagram along a specified path 2 4 Var Internet timestamp: Used to record timestamps along the route Var is used for variable Jan 15, 2008 CS573: Network Protocols and Standards 14 Record Route Option The Record Route option provides a way to monitor how gateways route datagrams 24 32 bits CODE (7) LENGTH POINTER FIRST INTERNET ADDRESS SECOND INTERNET ADRESS ……… CODE: specifies the option number and class LENGTH: gives length of option as it appears in IP datagram INTERNET ADDRESS: denotes the area reserved for internet addresses. This region is initially empty. Each router along the datagram path enters its address on the list POINTER: points to next available internet address slot in the option. When a gateway receives the datagram, it puts its address in the slot given by the pointer Jan 15, 2008 CS573: Network Protocols and Standards 15 Source Route Options The Source Route options allow network designers to dictate the path of a datagram through the network Strict Source Routing: specifies a sequence of internet addresses which a datagram must follow. The path between any two addresses can consist of only a single physical network Loose Source Routing: specifies a sequence of internet addresses which a datagram must follow. The path between any two addresses may consist of multiple network hops The format of the option is very similar to the Record Route option There is a code, length, and pointer, along with a list of Internet addresses forming the specified route Jan 15, 2008 CS573: Network Protocols and Standards 16 Timestamp Option The timestamp option, like the record route option, has an initially-empty list, and each router along the path from source to destination fills in one item on the list. Entries here are the times at which the datagram passes through a particular gateway and (possibly) the identity of the gateway The value of the timestamp is the number of milliseconds since midnight, Universal Time Jan 15, 2008 CS573: Network Protocols and Standards 17 IPv4 IP Datagram Format IPv4 Addressing ARP and RARP IP Routing Basics Subnetting and Supernetting ICMP Network Address Translation (NAT) Dynamic Addressing Jan 15, 2008 CS573: Network Protocols and Standards 18 Internet Addresses (IP Addresses) Defined when IP was standardized in 1981 IPv4 addresses are 32-bit long and consist of: a network address part – network identifier a host address part – host number within that network IPv4 addresses are grouped into classes (A, B, C) depending on the size of the network identifier and the host part of the address A fourth class (Class D) was defined later (1988) for Multicast addresses Jan 15, 2008 CS573: Network Protocols and Standards 19 Internet Address Classes 0 8 Class A 0 Class B 10 Class C 110 Class D 1110 Class E 11110 Jan 15, 2008 16 NETWORK 24 32 bits HOST (24 BITS) NETWORK HOST (16 BITS) NETWORK HOST (8 BITS) IP MULTICAST ADDRESSES (28 BITS) RESERVED FOR EXPERIMENTS CS573: Network Protocols and Standards 20 Internet Address Classes Class A Class B 126 networks (0 and 127 reserved) Assigned to very large size networks where 65K < number of hosts < 16M 16384 networks Assigned to Intermediate size networks where 256 < number of hosts < 65K Class C Jan 15, 2008 2097152 networks Assigned to smaller networks where #hosts < 256 CS573: Network Protocols and Standards 21 Dotted Decimal Notation Internet addresses are represented in text by the dotted decimal notation each byte is written in decimal values (from 0 to 255) example: 10000000 00001010 00000010 00011110 is written as 128. 10. 2. 30 Jan 15, 2008 CS573: Network Protocols and Standards 22 Internet Address Classes Jan 15, 2008 Class Lowest Network Identifier Address Highest Network Identifier Address A 1.0.0.0 126.0.0.0 B 128.0.0.0 191.255.0.0 C 192.0.0.0 223.255.255.0 D 224.0.0.0 239.255.255.255 E 240.0.0.0 247.255.255.255 CS573: Network Protocols and Standards 23 Uniqueness of IP Addresses Network numbers are assigned by a central authority Network numbers are unique worldwide Host numbers are assigned by network managers The Internet Network Information Center (InterNIC) Another authority, the IANA – Internet Assigned Numbers Authority sets policy They must be unique within a given network Thus, IP addresses are unique worldwide. Jan 15, 2008 CS573: Network Protocols and Standards 24 Special Purpose IP Addresses 0.0.0.0 255.255.255.255 Means the host on this network Host part all ones Means limited broadcast. Used as a destination address to send packets to all hosts on the local network where the source is. Packets sent to this address are never relayed Network part all zeros Means this host, used by machines as source address when they boot up (if they don’t know their IP address, and need to get it from a boot server) Broadcast address on the network specified in the network identifier; routers typically do not forward these datagrams Host part all zeros Jan 15, 2008 Broadcast address on the network specified in the network identifier (it was an implementation error in some networks) CS573: Network Protocols and Standards 25 Special Purpose IP Addresses 127.x.x.x 224.0.0.1 Means loopback (datagrams are looped back in software; they are not sent on any physical interface) Multicast address for “All systems on this subnetwork” 224.0.0.2 Jan 15, 2008 Multicast address for “All routers on this subnetwork” CS573: Network Protocols and Standards 26 Internet Addresses ALL 0’s ALL 0’s This Host HOST Limited broadcast (local net) ALL 1’s NET 127 Jan 15, 2008 ALL 1’s ANYTHING Host on this network Directed broadcast (for NET) Loopback CS573: Network Protocols and Standards 27 IPv4 IP Datagram Format IPv4 Addressing ARP and RARP IP Routing Basics Subnetting and Supernetting ICMP Network Address Translation (NAT) Dynamic Addressing Jan 15, 2008 CS573: Network Protocols and Standards 28 Translating Between IP and MAC Addresses (ARP and RARP) Each interface has an IP address at Layer 3, and a MAC address at Layer 2 Assume that host A wants to send a packet to host B (A and B on the same network) Host A knows the IP address of host B; however, in order to transmit the packet, host A must somehow know or find out what the MAC (layer 2) address of host B is! Solution: the Address Resolution Protocol (ARP), RFC826 Jan 15, 2008 CS573: Network Protocols and Standards 29 Address Resolution Protocol Used to find the physical address of a target device on the local physical network, given only the target’s IP address Mechanism: Jan 15, 2008 The source broadcasts a special packet asking the device with target IP address to respond with a message carrying the (IP address, physical address) mapping All devices on the local physical network receive the broadcast, but only the target recognizes its IP address and responds to the request When the source receives the reply, it sends the packet to the target using the target’s physical address and places the mapping in its cache (a cache is used to prevent repeated broadcasts for the same destination) CS573: Network Protocols and Standards 30 More on ARP ARP refinements Source includes its <IP address, physical address> mapping in the ARP request anticipating the target’s need for it in the near future. This avoids extra network traffic When all machines receive the ARP request broadcast, they can store the address mapping in their cache. Do they? ARP is used when an IP to physical address mapping changes to notify hosts on the network of the change ARP messages are encapsulated in MAC frames. A special value in the type field of the frame is used to indicate that it is carrying an ARP message (0806 hex is used for ARP) Entries in the local ARP cache for each host time out after a certain period Jan 15, 2008 CS573: Network Protocols and Standards 31 ARP Message Format 0 8 16 24 HARDWARE TYPE HLEN 31 PROTOCOL TYPE PLEN OPERATION SENDER HA (octets 0-3) SENDER HA (octetS 4-5) SENDER IP (octetS 0-1) SENDER IP (octetS 2-3) TARGET HA (octets 0-1) TARGET HA (octets 2-5) TARGET IP (octets 0-3) Jan 15, 2008 CS573: Network Protocols and Standards 32 ARP Message HARDWARE TYPE: specifies type of hardware interface for which the request is made (e.g., 1 for Ethernet) PROTOCOL TYPE: specifies high level protocol address supplied in message (e.g. 0800 hex for IP) HLEN and PLEN: specify length of fields for hardware address and protocol address respectively OPERATION: specifies if this is an ARP request or reply message (1 for ARP request, 2 for ARP response, 3 for RARP request and 4 for RARP response) HA and IP: hardware and IP addresses respectively Jan 15, 2008 CS573: Network Protocols and Standards 33 Reverse ARP Usually, a machine’s IP address is kept on its secondary storage (OS finds it at start up) Issue : Diskless Workstations! files are stored on a remote server need IP address to use TCP/IP to obtain initial boot image Solution : Use physical address to identify machine Given a physical network address, find the corresponding Internet address Reverse Address Resolution Protocol (RARP), RFC903 Jan 15, 2008 CS573: Network Protocols and Standards 34 RARP Mechanism Mechanism allows a host to ask about an arbitrary target Sender broadcasts a RARP request, supplying its physical network address in the Target HA field Only machines authorized to supply the RARP service (RARP servers) process the request and send a reply filling in the target internet address thus sender HA is separate from target HA address RARP server replies to sender’s HA Ethernet frame Protocol Type for RARP is 8035 hex Jan 15, 2008 CS573: Network Protocols and Standards 35