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 …

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 …