EP2120 Internetworking

IK2218 Protocols and Principles of the Internet

Homework assignment 2
(Solutions due 17:00, Mon.,20 Sep 2021)
(Review due 17:00, Wed., 22 Sep 2021)

1. ARP (20/100)

The figure above illustrates six hosts H1, H2, H3, H4, H5 and H6 connected by an internetwork
running IPv4. The learning bridge B1 connects hosts H1, H2, and router R1, the learning bridge
B2 connects routers R1, R2, and H3 and the learning bridge B3 connects hosts H4, H5, H6 and
router R2. For the hosts and routers, the interfaces’ logical (IP) addresses are shown with
capital letters, and physical (MAC) addresses are shown with small letters. The North, East,
South, and West interfaces of the bridges are denoted by N, E, S and W.
Assume that the ARP caches of the routers and of the hosts, and the MAC address tables of
the bridges are initially empty and that no packets have been sent yet. The forwarding tables
of all hosts and routers are correctly configured. All hosts know the IP addresses of each
other. ARP snooping (also called passive ARP learning) is enabled.
Consider that host H6 sends an IPv4 unicast datagram to host H3.

a) Provide the state of the eight ARP caches of the hosts and routers as they will appear after
the IPv4 unicast datagram has been delivered to host H3, that is, after dynamic ARP
resolution has been made (12p).

b) Provide the state of the MAC table of bridge B 3 as it will appear after the IPv4 unicast
datagram has been delivered to host H3, that is, after dynamic ARP resolution has been
made. (4p)
 c) Assuming that at the beginning of the transmission ARP snooping is disabled on all the
hosts and routers, provide the state of the eight ARP caches of the hosts and routers as
they will appear after the IPv4 unicast datagram has been delivered to host H 3, that is,
after dynamic ARP resolution has been made (4p).

2. UDP and fragmentation (15/100)

Assume that an Ethernet network with an MTU of 576 bytes (i.e., minimum MTU in IPv4)
connects hosts A and B. An application process on Host A sends 3540 bytes of application
data via UDP to a process on Host B. IPv4 is used at the network layer.

a) How many fragments are transmitted? (5p)

b) Give the values of the MF bit, the offset and the total length field of the IP header of
each fragment! (10p)

3. Routing (25/100)

In the IPv4 network shown in the figure, all routers (A-F) run RIPv2 and all link metrics are 1.
The addresses of the IPv4 networks and the associated interface addresses are given in the
figure. Note that the letters A-F denote routers. Assume that initially only the addresses of the
directly connected networks are known to the routers. The destinations in the network are the
/24 prefixes. Assume also that all RIP implementations support Equal-cost-multi-path
(ECMP). All routers implement split horizon with poison reverse.

Express routes as 'destination, metric, next-hop'. If the destination is a directly connected

network, the route is given as 'destination, metric, -'.

a) What is the initial routing state of E? (3p)

b) Assume that the first event that happens in the network is that C starts by sending RIP
responses to its neighbors. What is the routing state of E after it has received the distance-
vector from C? (5p)

c) Assume that the second event that happens in the network is that router D sends RIP
responses to its neighbors. Please list the RIP responses that D sends. You should indicate
 the source and destination address of each RIP response, on which interface they are sent
out (and to which IP address(es)) and which distance-vectors (destination, metric tuples)
are contained in each message. (9)

d) After step (c) the routers send out RIP responses to their neighbors simultaneously
every 30 seconds, and the first RIP updates after c) are sent out at t=0. How long does it
take for F to learn all the networks? Motivate your answer. (4p)

e) Assume now that the routers in the above network run OSPF instead of RIPv2. Propose
a set of designated routers (DRs) for the network. Given the DRs you identified, how
many network link state advertisements (LSAs) and router LSAs does the link state
database consist of? (4p)

4. ICMP (15/100)

The hosts H1 and H2 are connected by networks running IPv4. The forwarding tables of all
hosts and routers are correctly configured.

a) H2 performs a traceroute to host H1 relying on ICMP. Traceroute is configured to

send one message for each hop. Please list the first and the last ICMP messages that
H2 sends, and the corresponding replies that H2 receives (10p).

b) Assume that a program on H1 sends a UDP unicast datagram to 192.168.2.2 with the
DF flag set to 1. The datagram size is below the MTU for the networks 192.168.1.0/24
and 192.168.0.0/24 but exceeds the MTU of the network 192.168.2.0/24. Router B can
thus not forward the datagram to H2. Will H1 receive any ICMP error message? If yes,
then what is the type of the message? (3p)

c) Routers A and B are configured to forward datagrams with a directed broadcast

address. Consider that H1 sends a UDP message to 192.168.0.255 with TTL=2.
However, none of the routers on the target network has a process listening at the
specified destination UDP port. Will H1 receive any ICMP message? If the answer is
yes, please specify the sender and the type of the ICMP message, otherwise, please
motivate your answer. (2p)
5. TCP (25/100)
Consider a recently established TCP connection between processes PA and PB on hosts A and
B, respectively. The three-way handshake has been completed, but no data has been sent yet.
TCP on Host B announced a receiver window size of 4200 bytes to TCP on Host A, and
Process PB can read the received data from TCP as soon as they arrive. Process PA has 11550
bytes to send via TCP. The path MTU between the two hosts is known to be 1090 bytes. The
one-way propagation time is 110ms, and the link speed is 1.2 Mbps. It takes 1ms for TCP to
generate a segment (with or without data) and this can be done in parallel with sending a
previously generated segment.
The receiver uses delayed acknowledgments with a delay of 250ms (or at most two full
segments). The size of a segment having a TCP header only is negligible in terms of
transmission time. Moreover, for segments containing TCP payload, the size of the headers
can be neglected when computing the transmission time of the segment. IPv4 is used as the
network layer protocol and IP options are not used. Process PA sends the first segment at time
t0 with sequence number 0. CWND is originally set to 1 MSS (packet loss was experienced
during connection establishment, as per RFC5681) and the slow start threshold is 65535 bytes.
Assume that the granularity G of the heartbeat timer is 0.5 seconds.

a) What is the MSS used by TCP? (2p)

b) What is the bandwidth-delay product of the communication channel? Is the advertised

receiver window of B big enough to fully utilize the channel? If not, how big should it be
for A to be able to fully utilize the channel? (5p)

c) Provide the sequence of segments sent by TCP from host A. For each segment sent
from host A provide the time it is sent, and the sequence number of the first byte it
contains. For the first five segments sent from host A, also provide the SRTT, RTTVAR
and the RTO values of the sender TCP at the time the segment is sent. Assume that
outgoing segments are handled before incoming segments in case more than one event
happens at the same time! (15p)

d) At what time does A receive the acknowledgement for the last segment? (3p)

Hint 1: Try to first draw the sequence of segment exchanges to get the order of the segments
right.
Hint 2: Consult RFC 6298 for details on how to calculate the SRTT, RTTVAR and the RTO.
The description provided in the course book (3ed and 4ed) is not correct. Consult
RFC5681 for congestion control.