Question: Q1. Given that the network addresses are 8 bits long. Suppose that a router has the following prefixes in the forwarding table: *,1*, 10*, 010*

Q1. Given that the network addresses are 8 bits long. Suppose that a router has the following prefixes in the forwarding table: *,1*, 10*, 010* 0110*, 1111*, 10001*, 110011*, 100100*, 0111001* (a) Assume that the binary search method based on prefix length is now used for LPM (longest prefix match) in the router. (i) Show the binary searching tree for all hash tables. (4 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
