Algorithms for optimizing the bandwidth cost of content delivery
暂无分享,去创建一个
Micah Adler | Ramesh K. Sitaraman | Harish Venkataramani | M. Adler | R. Sitaraman | Harish Venkataramani
[1] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[2] Sally A. Goldman,et al. TCP dynamic acknowledgment delay (extended abstract): theory and practice , 1998, STOC '98.
[3] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.
[4] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[5] W. Marsden. I and J , 2012 .
[6] Rajkumar Buyya,et al. Content Delivery Networks , 2008 .
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Yin Zhang,et al. Optimizing cost and performance for multihoming , 2004, SIGCOMM '04.
[9] Claire Mathieu,et al. Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.
[10] Bruce M. Maggs,et al. Globally Distributed Content Delivery , 2002, IEEE Internet Comput..
[11] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[12] Anees Shaikh,et al. A measurement-based analysis of multihoming , 2003, SIGCOMM '03.
[13] Claire Mathieu,et al. Dynamic TCP Acknowledgment and Other Stories about e/(e - 1) , 2003, Algorithmica.
[14] Joseph Y.-T. Leung,et al. On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.
[15] Sally A. Goldman,et al. TCP Dynamic Acknowledgment Delay: Theory and Practice , 1998, STOC 1998.
[16] George Pallis,et al. Insight and perspectives for content delivery networks , 2006, CACM.
[17] Micah Adler,et al. Algorithms for Optimizing Bandwidth Costs on the Internet , 2006, 2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies.
[18] Ramesh K. Sitaraman,et al. The Akamai network: a platform for high-performance internet applications , 2010, OPSR.
[19] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[20] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[21] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[22] Rudolf Fleischer. On The Bahncard Problem , 1998, COCOON.