All Topics
All Topics
Technology
Technology
Design
Design
Programming
Programming
Science
Science
News
News
Gaming
Gaming
Entertainment
Entertainment
Business
Business
Finance
Finance
Sports
Sports
Health
Health
Food
Food
Travel
Travel
Art
Art
Music
Music
Books
Books
Education
Education
Politics
Politics
Personal
Personal
No algorithm. No AI slop. No ads. Just RSS. Pro-human. Indie writers. Real journalism. Open web. Chronological. Hand toasted.

PlanB-LPM: Portable C++ Implementation of IPv6 Longest-Prefix-Match Algorithm with AVX-512 SIMD

By

debugga

1mo ago· 13 min readenCode

Summary

This article describes an independent reimplementation of the PlanB algorithm for IPv6 longest-prefix-match (LPM) routing. The implementation uses a linearized B+-tree with AVX-512 SIMD optimizations and includes a scalar fallback. The repository provides a portable, MIT-licensed C++17 library that extends the original reference implementation with additional features not present in the original code. The work is based on research presented at NSDI '26 and aims to create a clean, production-ready version of the IPv6 lookup algorithm.

Key quotes

· 3 pulled
IPv6 longest-prefix-match (LPM) using a linearized B+-tree with AVX-512 SIMD and a scalar fallback.
PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree. NSDI '26. arXiv:2604.14650.
This repository is an independent, clean-room reimplementation of the algorithm as a portable, MIT-licensed C++17 library with extras that were not part of the reference.
Snippet from the RSS feed
Contribute to esutcu/planb-lpm development by creating an account on GitHub.

You might also wanna read