Description
Problem A. Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be
forwarded to the link interfaces as follows:
Destination Address Range Link Interface
11100000 00000000 00000000 00000000 through 11100000 00111111 11111111 11111111 0
11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 1
11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 2
Otherwise 3
a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces.
b. Describe how your forwarding table determines the appropriate link inter-face for datagrams with destination addresses:
11001000 10010001 01010001 01010101
11100001 01000000 11000011 00111100
11100001 10000000 00010001 01110111
(Hint: There is an example discussed in class and included in the in-class notes & PPT slides for Chapter 4)
Problem B. Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding
table:
Prefix Match Interface
1 0
10 1
111 2
otherwise 3
For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range.
Problem C. Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes. Suppose the original datagram is stamped with the
identification number 422. How many fragments are generated? What are the values in the various fields in the IP datagram(s) generated related to
fragmentation? (Hint: You may assume that the length of the IP header is 20 bytes.)
Problem D. Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in these subnets are
required to have the prefix 134.39.176.0/22. Also suppose that Subnet 1 needs to support at least 450 interfaces, Subnet 2 needs to support at least 200
interfaces, and Subnet 3 needs to support at least 160 interfaces. Provide three network addresses (a.b.c.d/x) that satisfy these constraints.
Problem E. Rewrite the following forwarding table using the a.b.c.d/x notation:
Prefix Match Link Interface
11100000 00****** ******** ******** 0
11100000 01000000 ******** ******** 1
1110000* ******** ******** ******** 2
11100001 1******* ******** ******** 3
