Question
Propose a lookup algorithm for a CIDR fowarding table that does not require a linear search of the entire table to find the longest match.
Step 1
Convert the CIDR forwarding table into a binary trie (also known as a prefix tree). Each node in the trie represents a bit in the IP address, with the left child representing a 0 bit and the right child representing a 1 bit. Each node also stores the associated Show more…
Show all steps
Your feedback will help us improve your experience
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Apply algorithms 1 and 2 to find a shortest spanning tree for the network of Problem $2 .$
Linear Programming And Game Theory
Network Models
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD