Module 11 IP Traffic Management, ARP, RARP, ICMP, IGMP

1
Module 11 IP Traffic Management, ARP, RARP,
ICMP, IGMP
2

• Textbook sections
• LG Section 7.7 Traffic Management and QoS
• BF Chapter 8 ARP and RARP
• BF Chapter 9 Internet Control Message Protocol
  (ICMP)
• BF Chapter 10 Internet Group Management Protocol
  (IGMP)
• Topics
• IP Traffic Management
• ARP RARP
• Internet Control Message Protocol (ICMP)
• Internet Group Management Protocol (IGMP)

3
1. IP Traffic Management

• FIFO (first in, first out)
• The first packet received is the first to be sent
  out
• Priority queuing
• A very stringent algorithm that can cause one
  type of traffic to monopolize available
  bandwidth, because as long as there are
  high-priority packets in the queue, theyll be
  processed first. Other traffic is processed only
  when theres available bandwidth left over from
  high-priority traffic.
• Fair queuing
• Share equally with all traffic but gives low
  volume traffic higher priority. Instead of
  assigning priorities to each packet, this
  algorithm tracks the session that a packet
  belongs to. There is no queue list to configure
  or apply to the interface.
• Three different systems
• Ideal fluid flow fair queuing system
• Packet-by packet fair queuing system
• Packet-by-packet weighted fair queuing system

4
1. IP Traffic Management

• Quality of Service (QoS)
• A set of metrics used to measure the quality of
  transmission and service available of any given
  transmission system.
• A guaranteed throughput level for critical
  network application. QoS parameters are used in
  traffic engineering to state the level of loss
  (inverse of throughput), latency, and jitter that
  a traffic stream will be guaranteed in a network.
• Queue
• Broadly, any list of elements arranged in an
  orderly fashion and ready for processing.
• In routing, it refers to a backlog of information
  packets waiting in line to be transmitted over a
  router interface.

5
LG Figure 7.42 (a) FIFO queuing (b) FIFO queuing
with discard priority
(a)
Packet buffer
Arriving packets
Transmission link
Packet discard when full
(b)
Packet buffer
Arriving packets
Transmission link
Class 1 discard when full
Class 2 discard when threshold exceeded
6
LG Figure 7.43 Head-of-line (HOL) priority
queueing
Packet discard when full
High-priority packets
Transmission link
Low-priority packets
When high-priority queue empty
Packet discard when full
7
LG Figure 7.44 Sorting packets according to
priority tag
Sorted packet buffer
Arriving packets
Tagging unit
Transmission link
Packet discard when full
8
1. IP Traffic Management

