bart
A high-performance, memory-efficient IP routing table library for Go, optimized for ACL, RIB, and FIB use cases.
What is bart?
BART (Balanced Routing Table) is a Go library implementing an adaptation of Donald Knuth's ART algorithm for IP prefix matching. It provides three specialized routing table types optimized for different performance and memory trade-offs, making it ideal for firewalls, routers, and systems requiring large-scale IP lookups.
Network engineers and developers building firewalls, routers, routing daemons, or any system that needs high-performance, memory-efficient IP prefix matching (e.g., for ACLs, RIB, or FIB).
Developers choose BART for its unique combination of constant-time per-level lookups, novel path and fringe compression for memory efficiency, and three optimized table types (Table, Lite, Fast) to precisely match their speed vs. memory requirements.
Overview
The Balanced Routing Table is an adaptation of D. Knuth's ART algorithm and requires significantly less memory and has an even better lookup speed.
Use Cases
Best For
- Implementing Access Control Lists (ACLs) that need to determine if an IP matches millions of CIDR rules extremely fast.
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
