Advertisement

A Scalable Framework for Content Replication in Multicast-Based Content Distribution Networks

  • Yannis Matalas
  • Nikolaos D. Dragios
  • George T. Karetsos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4267)

Abstract

This paper proposes a framework for replicating content in multicast- based CDNs. We focus on the design of a scalable and robust system that provides local availability and redundancy of content. The system takes on-line and distributed replication decisions on a per-object basis. The scalability and local redundancy is achieved by partitioning the overlay of surrogate servers into fully meshed groups. The proposed framework can incorporate any set of local metrics and constraints for deciding the placement of replicas, thus allowing the CDN designer to tune it to his specific deployment characteristics.

References

  1. 1.
    Armon, A., Levy, H.: Cache satellite distribution systems: modeling and analysis. In: Proceedings of IEEE INFOCOM (2003)Google Scholar
  2. 2.
    Chen, Y., Katz, R.H., Kubiatowicz, J.D.: Dynamic replica placement for scalable content delivery. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 306. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Chen, M., Singh, J.P., La Paugh, A.: Subscription-enhanced content delivery. In: Proceedings of WCW 2003 (2003)Google Scholar
  4. 4.
    Huang, C., Abdelzaher, T.: Towards content distribution networks with latency guarantees. In: Proceedings of 12th IWQoS (2004)Google Scholar
  5. 5.
    Kangasharju, J., Roberts, J., Ross, K.W.: Object replication strategies in content distribution networks. In: Proceedings of WCW 2001 (June 2001)Google Scholar
  6. 6.
    Karlsson, M., Karamanolis, C., Mahalingam, M.: A framework for evaluating replica placement algorithms. Technical Report HPL-2002-219, HP Labs (2003)Google Scholar
  7. 7.
    Karlsson, M., Karamanolis, C.: Choosing replica placement heuristics for wide-area systems. In: Proceedings of IEEE ICDCS (2004)Google Scholar
  8. 8.
    Korupolu, M., Plaxton, G., Rajaraman, R.: Placement algorithms for hierarchical cooperative caching. Journal of Algorithms (January 2001)Google Scholar
  9. 9.
    Jamin, S., Jin, C., Kurc, A.R., Raz, D., Shavitt, Y.: Constrained mirror placement on the Internet. In: Proceedings of IEEE INFOCOM (2001)Google Scholar
  10. 10.
    Li, B., Golin, M.J., Italiano, G.F., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the Internet. In: Proceedings of IEEE INFOCOM (1999)Google Scholar
  11. 11.
    Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the placement of web server replicas. In: Proceedings of IEEE INFOCOM (2001)Google Scholar
  12. 12.
    Radoslavov, P., Govindan, R., Estrin, D.: Topology-informed internet replica placement. In: Proceedings of WCW 2001 (June 2001)Google Scholar
  13. 13.
    Yu, H., Vahdat, A.: Minimal replication cost for availability. In: Proceedings of the 21st annual Symposium on Principles of Distributed Computing (2002)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Yannis Matalas
    • 1
  • Nikolaos D. Dragios
    • 2
  • George T. Karetsos
    • 2
  1. 1.Digital Media & Internet Technologies Department, Intracom TelecomAthensGreece
  2. 2.School of Electrical and Computer EngineeringNational Technical University of AthensGreece

Personalised recommendations