• Ideal fluid flow fair queuing system
• Transmission bandwidth is divided equally among
  all nonempty queues. (For example, if the total
  number of flows in the system is n and the
  transmission capacity is C, then each flow is
  guaranteed at least C/n (bits/second)
• One approach could be to service each nonempty
  queue one bit at a time in round-robin fashion

9
1. IP Traffic Management

• Packet-by-packet fair queueing system
• One approach could be to service each nonempty
  queue one packet at a time in round-robin
  fashion.
• This approach is not really fair. For example,
  if the packets of one flow are twice the size of
  packets in another flow, then in the long run the
  first flow will obtain twice the bandwidth of the
  second flow.
• A better Approach is based on finish tag concept.
  The goal of this approach is to to have each
  packets completion time approximate that of a
  ideal fluid flow fair queuing system
• Each time a packet arrives at a queue, the
  completion time of the packet is derived from an
  ideal fluid flow fair queuing system. The number
  is used as a finish tag for the packet.
• Each time the transmission of a packet is
  complete. The next packet to be transmit is the
  one with smallest finish tag among all of the
  queues.

10
1. IP Traffic Management

• Packet-by-packet weighted fair queuing system
• Because different users have different
  requirements, each user flow has a weight that
  determines its relative share of the bandwidth.

11
1. IP Traffic Management

• Calculation of finish tags
• Notation
• k k-th packet
• i i-th flow
• C Capacity in bits/second
• P(i,k) length of k-th packet from i-th flow in
  bits
• R(t) the number of rounds at time t in bits
• F(i,k) finish tag of k-th packet for i-th flow
• Case 1 Empty queue Suppose that k-th packet from
  flow i arrives at an empty queue at time tki and
  suppose that the packet has length P(i,k), then
• F(i,k) R(tki ) P(i,k)
• finish tag bits completed at time tki packet
  length in bits

12
1. IP Traffic Management

• Calculation of finish tags
• Case 2 Non-empty queue Suppose that k-th packet
  from flow i arrives at an non-empty queue at time
  tki and suppose that the packet has length
  P(i,k), then
• F(i,k) F(i, k-1) P(i,k)
• finish tag finish tag of the previous packet in
  queue packet length in bits
• General case for packet-by-packet fair queueing
  system
• F(i,k) max F(i, k-1), R(tki) P(i,k)

13
1. IP Traffic Management

• Calculation of finish tags
• General case for packet-by-packet weighted fair
  queueing system
• F(i,k) max F(i, k-1), R(tki) P(i,k)/wi
• where wi is the weight of i-th flow

14
1. IP Traffic Management

• Example (LG Chapter 7 problem 46)
• Problem statement consider a packet-by-packet
  fair queuing system with three logical queues and
  with service rate of one unit per second. Show
  the sequence of transmission for this system for
  the following packet arrival pattern.
• Queue 1 arrival at time t 0, length 2
  arrival at t 4, length 1
• Queue 2 arrival at time t 1, length 3
  arrival at t 2, length 1.
• Queue 3 arrival at time t 3, length 5.

15
1. IP Traffic Management
16
1. IP Traffic Management

• Round (in terms of ideal fluid flow fair queuing
  system)
• A round consists of a cycle in which all n queues
  are offered service, one bit at a time
• The actual duration of a given round is the
  actual number of queues nactive (t) that have
  information to transmit.
• When the number of active queues is large, the
  duration of a round is large
• When the number of active queue is small, the
  duration of a round is small
• Round is in unit of bit

17
1. IP Traffic Management

• Meaning of the equation dR(t)/dt C/nactive(t)
• Given a ideal fluid flow fair queuing system, and
  given the fact that the system started at t 0
• Let R(t) be the number of the rounds at time t,
  that is, the number of cycles of services to all
  n queues. Assuming R(t) is a continuous
  function, then
• dR(t)/dt C/nactive(t)
• Interpretation of the equation above
• For a given duration and number of active queues,
  the higher the transmission capacity in
  bits/second, the more rounds can be completed.
• For a given duration and transmission capacity,
  more active queues means less round can be
  completed.

18
LG Figure 7.45 Ideal fluid flow system
Approximated bit-level round robin service
Packet flow 1
Packet flow 2
C bits/second
Transmission link
Packet flow n
19
LG Figure 7.46 Ideal fluid flow system and
packet-by-packet fair queuing system (two
packets of equal length)
Queue 1 _at_ t0
Ideal fluid flow system both packets served at
rate 1/2
1
Queue 2 _at_ t0
Both packets complete service at t2
t
0
2
1
Packet from queue 2 waiting
Packet-by-packet queueing system queue 1 served
first at rate 1 then queue 2 served at rate 1.
1
Packet from queue 2 being served
Packet from queue 1 being served
t
0
2
1
20
LG Figure 7.47 Computing the finishing time in
packet-by-packet fair queueing and weighted fair
queueing
Generalize so R(t) is continuous, not discrete
R(t) grows at rate inversely proportional to
nactive(t)
21
LG Figure 7.48 Ideal fluid flow system and
packet-by-packet fair queuing system (two
packets of different lengths)
Ideal fluid flow system both packets served at
rate 1/2
2
Queue 1 _at_ t0
1
Queue 2 _at_ t0
Packet from queue s served at rate 1
t
2
3
0
Packet-by-packet fair queueing queue 2 served at
rate 1
Packet from queue 2 waiting
1
Packet from queue 1 being served at rate 1
t
1
2
3
0
22
LG Figure 7.49 Ideal fluid flow system and
Packet-by-packet weighted fair queuing system
Queue 1 _at_ t0
Ideal fluid flow system packet from queue
1 served at rate 1/4 Packet from queue 1
served at rate 1
Queue 2 _at_ t0
1
Packet from queue 2 served at rate 3/4
t
0
2
1
Packet from queue 1 waiting
Packet-by-packet weighted fair queueing queue 2
served first at rate 1 then queue 1 served at
rate 1.
1
Packet from queue 1 being served
Packet from queue 2 being served
t
0
2
1
23
2. ARP RARP

• Address Resolution and Reverse Address Resolution
  
• Physical address (Hardware address)
• local address
• Example MAC address
• Logical address (Protocol address)
• IP address
• Delivery of a packet to a host requires both
  physical address and logical address. Hence,
  mapping between these two address is needed.
• Mapping methods
• Static mapping
• Dynamic mapping
• Address Resolution Protocol (ARP)
• Reverse Address Resolution Protocol (RARP)

24
2. ARP RARP
BF Figure 8-1 ARP and RARP
25
BF Figure 8-2 ARP operation
26
BF Figure 8-3 ARP packet

• Note
• Packet reception When an ARP is received, the
  receiving station will swap hardware and protocol
  addresses, putting the local hardware addresses
  in the sender fields.
• Fig. 8-3 is misleading in describing the length
  of the fields.
• Hardware Type Type of the network (16-bit
  field)
• Protocol Type 16-bit field. For IPv4, the
  value is 080016.
• Target hardware address is not filled in a
  request.

27
2. ARP RARP
BF Figure 8-4 Encapsulation of ARP packet
Note 0x0806 indicates that the data carried by
the fame is ARP
Note Use the physical broadcast address as the
destination address.
28
BF Figure 8-5 Four cases using ARP Part I
Note The selection of the target IP address for
the following four different combinations of
sender and receiver Host -gt Host Host -gt
Router Router -gt Router Router -gt Host
Case2. A host wants to send a packet to another
host on another network. It must first be
delivered to the default router.
29
BF Figure 8-5 Four cases using ARP Part II
30
2. ARP RARP
BF Figure 8-6 Proxy ARP
31
2. ARP RARP

• Reverse Address Resolution Protocol (RARP)
• Used for host to dynamically find their IP
  address, when they know only their physical
  address.
• ARP and RARP are different operations
• For ARP, all hosts are equal in status. There is
  no distinction between clients and servers
• RARP requires one or more server hosts to
  maintain a database of mapping from physical
  address to IP address and respond to requests
  from client hosts.

32
BF Figure 8-8 RARP operation
33
2. ARP RARP
BF Figure 8-9 RARP packet
34
2. ARP RARP
BF Figure 8-10 Encapsulation of RARP packet
35
3. Internet Control Message Protocol (ICMP)

• Purposes
• IP is a connectionless protocol (best-effort
  delivery service)
• ICMP is to provide feedback about problems in the
  communication environment. ICMP is not meant to
  make IP reliable.
• ICMP message
• ICMP is a network layer protocol.
• However, its message are not passed directly to
  the data link layer as would be expected.
  Instead, the messages are first encapsulated
  inside IP datagrams before going to the lower
  layer.
• Figure 9.2 ICMP encapsulation
• Message Format
• Figure 9.4 General format of ICMP messages
• Table 9.1 ICMP type definition

36
3. Internet Control Message Protocol (ICMP)
BF Figure 9-2 ICMP encapsulation
37
3. Internet Control Message Protocol (ICMP)
BF Figure 9-4 General format of ICMP messages
38
3. Internet Control Message Protocol (ICMP)
Table 9.1 ICMP type definition
(a) ICMP types related to error-reporting
(b) ICMP types related to query
39
3. Internet Control Message Protocol (ICMP)

• Type 3 Destination unreachable
• Code 0 network unreachable
• Code 1 host unreachable
• Code 2 protocol unreachable
• Code 3 port unreachable
• Code 4 fragmentation needed and DF (do not
  fragment) has been set
• Code 5 Source routing cannot be accomplished

40
3. Internet Control Message Protocol (ICMP)

• Type 8 or 0 Echo request or reply
• Can be used by network managers to check the
  operation of the IP protocols
• One of the most frequently used debugging tools
  invokes the ICMP echo request and echo reply
  message.
• A host or router sends an ICMP echo request
  message to a specified destination. Any machine
  that receives an echo request formulate an echo
  reply and returns it to the original sender.
• The echo request and associated reply can be used
  to test whether a destination is reachable and
  responding.
• On many systems, the command users invoke to send
  ICMP echo requests is named ping.

41
3. Internet Control Message Protocol (ICMP)

• Type 13 or 14 Timestamp request and reply
• Figure 9.15 Timestamp-request and timestamp-reply
  message format
• Round-trip time calculation
• Sending time value of receive timestamp
  value of original timestamp
• Receiving time time the packet returned
  value of transmit timestamp
• Round-trip time sending time receiving time

42
3. Internet Control Message Protocol (ICMP)
BF Figure 9-15 Timestamp-request and
timestamp-reply message format
43
3. Internet Control Message Protocol (ICMP)

• Type 10 or 9 Router solicitation and
  advertisement
• Router discovery
• After a host boots, it must learn the address of
  at least one router on the local network before
  it can send datagrams to destination on other
  networks. ICMP supports a dynamic router
  discovery scheme that allows a host to discover a
  router address.
• Router solicitation
• A host can broadcast a router solicitation
  message. The router or routers that receive the
  solicitation message broadcast their routing
  information using the router advertisement
  message.
• Router advertisement
• Lifetime field It specifies the time in seconds
  a host may use the advertised address. The
  default value is 30 minutes. The default value
  for periodic retransmission of router
  advertisement message is 10 minutes.
• Address preference level field Defines the
  ranking of the router. A host selects a router
  with the highest preference level as the default
  router.

44
BF Figure 9-17 Router solicitation message format
BF Figure 9-18 Router advertisement message
format
45
4. Internet Group Management Protocol (IGMP)

• Multicast
• Method of transmitting messages from a host using
  a single transmission to a selected subset of all
  the hosts that can receive the message. A
  message that is sent out to multiple receivers on
  the network by a host.
• Example
• Sending an e-mail message to a mailing list
• Teleconferencing and videoconferencing
• Multicast addresses
• Figure 10.1
• Class D
• Used as destination addresses
• Some addresses are permanently assigned

46
4. Internet Group Management Protocol (IGMP)
BF Figure 10-1 Class D address
47
4. Internet Group Management Protocol (IGMP)

• IGMP
• Help a multicast router identify the hosts in a
  LAN that are members of a multicast group
• IGMP messages
• Figure 10.3
• Operation of IGMP in a single network
• Operation of IGMP in an Internet

48
BF Figure 10-6 Four situations of IGMP operation