1 Kyung Hee University Chapter 7 Internet Protocol Version 4 (IPv4)

2 Kyung Hee University 7.1 Introduction  The transmission mechanism used by the TCP/IP  Unreliable and connectionless datagram protocol Best-effort delivery service IP packets can be corrupted, lost, arrive out of order, or delayed and may create congestion for the network  Each datagram is handled independently  Each datagram can follow a different route to destination Datagram sent by the same source to the same destination could arrive out of order.

3 Kyung Hee University Position of IP in TCP/IP protocol suite

4 Kyung Hee University 7.2 Datagrams  Datagrams are packets in the network layer  Datagram is a variable-length packet consisting of header and data. The header is 20 to 60 bytes, contains information essential to routing and delivery It is customary in TCP/IP to show the header in 4-byte section  Field in Header Version(VER) – the version of IP protocol (4-bit) Header length(HLEN) – total length of the datagram header in 4-byte words.

5 Kyung Hee University IP Datagram

6 Kyung Hee University IP Datagram  TOS(Type of Service) – 8-bit CategoryCodepointAssigning Authority 1XXXXX0Internet : 24 services 2XXXX11Local 3XXXX01Temporary or experiment

7 Kyung Hee University IP Datagram  Total Length 16-bit field (limited to 65,535 bytes) Define the total length of the IP datagram in bytes Length of data = total length – header length  Encapsulation of a small datagram in an Ethernet frame Figure 7.4 Encapsulation of a small datagram in an Ethernet frame

8 Kyung Hee University IP Datagram  Identification – used in fragmentation  Flags – used in fragmentation  Fragmentation offset – used in fragmentation  Time to love – limited life time of datagram  Protocol – the higher level protocol that uses the services of the IP layer Fig. 7.5 Multiplexing

9 Kyung Hee University IP Datagram  Checksum – Check errors  Source address – The IP address of source  Destination address – The IP address of destination

10 Kyung Hee University Example 7.1 An IP packet has arrived with the first 8 bit shown: The receiver discards the packet. Why? Solution There is an error in this packet. The 4 left-most bit(0100) show the version, which is correct. The next 4 bit(0010) show the wrong header length(2 × 4 = 8). The minimum number of byte in the header must be 20. The packet has been corrupted in transmission.

11 Kyung Hee University Example 7.2 In an IP packet, the value of HLEN is 1000 in binary. How many byte of option are being carried by this packet? Solution The HLEN value is 8, which means the total number of bytes in the header is 8 × 4 or 32 bytes. The first 20 bytes are the base header, the next 12 bytes are the option.

12 Kyung Hee University Example 7.3 In an IP packet, the value of HLEN is 5 16 and the value of the total length field is How many bytes of data are being carried by this packet? Solution The HLEN value is 5, which mean the total number of bytes in the header is 5 × 4 or 20 bytes (no options). The total length is 40 bytes, which means the packet is carrying 20 bytes of data (40 − 20).

13 Kyung Hee University 7.3 Fragmentation  The format and size of the received frame depend on the protocol used by the physical network  When a datagram encapsulated in a frame, the total size of the datagram must be less than MTU(Maximum Transfer Unit) size  We must divide the datagram to make it possible to pass through the network; this is called fragmentation

14 Kyung Hee University MTU(Maximum Transfer Unit)

15 Kyung Hee University Fragmentation  The value of the MTU differs from one physical network protocol to another

16 Kyung Hee University Fields Related to Fragmentation  Identification – All fragments have the same identification value  Flag – 3-bit field  Fragmentation offset – 13-bit field, the relative position of this fragment with respect to the whole datagram

17 Kyung Hee University Fragmentation Example

18 Kyung Hee University Detailed Fragmentation Example

19 Kyung Hee University Example 7.5 A packet has arrived with an M bit value of 0. Is this first fragment, or a middle fragment? Do we know if the packet was fragment? Solution If the M bit is 0, it means that there are no more fragment; the fragment is the last one. However, we cannot say if the original packet was fragment or not. A nonfragmented packet is considered the last fragment.

20 Kyung Hee University Example 7.9 A packet has arrived in which the offset value is 100, the value of HLEN is 5 and the value of the total length field is 100. What is the number of the first byte and the last byte? Solution The first byte number is 100 × 8 = 800. The total length is 100bytes and the header length is 20bytes (5 × 4), which means that there are 80 bytes in this datagram. If the first byte number is 800, the last byte number must be 879.

