Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond

Gabor Retvari, J. Tapolcai, Attila Korosi, Andras Majdan, Zalan Heszberger

Research output: Contribution to journalArticle

4 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 redesign 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 an FIB comprising more than 440 K prefixes to just about 100–400 kB of memory, with a threefold increase in lookup throughput and no penalty on FIB updates.

Original languageEnglish
JournalIEEE/ACM Transactions on Networking
DOIs
Publication statusAccepted/In press - Sep 25 2014

Fingerprint

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Compressing IP Forwarding Tables : Towards Entropy Bounds and Beyond. / Retvari, Gabor; Tapolcai, J.; Korosi, Attila; Majdan, Andras; Heszberger, Zalan.

In: IEEE/ACM Transactions on Networking, 25.09.2014.

Research output: Contribution to journalArticle

Retvari, Gabor ; Tapolcai, J. ; Korosi, Attila ; Majdan, Andras ; Heszberger, Zalan. / Compressing IP Forwarding Tables : Towards Entropy Bounds and Beyond. In: IEEE/ACM Transactions on Networking. 2014.
@article{7c8bb951620941dbb99648f2568a01fe,
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 redesign 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 an FIB comprising more than 440 K prefixes to just about 100–400 kB of memory, with a threefold increase in lookup throughput and no penalty on FIB updates.",
author = "Gabor Retvari and J. Tapolcai and Attila Korosi and Andras Majdan and Zalan Heszberger",
year = "2014",
month = "9",
day = "25",
doi = "10.1109/TNET.2014.2357051",
language = "English",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Compressing IP Forwarding Tables

T2 - Towards Entropy Bounds and Beyond

AU - Retvari, Gabor

AU - Tapolcai, J.

AU - Korosi, Attila

AU - Majdan, Andras

AU - Heszberger, Zalan

PY - 2014/9/25

Y1 - 2014/9/25

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 redesign 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 an FIB comprising more than 440 K prefixes to just about 100–400 kB 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 redesign 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 an FIB comprising more than 440 K prefixes to just about 100–400 kB of memory, with a threefold increase in lookup throughput and no penalty on FIB updates.

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

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

U2 - 10.1109/TNET.2014.2357051

DO - 10.1109/TNET.2014.2357051

M3 - Article

AN - SCOPUS:84908044897

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

ER -