Compressing IP forwarding tables: Towards entropy bounds and beyond

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

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

21 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 publicationComputer Communication Review
Pages111-122
Number of pages12
Volume43
Edition4
DOIs
Publication statusPublished - 2013
EventAnnual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM SIGCOMM 2013 - Hong Kong, China
Duration: Aug 12 2013Aug 16 2013

Other

OtherAnnual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM SIGCOMM 2013
CountryChina
CityHong Kong
Period8/12/138/16/13

Fingerprint

Entropy
Routers
Data structures
Data storage equipment
Data compression
Compressors
Throughput
Costs
Linux

Keywords

  • data compression
  • ip forwarding table lookup
  • prefix tree

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

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 Computer Communication Review (4 ed., Vol. 43, pp. 111-122) https://doi.org/10.1145/2534169.2486009

Compressing IP forwarding tables : Towards entropy bounds and beyond. / Rétvári, Gábor; Tapolcai, J.; Korösi, Attila; Majdán, András; Heszberger, Zalán.

Computer Communication Review. Vol. 43 4. ed. 2013. p. 111-122.

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

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 Computer Communication Review. 4 edn, vol. 43, pp. 111-122, Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM SIGCOMM 2013, Hong Kong, China, 8/12/13. https://doi.org/10.1145/2534169.2486009
Rétvári G, Tapolcai J, Korösi A, Majdán A, Heszberger Z. Compressing IP forwarding tables: Towards entropy bounds and beyond. In Computer Communication Review. 4 ed. Vol. 43. 2013. p. 111-122 https://doi.org/10.1145/2534169.2486009
Rétvári, Gábor ; Tapolcai, J. ; Korösi, Attila ; Majdán, András ; Heszberger, Zalán. / Compressing IP forwarding tables : Towards entropy bounds and beyond. Computer Communication Review. Vol. 43 4. ed. 2013. pp. 111-122
@inproceedings{f94b083c84484e448455f83b7e460db9,
title = "Compressing IP forwarding tables: Towards entropy bounds and beyond",
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.",
keywords = "data compression, ip forwarding table lookup, prefix tree",
author = "G{\'a}bor R{\'e}tv{\'a}ri and J. Tapolcai and Attila Kor{\"o}si and Andr{\'a}s Majd{\'a}n and Zal{\'a}n Heszberger",
year = "2013",
doi = "10.1145/2534169.2486009",
language = "English",
isbn = "9781450320566",
volume = "43",
pages = "111--122",
booktitle = "Computer Communication Review",
edition = "4",

}

TY - GEN

T1 - Compressing IP forwarding tables

T2 - Towards entropy bounds and beyond

AU - Rétvári, Gábor

AU - Tapolcai, J.

AU - Korösi, Attila

AU - Majdán, András

AU - Heszberger, Zalán

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - data compression

KW - ip forwarding table lookup

KW - prefix tree

UR - http://www.scopus.com/inward/record.url?scp=84891606825&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891606825&partnerID=8YFLogxK

U2 - 10.1145/2534169.2486009

DO - 10.1145/2534169.2486009

M3 - Conference contribution

AN - SCOPUS:84891606825

SN - 9781450320566

VL - 43

SP - 111

EP - 122

BT - Computer Communication Review

ER -