Compressing IP forwarding tables: Towards entropy bounds and beyond

Gábor Rétvári, János Tapolcai, Attila Korösi, András Majdán, Zalán Heszberger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Citations (Scopus)

Abstract

Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the efficiency of standard operations, like random access, search, or update. The main goal of this paper is to demonstrate how data compression can benefit the networking community, by showing how to squeeze the IP Forwarding Information Base (FIB), the giant table consulted by IP routers to make forwarding decisions, into information- theoretical entropy bounds, with essentially zero cost on longest prefix match and FIB update. First, we adopt the state-of-the-art in compressed data structures, yielding a static entropy-compressed FIB representation with asymptotically optimal lookup. Then, we re-design the venerable prefix tree, used commonly for IP lookup for at least 20 years in IP routers, to also admit entropy bounds and support lookup in optimal time and update in nearly optimal time. Evaluations on a Linux kernel prototype indicate that our compressors encode a FIB comprising more than 440K prefixes to just about 100 - 400 KBytes of memory, with a threefold increase in lookup throughput and no penalty on FIB updates.

Original languageEnglish
Title of host publicationSIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Pages111-122
Number of pages12
DOIs
Publication statusPublished - Sep 5 2013
EventACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 2013 - Hong Kong, China
Duration: Aug 12 2013Aug 16 2013

Publication series

NameSIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

Other

OtherACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 2013
CountryChina
CityHong Kong
Period8/12/138/16/13

Keywords

  • data compression
  • ip forwarding table lookup
  • prefix tree

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Compressing IP forwarding tables: Towards entropy bounds and beyond'. Together they form a unique fingerprint.

  • Cite this

    Rétvári, G., Tapolcai, J., Korösi, A., Majdán, A., & Heszberger, Z. (2013). Compressing IP forwarding tables: Towards entropy bounds and beyond. In SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (pp. 111-122). (SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication). https://doi.org/10.1145/2486001.2486009