Sem Borst
Varun Gupta
Anwar Walid
- I.D. Baev, R. Rajaraman (2001). Approximation algorithms for data placement in arbitrary networks. Proc. SODA 2001 661--670. Google Scholar
Digital Library
- I.D. Baev, R. Rajaraman, C. Swamy (2008). Approximation algorithms for data placement problems. SIAM J. Comput 38 1411--1429. Google ScholarDigital Library
- S.C. Borst, V. Gupta, A. Walid (2008). Self-organizing algorithms for cache cooperation in content distribution networks. Technical Memorandum, Alcatel-Lucent, Bell Labs.Google Scholar
- A. Leff, J.L. Wolf, P.S. Yu (1993). Replication algorithms in a remote caching architecture. IEEE Trans. Parallel Distr. Syst. 4 (11), 1185--1204. Google ScholarDigital Library
Index Terms
- Self-organizing algorithms for cache cooperation in content distribution networks
Recommendations
Self-organizing algorithms for cache cooperation in content distribution networks
Enabling Science and TechnologyThe delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of video-on-demand (VoD) libraries, and widespread deployment of Internet Protocol television (IPTV) services with features such as ...
Counter-Based Cache Replacement and Bypassing Algorithms
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large, motivating the design of alternative replacement algorithms to improve ...
Multicast cloud with integrated multicast and unicast content distribution routing
Web content caching and distributionIn this paper, we describe the concept and design of "application-layer multicast cloud," the first overlay network design that provides integrated content distribution routing between IP multicast and unicast via a user-configured group of multicast ...
Comments