Packet caches on routers: the implications of universal redundant traffic elimination

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.

[1]  Mikkel Thorup,et al.  Performance of estimated traffic matrices in traffic engineering , 2003, SIGMETRICS '03.

[2]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[3]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[5]  R. Morris,et al.  The click modular router , 2000, OPSR.

[6]  MaziéresDavid,et al.  A low-bandwidth network file system , 2001 .

[7]  David Wetherall,et al.  A protocol-independent technique for eliminating redundant network traffic , 2000, SIGCOMM.

[8]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.

[9]  James E. Cherry D & C , 2000 .

[10]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[11]  George Varghese,et al.  Automated Worm Fingerprinting , 2004, OSDI.

[12]  Alec Wolman,et al.  On the scale and performance of cooperative Web proxy caching , 1999, SOSP.

[13]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[14]  Kavé Salamatian,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.

[15]  S. Shenker,et al.  Understanding and Exploiting Network Traffic Redundancy , 2007 .

[16]  Nick Feamster,et al.  Design and implementation of a routing control platform , 2005, NSDI.

[17]  Úlfar Erlingsson,et al.  A cool and practical alternative to traditional hash tables , 2006 .

[18]  Udi Manber,et al.  Finding Similar Files in a Large File System , 1994, USENIX Winter.

[19]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[20]  Hong Yan,et al.  A clean slate 4D approach to network control and management , 2005, CCRV.

[21]  G. Voelker,et al.  On the scale and performance of cooperative Web proxy caching , 2000, OPSR.

[22]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[23]  David Mazières,et al.  A low-bandwidth network file system , 2001, SOSP.