Abstract
The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced end-user delay, reduced network traffic, and improved scalability. The problem of allocating an available storage budget to the nodes of a hierarchical content distribution system is formulated; optimal algorithms, as well as fast/efficient heuristics, are developed for its solution. An innovative aspect of the presented approach is that it combines all relevant subproblems, concerning node locations, node sizes, and object placement, and solves them jointly in a single optimization step. The developed algorithms may be utilized in content distribution networks that employ either replication or caching/replacement.
Keywords
This work and its dissemination efforts have been supported in part by the IST Program of the European Union under contract IST-2001-32686 (Broadway).
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bartal, Y. (1996). On approximating arbitrary metrics by tree metrics. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (IEEE FOCS).
Breslau, Lee, Cao, Pei, Fan, Li, Philips, Graham, and Shenker, Scott (1999). Web caching and Zipf-like distributions: Evidence and implications. In Proceedings of the Conference on Computer Communications (IEEE Infocom), New York.
Cao, Pei and Irani, Sandy (1997). Cost-aware WWW proxy caching algorithms. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, pages 193–206.
Chesire, Maureen, Wolman, Alec, Voelker, Geoffrey M., and Levy, Henry M. (2001). Measurement and analysis of a streaming-media workload. In Proceedings of USITS.
Cormen, Thomas II., Leiserson, Charles E., Rivest, Ronald L., and Stein, Clifford (2001). Introduction to Algorithms, 2nd Edition. MIT Press, Cambridge, Massachusetts.
Cronin, Eric, Jamin, Sugih, Jin, Cheng, Kurc, Anthony R., Raz, Danny, and Shavitt, Yuval (2002). Constraint mirror placement on the internet. IEEE Journal on Selected Areas in Communications, 20(7).
Fan, Li, Cao, Pei, Almeida, Jussara, and Broder, Andrei Z. (2000). Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281–293.
Gadde, Syam, Chase, Jeff, and Rabinovich, Michael (2002). Web caching and content distribution: A view from the interior. Computer Communications, 24(2).
Garces-Erice, Luis, Biersack, Ernst W., Ross, Keith W., Felber, Pascal A., and Urvoy-Keller, Guillaume (2003). Hierarchical P2P systems. In Proceedings of ACM/IFIP International Conference on Parallel and Distributed Computing (Euro-Par), Klagenfurt, Austria.
Kangasharju, Jussi, Roberts, James: and Ross, Keith W. (2002). Object replication strategies in content distribution networks. Computer Communications, (4):376–383.
Kelly, T. and Reeves, D. (2001). Optimal web cache sizing: scalable methods for exact solutions. Computer Communications, 24(2):163–173.
Korupolu, Madhukar R., Plaxton, C. Greg, and Rajaraman, Rajmohan (1999). Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), pages 586–595.
Krishnan, P., Raz, Danny, and Shavit, Yuval (2000). The cache location problem. IEEE/ACM Transactions on Networking, 8(5):568–581.
Laoutaris, Nikolaos, Zissimopoulos, Vassilios, and Stavrakakis, Ioannis (2004a). Joint object placement and node dimensioning for internet content distribution. Information Processing Letters, 89(6):273–279.
Laoutaris, Nikolaos, Zissimopoulos, Vassilios, and Stavrakakis, Ioannis (2004b). On the optimization of storage capacity allocation for content distribution. Computer Networks [submitted].
Li, Bo, Golin, Mordecai J., Italiano, Giuseppe F., Deng, Xin, and Sohraby, Kazem (1999). On the optimal placement of web proxies in the internet. In Proceedings of the Conference on Computer Communications (IEEE Infocom), New York.
Pan, Jianping, Hou, Y. Thomas, and Li, Bo (2003). An overview DNS-based server selection in content distribution networks. Computer Networks, 43(6).
Qiu, Lili, Padmanabhan, Venkata, and Voelker, Geoffrey (2001). On the placement of web server replicas. In Proceedings of the Conference on Computer Communications (IEEE Infocom), Anchorage, Alaska.
Rabinovich, Michael (1998). Issues in web content replication. Data Engineering Bulletin (invited paper), 21(4).
Ranganathan, K. and Foster, I. (2001). Identifying dynamic replication strategies for a high performance data grid. In Proceedings of the International Workshop on Grid Computing, Denver, Colorado.
Rodriguez, Pablo, Spanner, Christian, and Biersack, Ernst W. (2001). Analysis of web caching architectures: Hierarchical and distributed caching. IEEE/ACM Transactions on Networking, 9(4).
Saroiu, Stefan, Gummadi, Krishna P., Dunn, Richard J., Gribble, Steven D., and Levy, Henry M. (2002). An analysis of internet content delivery systems. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI 2002).
Wessels, Duane and Claffy, K. (1998). ICP and the Squid web cache. IEEE Journal on Selected Areas in Communications, 16(3).
Williamson, Carey (2002). On filter effects in web caching hierarchies. ACM Transactions on Internet Technology, 2(1)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Laoutaris, N., Zissimopoulos, V., Stavrakakis, I. (2005). Storage Capacity Allocation Algorithms for Hierarchical Content Distribution. In: Gaïti, D., Galmés, S., Puigjaner, R. (eds) Network Control and Engineering for QoS, Security and Mobility, III. NetCon 2004. IFIP International Federation for Information Processing, vol 165. Springer, Boston, MA. https://doi.org/10.1007/0-387-23198-6_14
Download citation
DOI: https://doi.org/10.1007/0-387-23198-6_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23197-6
Online ISBN: 978-0-387-23198-3
eBook Packages: Computer ScienceComputer Science (R0)