Compressing IP forwarding tables for fun and profit

Authors:
Gábor Rétvári;Zoltán Csernátony;Attila Körösi;János Tapolcai;András Császár;Gábor Enyedi;Gergely Pongrácz
Affiliations:
Budapest Univ. of Technology and Economics;Budapest Univ. of Technology and Economics;Budapest Univ. of Technology and Economics;Budapest Univ. of Technology and Economics;Ericsson Research, Hungary;Ericsson Research, Hungary;Ericsson Research, Hungary
Venue:
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Year:
2012

Citing 10
Cited 1

Small forwarding tables for fast routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Faster IP lookups using controlled prefix expansion

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Achieving sub-second IGP convergence in large IP networks

ACM SIGCOMM Computer Communication Review
Succinct Representation of Static Packet Forwarding Tables

ICN '07 Proceedings of the Sixth International Conference on Networking
Dynamic entropy-compressed sequences and full-text indexes

ACM Transactions on Algorithms (TALG)
Space-efficient static trees and graphs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Compressing and indexing labeled trees, with applications

Journal of the ACM (JACM)
Routing scalability: an operator's view

IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
Evolution towards global routing scalability

IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
IP-address lookup using LC-tries

IEEE Journal on Selected Areas in Communications

Compressing IP forwarding tables: towards entropy bounds and beyond

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM

Quantified Score

Hi-index	0.00

Visualization

Abstract

About what is the smallest size we can compress an IP Forwarding Information Base (FIB) down to, while still guaranteeing fast lookup? Is there some notion of FIB entropy that could serve as a compressibility metric? As an initial step in answering these questions, we present a FIB data structure, called Multibit Burrows-Wheeler transform (MBW), that is fundamentally pointerless, can be built in linear time, guarantees theoretically optimal longest prefix match, and compresses to higher-order entropy. Measurements on a Linux prototype provide a first glimpse of the applicability of MBW.