Redundancy elimination as a primitive

作者: Ashok Anand , Aditya Akella

DOI:

关键词: Redundancy (engineering)Computer networkAccess networkProtocol stackWAN optimizationTraffic engineeringCacheRouting protocolEngineeringTelecommunicationsInternet traffic

摘要: Internet traffic is increasing at a tremendous rate. Recent reports suggest that the total amount of might grow 4X by 2015. This expected to put strain on installed network capacity. If left unaddressed, this issue could severely impact user experience in accessing content. Unfortunately, obvious solution upgrading link speeds too expensive and cannot keep up with rapid growth. In thesis, we explore alternate ways improving efficiency. particular, investigate removing redundant content transfers from improve its In recent years, protocol-independent redundancy elimination (RE) has emerged as powerful technique remove transfers. These techniques are used many WAN optimization products effective bandwidth stub access links. We benefits these using several terabytes packet payload traces find mechanisms give 60% savings. Motivated study, propose extend RE beyond links support primitive stack. We deploying network-layer service all routers. Such would expand links, applications, flows users. develop SmartRE realize maximal such an architecture practice. also argue for end-hosts. An end-system eliminate before it gets encrypted. It benefit last hop provide additional energy savings mobile devices. EndRE efficient under various resource constraints design low BufferHash efficiently indexing large cache settings. believe (network-layer or EndRE) greater than just Existing protocols can be redesigned better mind. redesigning routing engineering.

参考文章(62)
Fred Douglis, Arun Iyengar, Application-specific Delta-encoding via Resemblance Detection. usenix annual technical conference. pp. 113- 126 ,(2003)
Christophe Diot, Derek R. McAuley, Ian A. Pratt, Andrew W. Moore, Luigi Rizzo, Gianluca Iannaccone, The CoMo white paper ,(2004)
Úlfar Erlingsson, Frank McSherry, Mark Manasse, A cool and practical alternative to traditional hash tables ,(2006)
Niraj Tolia, David G. Andersen, Swapnil Patil, Michael Kaminsky, An architecture for internet data transfer networked systems design and implementation. pp. 19- 19 ,(2006)
Peter J. Desnoyers, Prashant Shenoy, Hyperion: high volume stream archival for retrospective querying usenix annual technical conference. pp. 4- ,(2007)
Ramana Rao Kompella, Walter Willinger, David G. Andersen, Michael K. Reiter, Vyas Sekar, Hui Zhang, CSAMP: a system for network-wide flow monitoring networked systems design and implementation. pp. 233- 246 ,(2008)
Björn Thór Jónsson, Luc Bouganim, Philippe Bonnet, uFLIP: Understanding Flash IO Patterns conference on innovative data systems research. pp. 1- 12 ,(2009)
Lars Arge, The buffer tree: A new technique for optimal I/O-algorithms workshop on algorithms and data structures. pp. 334- 345 ,(1995) , 10.1007/3-540-60220-8_74
Bruce S. Davie, Yakov Rekhter, Mpls: Technology and Applications ,(2000)
Aman Shaikh, Albert Greenberg, OSPF monitoring: architecture, design and deployment experience networked systems design and implementation. pp. 5- 5 ,(2004)