Replication algorithms to retrieve scalable streaming media over content delivery networks

Zhou Su, Jiro Katto, Yasuhiko Yasuda

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Citations (Scopus)

    Abstract

    CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an important role in helping users to retrieve Web objects from the content servers. If a user can directly get the requested objects from the content server, he need not to contact the remote origin server and the user delay can be reduced. However, current replica strategies in CDN are to simply and repeatedly keep the complete replica of the original object on many content servers. This method has some disadvantages, including too much consumed server space and a waste of the storage cost. It is more serious for replicating some large-sized objects such as streaming media, which are being distributed over the Internet more and more. In this paper, we discuss a replication strategy for scalable video streaming in CDN to reduce user response and storage cost. Based on theoretical analysis, assuming layered video coding, we propose a novel replication algorithm which deals with following three problems. (1) How many content servers should be selected to replicate a given video content? (2) For a single video content, how many layers should be kept in a given content server? (3) After selecting a group of content servers for each video content, how do we decide the replication priority for each content server? Simulation results show that the proposed algorithm can efficiently resolve the above problems, and provide much better performance than the conventional methods.

    Original languageEnglish
    Title of host publicationProceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003
    PublisherAssociation for Computing Machinery, Inc
    Pages255-261
    Number of pages7
    ISBN (Electronic)1581137788, 9781581137781
    DOIs
    Publication statusPublished - 2003 Nov 7
    Event5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003 - Berkeley, United States
    Duration: 2003 Nov 7 → …

    Other

    Other5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003
    CountryUnited States
    CityBerkeley
    Period03/11/7 → …

    Fingerprint

    Media streaming
    Servers
    Video streaming
    Image coding
    Costs
    Internet

    Keywords

    • Content distribution networks
    • Network traffic
    • Replication Algorithm
    • Scalable
    • Streaming
    • Web performance

    ASJC Scopus subject areas

    • Media Technology
    • Software
    • Information Systems
    • Computer Science Applications
    • Signal Processing

    Cite this

    Su, Z., Katto, J., & Yasuda, Y. (2003). Replication algorithms to retrieve scalable streaming media over content delivery networks. In Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003 (pp. 255-261). Association for Computing Machinery, Inc. https://doi.org/10.1145/973264.973303

    Replication algorithms to retrieve scalable streaming media over content delivery networks. / Su, Zhou; Katto, Jiro; Yasuda, Yasuhiko.

    Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003. Association for Computing Machinery, Inc, 2003. p. 255-261.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Su, Z, Katto, J & Yasuda, Y 2003, Replication algorithms to retrieve scalable streaming media over content delivery networks. in Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003. Association for Computing Machinery, Inc, pp. 255-261, 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003, Berkeley, United States, 03/11/7. https://doi.org/10.1145/973264.973303
    Su Z, Katto J, Yasuda Y. Replication algorithms to retrieve scalable streaming media over content delivery networks. In Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003. Association for Computing Machinery, Inc. 2003. p. 255-261 https://doi.org/10.1145/973264.973303
    Su, Zhou ; Katto, Jiro ; Yasuda, Yasuhiko. / Replication algorithms to retrieve scalable streaming media over content delivery networks. Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003. Association for Computing Machinery, Inc, 2003. pp. 255-261
    @inproceedings{2841c8cf59cb45a996e582d609696ac6,
    title = "Replication algorithms to retrieve scalable streaming media over content delivery networks",
    abstract = "CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an important role in helping users to retrieve Web objects from the content servers. If a user can directly get the requested objects from the content server, he need not to contact the remote origin server and the user delay can be reduced. However, current replica strategies in CDN are to simply and repeatedly keep the complete replica of the original object on many content servers. This method has some disadvantages, including too much consumed server space and a waste of the storage cost. It is more serious for replicating some large-sized objects such as streaming media, which are being distributed over the Internet more and more. In this paper, we discuss a replication strategy for scalable video streaming in CDN to reduce user response and storage cost. Based on theoretical analysis, assuming layered video coding, we propose a novel replication algorithm which deals with following three problems. (1) How many content servers should be selected to replicate a given video content? (2) For a single video content, how many layers should be kept in a given content server? (3) After selecting a group of content servers for each video content, how do we decide the replication priority for each content server? Simulation results show that the proposed algorithm can efficiently resolve the above problems, and provide much better performance than the conventional methods.",
    keywords = "Content distribution networks, Network traffic, Replication Algorithm, Scalable, Streaming, Web performance",
    author = "Zhou Su and Jiro Katto and Yasuhiko Yasuda",
    year = "2003",
    month = "11",
    day = "7",
    doi = "10.1145/973264.973303",
    language = "English",
    pages = "255--261",
    booktitle = "Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003",
    publisher = "Association for Computing Machinery, Inc",

    }

    TY - GEN

    T1 - Replication algorithms to retrieve scalable streaming media over content delivery networks

    AU - Su, Zhou

    AU - Katto, Jiro

    AU - Yasuda, Yasuhiko

    PY - 2003/11/7

    Y1 - 2003/11/7

    N2 - CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an important role in helping users to retrieve Web objects from the content servers. If a user can directly get the requested objects from the content server, he need not to contact the remote origin server and the user delay can be reduced. However, current replica strategies in CDN are to simply and repeatedly keep the complete replica of the original object on many content servers. This method has some disadvantages, including too much consumed server space and a waste of the storage cost. It is more serious for replicating some large-sized objects such as streaming media, which are being distributed over the Internet more and more. In this paper, we discuss a replication strategy for scalable video streaming in CDN to reduce user response and storage cost. Based on theoretical analysis, assuming layered video coding, we propose a novel replication algorithm which deals with following three problems. (1) How many content servers should be selected to replicate a given video content? (2) For a single video content, how many layers should be kept in a given content server? (3) After selecting a group of content servers for each video content, how do we decide the replication priority for each content server? Simulation results show that the proposed algorithm can efficiently resolve the above problems, and provide much better performance than the conventional methods.

    AB - CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an important role in helping users to retrieve Web objects from the content servers. If a user can directly get the requested objects from the content server, he need not to contact the remote origin server and the user delay can be reduced. However, current replica strategies in CDN are to simply and repeatedly keep the complete replica of the original object on many content servers. This method has some disadvantages, including too much consumed server space and a waste of the storage cost. It is more serious for replicating some large-sized objects such as streaming media, which are being distributed over the Internet more and more. In this paper, we discuss a replication strategy for scalable video streaming in CDN to reduce user response and storage cost. Based on theoretical analysis, assuming layered video coding, we propose a novel replication algorithm which deals with following three problems. (1) How many content servers should be selected to replicate a given video content? (2) For a single video content, how many layers should be kept in a given content server? (3) After selecting a group of content servers for each video content, how do we decide the replication priority for each content server? Simulation results show that the proposed algorithm can efficiently resolve the above problems, and provide much better performance than the conventional methods.

    KW - Content distribution networks

    KW - Network traffic

    KW - Replication Algorithm

    KW - Scalable

    KW - Streaming

    KW - Web performance

    UR - http://www.scopus.com/inward/record.url?scp=77954448035&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77954448035&partnerID=8YFLogxK

    U2 - 10.1145/973264.973303

    DO - 10.1145/973264.973303

    M3 - Conference contribution

    SP - 255

    EP - 261

    BT - Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003

    PB - Association for Computing Machinery, Inc

    ER -