Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

1. Consider a datagram network using 32-bit host addresses. Suppose a router has

ID: 3699183 • Letter: 1

Question

1.     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:

Prefix Match

Link Interface

11100000 000

0

11100000 00100000

1

11100000 0011

2

11100000 00110001 10

2

Otherwise

3

Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses:

a)    11000000 00110001 01010001 01010101

b)    11100001 00100000 00010001 01110111

Prefix Match

Link Interface

11100000 000

0

11100000 00100000

1

11100000 0011

2

11100000 00110001 10

2

Otherwise

3

Explanation / Answer

Explanation: The router will route the packet that has the Longest Prefix Match

ith destination addresses:

a)    11000000 00110001 01010001 01010101
<It will go to Interface 2 as it has longest Prefix matching>

b)    11100001 00100000 00010001 01110111
<It will go to Interface 1 as it has longest Prefix matching>