21 Kyung Hee University 7.4 Options  Type field (8-bit) : Fixed length Copy : Control the presence of the option in fragmentation Class : Define the general purpose of the option Number : Define the type of option  Length field (8-bit) : Fixed length The total length of the option  Value field : Variable length Contain the data that specific options require

22 Kyung Hee University Option Format

23 Kyung Hee University Categories of Options

24 Kyung Hee University No Operation Option  1-byte option used as a filter between options

25 Kyung Hee University End-of-Option Option  1-byte option used for padding at the end of the option field

26 Kyung Hee University Record-Route Option  Used to record the Internet routers that handle the datagram

27 Kyung Hee University Record-Route Concept 48

28 Kyung Hee University Strict-Source-Route Option  Used by source to predetermine a route for the datagram as it travels through the Internet  All of routers defined in the option must be visited by the datagram

29 Kyung Hee University Strict-Source-Route Concept

30 Kyung Hee University Loose-Source-Route Option  Similar to the strict source route, but it is more relaxed. Each router in the list must be visited, but the datagram can visit other routers as well

31 Kyung Hee University Timestamp Option  Used to record the time of datagram processing by a router  The time is expressed in miliseconds from Universal Time

32 Kyung Hee University Use of Flag in Timestamp  Flag 0 : each router adds only the timestamp in the provided field  Flag 1 : each router must add its outgoing IP address and the timestamp  Flag 3 : the IP addresses are given, and each router must check the given IP address with its own incoming IP address 0 1

33 Kyung Hee University Timestamp Concept

34 Kyung Hee University Example 7.11 Which of the six option are used for datagram control and which are used for debugging and management? Solution We look at the second and third (left-most) bits of the type. a. No operation: type is ; datagram control. b. End of option: type is ; datagram control. c. Record route: type is ; datagram control. d. Strict source route: type is ; datagram control. e. Loose source route: type is ; datagram control. f. Timestamp: type is ; debugging and management control.

35 Kyung Hee University Example 7.12 One of the utilities available in UNIX to check the traveling of the IP packets is ping. In the next chapter, we talk about the ping program in more detail. In this example, we want to show how to use the program to see if a host is available. We ping a server at De Anza College named fhda.edu. The result shows that the IP address of the host is The result also shows the number of bytes used.

36 Kyung Hee University Example 7.15 The traceroute program can be used to implement loose source routing. The –g option allows us to define the routers to be visited, from the source to destination. The following shows how we can send a packet to the fhda.edu server with the requirement that the packet visit the router

37 Kyung Hee University Example 7.16 The traceroute program can also be used to implement strict source routing. The –G option forces the packet to visit the routers in the command line. The following shows how we can send a packet to the fhda.edu server and force the packet to visit only the router

38 Kyung Hee University 7.5 Checksum  Checksum – The error detection method used by most TCP/IP protocol Protect against the corruption that may occur during the transmission of a packet Redundant information added to the packet Calculated at the sender and the value obtained is sent with the packet The receiver repeats the same calculation on the whole packet including the checksum If the result is satisfactory, the packet is accepted; otherwise, it is rejected

39 Kyung Hee University Checksum Concept

40 Kyung Hee University Checksum in One’s Complement Arithmetic

41 Kyung Hee University Example 7.17 Figure shows an example of a checksum calculation at the sender site for an IP header without option. The header is divided into 16-bit sections. All the sections are added and the sum is complemented. The result is inserted in the checksum field. Example of checksum calculation at the sender

42 Kyung Hee University Example 7.18 Figure shows the checking of checksum calculation at the receiver site ( or intermediate router ) assuming that no errors occurred in the header. The header is divided into 16-bit sections. All the sections are added and the sum is complement. Since the result is 16 0s, the packet is accepted.

43 Kyung Hee University 7.6 IP over ATM  In this section, we want to see how an IP datagram is moving through a switched WAN such as an ATM The IP packet is encapsulated in cells An ATM network has its own definition for the physical address of a device Binding between an IP address and a physical address is attained through a protocol called ATMARP

