Practical Network-Wide Compression of IP Routing Tables
Author(s): Karpilovsky, Elliott; Caesar, Matthew; Rexford, Jennifer; Shaikh, Aman; van der Merwe, Jacobus
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr11r8q
Abstract: | The memory Internet routers use to store paths to destinations is expensive, and must be continually upgraded in the face of steadily increasing routing table size. Unfortunately, routing protocols are not designed to gracefully handle cases where memory becomes full, which arises increasingly often due to misconfigurations and routing table growth. Hence router memory must typically be heavily overprovisioned by network operators, inflating operating costs and administrative effort. The research community has primarily focused on clean-slate solutions that cannot interoperate with the deployed base of protocols. This paper presents an incrementally-deployable Memory Management System (MMS) that reduces associated router state by up to 70%. The MMS coalesces prefixes to reduce memory consumption and can be deployed locally on each router or centrally on a route server. The system can operate transparently, without requiring changes in other ASes. Our memory manager can extend router lifetimes up to seven years, given current prefix growth trends. |
Publication Date: | 2012 |
Citation: | Karpilovsky, Elliott, Matthew Caesar, Jennifer Rexford, Aman Shaikh, and Jacobus Van Der Merwe. "Practical network-wide compression of IP routing tables." IEEE Transactions on Network and Service Management 9, no. 4 (2012): pp. 446-458. doi:10.1109/TNSM.2012.081012.120246 |
DOI: | 10.1109/TNSM.2012.081012.120246 |
EISSN: | 1932-4537 |
Pages: | 446 - 458 |
Type of Material: | Journal Article |
Journal/Proceeding Title: | IEEE Transactions on Network and Service Management |
Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.