Self-organizing algorithms for cache cooperation in content distribution networks

Bell Labs Technical Journal

Volumn 14, Issue 3, 2009, Pages 113-125

  Borst, Sem ^a   Gupta, Varun ^b   Walid, Anwar ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH DEMAND; BANDWIDTH REQUIREMENT; CACHE MANAGEMENT; CACHING STRATEGY; CANONICAL SCENARIOS; CAPITAL EXPENSE; CONSTANT FACTORS; CONTENT DISTRIBUTION NETWORKS; COOPERATIVE CACHE; DISTRIBUTED CACHE; EFFECTIVE MECHANISMS; INTERNET PROTOCOL TELEVISION; LOW-COMPLEXITY; NETWORK EDGES; NUMERICAL EXPERIMENTS; OPTIMAL CONTENT; OPTIMAL PERFORMANCE; OPTIMAL STRUCTURES; ORDERS OF MAGNITUDE; PERFORMANCE BOTTLENECKS; PERSONAL VIDEO RECORDERS; REPLACEMENT ALGORITHM; SELF ORGANIZING ALGORITHM; SIMPLE STRUCTURES; TRAFFIC LOADS; TRAFFIC VOLUMES; TRANSPORT CAPACITY; VIDEO CONTENTS;

BANDWIDTH; DISTRIBUTED PARAMETER NETWORKS; INTERNET PROTOCOLS; OPTIMIZATION; TELEVISION NETWORKS; VISUAL COMMUNICATION;

ALGORITHMS;

EID: 73349122608     PISSN: 10897089     EISSN: 15387305     Source Type: Journal    
DOI: 10.1002/bltj.20391     Document Type: Article

References (18)

1. B. Awerbuch, Y. Bartal, and A. Fiat, "Distributed Paging for General Networks," J. Algorithms, 28:1 (1998), 67-104.
2. B. Awerbuch and D. Peleg, "Online Tracking of Mobile Users," J. ACM, 42:5 (1995), 1021-1058.
3. I. D. Baev and R. Rajaraman, "Approximation Algorithms for Data Placement in Arbitrary Networks," Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01) (Washington, DC, 2001), pp. 661-670.
4. I. Baev, R. Rajaraman, and C. Swamy, "Approximation Algorithms for Data Placement Problems," SIAM J. Comput., 38:4 (2008), 1411-1429.
5. M. D. Dahlin, R. Y. Wang, T. E. Anderson, and D. A. Patterson, "Cooperative Caching: Using Remote Client Memory to Improve File System Performance," Proc. 1st USENIX Conf. on Operating Syst. Design and Implementation (OSDI '94) (Monterey, CA, 1994), article 19.
6. L. W. Dowdy and D. V. Foster, "Comparative Models of the File Assignment Problem," ACM Comput. Surveys, 14:2 (1982), 287-313.
7. L. Fan, P. Cao, J. Almeida, and A. Z. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," ACM SIGCOMM Comput. Commun. Rev., 28:4 (1998), 254-265.
8. C. Huang, J. Li, and K. W. Ross, "Can Internet Video-on-Demand Be Profitable?," ACM SIGCOMM Comput. Commun. Rev., 37:4 (2007), 133-144.
9. J. Kangasharju, J. Roberts, and K. W. Ross, "Object Replication Strategies in Content Distribution Networks," Comput. Commun., 25:4 (2002), 376-383.
10. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, "Placement Algorithms for Hierarchical Cooperative Caching," J. Algorithms, 38:1 (2001), 260-302.
11. A. Leff, J. L. Wolf, and P. S. Yu, "Replication Algorithms in a Remote Caching Architecture," IEEE Trans. Parallel and Distrib. Syst., 4:11 (1993), 1185-1204.
12. J. Ni and D. H. K. Tsang, "Large-Scale Cooperative Caching and Application-Level Multicast in Multimedia Content Delivery Networks," IEEE Commun. Mag., 43:5 (2005), 98-105.
13. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing Nearby Copies of Replicated Objects in a Distributed Environment," Theory Comput. Syst., 32:3 (1999), 241-280.
14. P. Sarkar and J. H. Hartman, "Hint-Based Cooperative Caching," ACM Trans. Comput. Syst., 18:4 (2000), 387-419.
15. C. Swamy, "Algorithms for the Data Placement Problem," 2004.
16. M. van Steen, F. J. Hauck, and A. S. Tanenbaum, "A Model for Worldwide Tracking of Distributed Objects," Proc. Telecommun. Inform. Networking Architecture Conf. (TINA '96) (Heidelberg, Ger., 1996), pp. 203-212.
17. M. Verhoeyen, D. De Vleeschauwer, andD. Robinson, "Content Storage Architectures for Boosted IPTV Service," Bell Labs Tech. J., 13:3 (2008), 29-43.
18. G. M. Voelker, E. J. Anderson, T. Kimbrel, M. J. Feeley, J. S. Chase, A. R. Karlin, and H. M. Levy, "Implementing Cooperative Prefetching and Caching in a Globally-Managed Memory System," ACM SIGMETRICS Perform. Evaluation Rev., 26:1 (1998), 33-43.