Consider three different datagrams that have the follwing destination IP address
ID: 3813706 • Letter: C
Question
Consider three different datagrams that have the follwing destination IP addresses:
11001000 10010001 01010001 01010101
11100001 00000000 11000011 00111100
11100001 10000000 00010001 01110111
Given a router's forwarding table below, list the link interfaces to which the router forwards the datagrams from above.
Enter the interface by selecting the interface number from the table. For example, enter 6 if the interface is 6 for the datagram and the corresponding destination IP address.
Destination address:
11001000 10010001 01010001 01010101
Link interface:
Destination address:
11100001 00000000 11000011 00111100
Link interface:
Destination address:
11100001 10000000 00010001 01110111
Link interface:
11001000 10010001 01010001 01010101
11100001 00000000 11000011 00111100
11100001 10000000 00010001 01110111
Explanation / Answer
Destination address:
11001000 10010001 01010001 01010101
Link interface: 3 (Since there is no matching prefix)
Destination address:
11100001 00000000 11000011 00111100
Link interface: 2 (Because this matches perfectly)
Destination address:
11100001 10000000 00010001 01110111
Link interface: 1 (Because longest prefix matching rule)