Question: 12) 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 00

12) 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 00 1 01 2 001 3 010 4 101 5 otherwise 6 a. For each of the following four datagrams, state over which interface the datagram will be forwarded using longest-prefix matching rule: 01111111, 11101010, 01011111, 00101000. (4 marks) b. Is it possible that the router receives a datagram and forwards it over interface 6? Justify your answer by giving a concrete example. (2 marks) c. In general, when considering two hosts located at a large geographic distance from each other in the Internet, is it always guaranteed that packets are being routed along a path with the smallest end-to-end delay between these hosts? Justify your answer. (2 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