44 Kyung Hee University An ATM WAN in the Internet

45 Kyung Hee University AAL Layer  The AAL layer used by the IP protocol is AAL5  The only AAL used by the Internet is AAL5 It is sometimes called the simple and efficient adaptation layer (SEAL).  AAL5 accepts an IP packet of no more than 65,536 bytes and adds 8-byte trailer  AAL5 passes the message in 48-byte segments to the ATM layer

46 Kyung Hee University Cell Routing  The cells start from the entering-point router and end at the exiting-point router

47 Kyung Hee University Address Binding in IP over ATM  An ATM network needs virtual circuit identifiers to route the cell IP datagram contains only source and destination IP address Virtual circuit identifiers must be determined from the destination IP address.

48 Kyung Hee University 7.7 Security  Since the IPv4 protocol was started when the Internet user trusted each other, no security was provided for the IPv4 protocol  Today, however, the situation is different The Internet is not secure any more  In this section, we give a brief idea about the security issues in IP protocol and the solution

49 Kyung Hee University Security Issues  Packet sniffing Passive attack The attacker does not change the contents of the packet Encryption of the packet – attacker cannot see the contents of packet  Packet modification Active attack The attacker intercepts the packet, change the contents of the packet Data integrity – receiver can make sure that packet has not been changed during the transmission  IP spoofing An attacker can masquerade as somebody else and create an IP packet that carries the source address of another computer Origin authentication mechanism can prevent this type of attack

50 Kyung Hee University IPSec (IP Security)  Create a connection-oriented service between two entities in which they can exchange IP packet without worrying about the three attacks discussed before  Defining Algorithms and Key The two entities that want to create a secure channel between themselves can agree on some available algorithms and keys to be used for security purpose  Packet Encryption Make the packet sniffing attack useless  Data Integrity Guarantee that the packet is not modified during the transmission  Origin Authentication Prevent IP spoofing attack

51 Kyung Hee University 7.8 IP Package  IP package involves eight component Header-adding module Processing module Forwarding module Fragmentation module Reassembly module Routing module MTU table Reassembly table

52 Kyung Hee University IP Component

53 Kyung Hee University IP Header-Adding Module

54 Kyung Hee University Processing Module

55 Kyung Hee University IP Package  Queue Input queue – store the datagram coming from the data link layer or the upper-layer protocols Output queue – store the datagram going to the data link layer or the upper-layer protocols  Routing table Used by the forwarding module to determine the next-hop address of the packet  Forwarding module Receive an IP packet from the processing module Find the IP address of the next station along with the interface number to which the packet should be sent  MTU table Used by the fragmentation module to find the maximum transfer unit of a particular interface

56 Kyung Hee University Fragmentation Module

57 Kyung Hee University Fragmentation Module

58 Kyung Hee University Reassembly Table  Used by reassembly module State field : FREE or IN-USE IP address field : define the source IP address of the datagram Datagram ID : number that uniquely defines a datagram Timeout : predetermined amount of time in which all fragments must arrive Fragment field : a pointer to a linked list of fragment

59 Kyung Hee University Reassembly Module

60 Kyung Hee University Summary  IP is an unreliable connectionless protocol responsible for source-to-destination delivery. Packets in the IP layer are called datagrams  The MTU is the maximum number of bytes that a data link protocol can encapsulate. MTUs vary from protocol to protocol. Fragmentation is the division of a datagram into smaller units to accommodate the MTU of a data link protocol  The IP datagram header consists of a fixed, 20-byte section and a variable options section with a maximum 40 bytes. The options section of the IP header is used for network testing and debugging. The six IP options each have a specific function

61 Kyung Hee University Summary  The error detection method used by IP is the checksum. The checksum, however, convers only the header, but not the data. The checksum uses one’s complement arithmetic to add equal-size sections of the IP header. The complement result is stored in the checksum field. The receiver also used one’s complement arithmetic to check the header.  IP over ATM uses AAL5 layer in an ATM network. An ATM network creates a route between an entering-point router and exiting-point router. The next-hop address of an IP packet can be mapped to a physical address of an exiting-point router using ATMARP  An IP package can consist of the following : a header-adding module, a processing module, a forwarding module, a fragmentation module, a reassembly module, a routing table, an MTU table, and a reassembly table.