PlanB: Efficient Software IPv6 Lookup with Linearized $B^+$-Tree
Zhihao Zhang, Lanzheng Liu, Chen Chen, Huiba Li, Jiwu Shu, Windsor Hsu, Yiming Zhang

TL;DR
PlanB introduces a novel, efficient IPv6 lookup scheme that transforms the 2D LPM problem into a 1D search, achieving significantly higher throughput than existing methods.
Contribution
It proposes the linearized B+ tree and an optimized search algorithm for IPv6 LPM, unifying prefix value and length searches for improved performance.
Findings
Achieves 390 million lookups/sec on a single core
Scales to 3.4 billion lookups/sec on 12 cores
Outperforms state-of-the-art schemes by 1.6x to 14x
Abstract
IP lookup via Longest Prefix Match (LPM) is critical for packet forwarding. Unfortunately, conventional lookup algorithms are inefficient for IPv6 Forwarding Information Bases (FIBs), which are characterized by a set of long prefixes with diverse lengths. We observe that LPM inherently represents a two-dimensional (2D) search problem over both prefix values and prefix lengths, but existing algorithms mostly treat LPM as two separate levels of one-dimensional (1D) searches, causing poor lookup performance and high memory overhead. This paper presents PlanB, a novel scheme for high-speed IPv6 lookup. We transform the 2D LPM into an equivalent 1D search problem over elementary intervals, thereby unifying the search across prefix value and lengths. We then adapt a flat-array-based B-tree structure to the needs of LPM to propose the linearized -tree, based on which we introduce an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
