Answered step by step
Verified Expert Solution
Question
1 Approved Answer
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) (ii) Write down the contents of the tables with size 4. Given that the table contains the following fields: Prefix Flag LSF where the Flag (On or Off) is used to indicate whether there is a longer prefix and LSF is used to indicate the longest prefix found so far (measured in number of bits). (4 marks) 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) (ii) Write down the contents of the tables with size 4. Given that the table contains the following fields: Prefix Flag LSF where the Flag (On or Off) is used to indicate whether there is a longer prefix and LSF is used to indicate the longest prefix found so far (measured in number of bits). (4 marks)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started