Abstract
Fast routing lookups are crucial for the forwarding performance of IP routers. Longest prefix match makes routing lookups difficult. This paper proposes a method to partition a routing table. The method can divide all prefixes in a routing table into several prefix sets where prefixes don’t overlap. Based on the method, this paper also presents a common parallel lookup framework(PRLF) that reduces ”longest prefix matching” in all the prefixes to ”only prefix matching” in several prefix sets. The framework can effectively simplify the design of lookup algorithms and improve lookup performance. The framework is suitable for most lookup algorithms. For simple binary search algorithm, the framework can reach log 22N/B lookup complexity (where N is prefix number in a routing table and B is an integer bigger than 4). Also, the framework can scale to IPv6 easily.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
