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
10100101 00000000 00000000 00000000
through
11100000 00111111 11111111 11111111
0
10100101 01000000 00000000 00000000 1
through
10100101 01000000 11111111 11111111
10100101 01000001 00000000 00000000
through
10100101 01111111 11111111 11111111
2
10100101 01000001 00000000 00001000
through
10100101 01000001 00000000 00001111
1
10100101 01000001 00110000 00000000
through
10100101 01000001 00110001 11111111
0
Otherwise 3
a. Convert this table to a forwarding table with symbols “*” so that the longest prefix
matching can be applied to forward packets to the correct link interfaces. One
example can be found on P23 of 04-CSCI 525-Network Layer.pdf
b. Describe how your forwarding table determines the appropriate link interface
for datagrams with destination addresses:
I. 10100101 10010001 01010001 01010101
II. 10100101 01000001 00110001 11111011
III. 11100001 01000000 11000011 00111100
IV. 10100101 01000001 00110000 01110111
V. 10100101 11000001 00110001 11111111
VI. 10100101 01000001 00000000 00001010
VII. 11001000 00010111 00010110 10100001
VIII. 10100101 01000001 00110001 11001111
IX. 10100101 01000011 00110000 00011100