An open content delivery infrastructure using data lockers

Content distribution has become a major function of the Internet. However, the current Internet content distribution infrastructure is largely closed to end-to-end applications, making it challenging for the application community to utilize in-network storage resources. In this paper, we investigate a simple paradigm named SAILOR that introduces application-definable, shared in-network data lockers to effectively facilitate the construction of highly efficient, cooperative content distribution applications. We design and implement a prototype of SAILOR and integrate it with two popular content distribution applications for file and live streaming respectively. Our experimental results clearly demonstrate that SAILOR can significantly improve both network efficiency and application performance, thereby benefiting both network providers and application providers.

[1]  Fabián E. Bustamante,et al.  Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems , 2008, SIGCOMM '08.

[2]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[3]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[4]  Nathaniel Leibowitz,et al.  ARE FILE SWAPPING NETWORKS CACHEABLE? CHARACTERIZING P2P TRAFFIC , 2002 .

[5]  Micah Beck,et al.  Pipelining and Caching the Internet Backplane Protocol , 2004 .

[6]  BhattacharjeeBobby,et al.  Bittorrent is an auction , 2008 .

[7]  Alessandro Bassi,et al.  The Internet Backplane Protocol: A Study in Resource Sharing , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[8]  Mohamed Hefeeda,et al.  Modeling and Caching of Peer-to-Peer Traffic , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[9]  Patrick Crowley,et al.  Named data networking , 2014, CCRV.

[10]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM '07.

[11]  Adam Wierzbicki,et al.  Cache replacement policies revisited: the case of P2P traffic , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[12]  Fang Wu,et al.  Proportional response dynamics leads to market equilibrium , 2007, STOC '07.

[13]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[14]  Abraham Silberschatz,et al.  P4p: provider portal for applications , 2008, SIGCOMM '08.

[15]  Jerome H. Saltzer,et al.  End-to-end arguments in system design , 1984, TOCS.

[16]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[17]  M. Hefeeda,et al.  pCache : A Proxy Cache for Peer-to-Peer Traffic , 2008 .

[18]  Akihiro Nakao,et al.  A Remedy for Network Operators against Increasing P2P Traffic: Enabling Packet Cache for P2P Applications , 2008, IEICE Trans. Commun..

[19]  Christian Dannewitz,et al.  NetInf: An Information-Centric Design for the Future Internet , 2013 .

[20]  Mohamed Hefeeda,et al.  Cooperative caching: The case for P2P traffic , 2008, LCN.

[21]  Ben Y. Zhao,et al.  HPTP: Relieving the Tension between ISPs and P2P , 2007, IPTPS.

[22]  Pablo Rodriguez,et al.  Should internet service providers fear peer-assisted content distribution? , 2005, IMC '05.