PAPER DIGEST
Most Influential SIGCOMM 2008 Paper · 2026-03 edition

Packet Caches On Routers: The Implications Of Universal Redundant Traffic Elimination

Ashok Anand; Archit Gupta; Aditya Akella; Srinivasan Seshan; Scott Shenker

Venue
ACM SIGCOMM Conference (SIGCOMM) 2008
Recognition
Most Influential SIGCOMM 2008 Paper (Rank No. 15)
Edition
2026-03
Impact factor
6
Certificate ID
449372a3c252c194

Abstract

Many past systems have explored how to eliminate redundant transfers from network links and improve network efficiency. Several of these systems operate at the application layer, while the more recent systems operate on individual packets. A common aspect of these systems is that they apply to localized settings, e.g. at stub network access links. In this paper, we explore the benefits of deploying packet-level redundant content elimination as a universal primitive on all Internet routers. Such a universal deployment would immediately reduce link loads everywhere. However, we argue that far more significant network-wide benefits can be derived by redesigning network routing protocols to leverage the universal deployment. We develop "redundancy-aware" intra- and inter-domain routing algorithms and show that they enable better traffic engineering, reduce link usage costs, and enhance ISPs' responsiveness to traffic variations. In particular, employing redundancy elimination approaches across redundancy-aware routes can lower intra and inter-domain link loads by 10-50%. We also address key challenges that may hinder implementation of redundancy elimination on fast routers. Our current software router implementation can run at OC48 speeds.

Download PDF certificate