Scalable consistency management in dynamic content distribution overlays

Zhou Su, Jiro Katto, Yasuda Yasuhiko

    研究成果: Conference contribution

    抄録

    Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, with the development whereby overlay systems, can manage dynamically [2] changing files, an important issue to be resolved is consistency management, which means the cached replicas on different sites must be updated if the originals change. In this paper, based on the analytical formulation of object freshness time, web access distribution and network topology, we derive a novel algorithm as follows: (1) For a given content which has been changed at its original server, only a limited number of its replicas, instead of all replicas are updated. (2) After a replica has been selected for update, the latest version will be sent from an algorithm-decided site instead of from its original server. Simulation results verify that the proposed algorithm provides much better consistency management than, conventional methods with the reduced update overhead and network traffic.

    元の言語English
    ホスト出版物のタイトルProceedings - IEEE International Conference on Cluster Computing, ICCC
    DOI
    出版物ステータスPublished - 2005
    イベント2005 IEEE International Conference on Cluster Computing, CLUSTER - Burlington, MA
    継続期間: 2005 9 272005 9 30

    Other

    Other2005 IEEE International Conference on Cluster Computing, CLUSTER
    Burlington, MA
    期間05/9/2705/9/30

    Fingerprint

    Servers
    Topology
    Internet

    ASJC Scopus subject areas

    • Engineering(all)

    これを引用

    Su, Z., Katto, J., & Yasuhiko, Y. (2005). Scalable consistency management in dynamic content distribution overlays. : Proceedings - IEEE International Conference on Cluster Computing, ICCC [4154125] https://doi.org/10.1109/CLUSTR.2005.347082

    Scalable consistency management in dynamic content distribution overlays. / Su, Zhou; Katto, Jiro; Yasuhiko, Yasuda.

    Proceedings - IEEE International Conference on Cluster Computing, ICCC. 2005. 4154125.

    研究成果: Conference contribution

    Su, Z, Katto, J & Yasuhiko, Y 2005, Scalable consistency management in dynamic content distribution overlays. : Proceedings - IEEE International Conference on Cluster Computing, ICCC., 4154125, 2005 IEEE International Conference on Cluster Computing, CLUSTER, Burlington, MA, 05/9/27. https://doi.org/10.1109/CLUSTR.2005.347082
    Su Z, Katto J, Yasuhiko Y. Scalable consistency management in dynamic content distribution overlays. : Proceedings - IEEE International Conference on Cluster Computing, ICCC. 2005. 4154125 https://doi.org/10.1109/CLUSTR.2005.347082
    Su, Zhou ; Katto, Jiro ; Yasuhiko, Yasuda. / Scalable consistency management in dynamic content distribution overlays. Proceedings - IEEE International Conference on Cluster Computing, ICCC. 2005.
    @inproceedings{788ac5bd6cb34f5b839a22ee892ab464,
    title = "Scalable consistency management in dynamic content distribution overlays",
    abstract = "Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, with the development whereby overlay systems, can manage dynamically [2] changing files, an important issue to be resolved is consistency management, which means the cached replicas on different sites must be updated if the originals change. In this paper, based on the analytical formulation of object freshness time, web access distribution and network topology, we derive a novel algorithm as follows: (1) For a given content which has been changed at its original server, only a limited number of its replicas, instead of all replicas are updated. (2) After a replica has been selected for update, the latest version will be sent from an algorithm-decided site instead of from its original server. Simulation results verify that the proposed algorithm provides much better consistency management than, conventional methods with the reduced update overhead and network traffic.",
    author = "Zhou Su and Jiro Katto and Yasuda Yasuhiko",
    year = "2005",
    doi = "10.1109/CLUSTR.2005.347082",
    language = "English",
    isbn = "0780394852",
    booktitle = "Proceedings - IEEE International Conference on Cluster Computing, ICCC",

    }

    TY - GEN

    T1 - Scalable consistency management in dynamic content distribution overlays

    AU - Su, Zhou

    AU - Katto, Jiro

    AU - Yasuhiko, Yasuda

    PY - 2005

    Y1 - 2005

    N2 - Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, with the development whereby overlay systems, can manage dynamically [2] changing files, an important issue to be resolved is consistency management, which means the cached replicas on different sites must be updated if the originals change. In this paper, based on the analytical formulation of object freshness time, web access distribution and network topology, we derive a novel algorithm as follows: (1) For a given content which has been changed at its original server, only a limited number of its replicas, instead of all replicas are updated. (2) After a replica has been selected for update, the latest version will be sent from an algorithm-decided site instead of from its original server. Simulation results verify that the proposed algorithm provides much better consistency management than, conventional methods with the reduced update overhead and network traffic.

    AB - Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, with the development whereby overlay systems, can manage dynamically [2] changing files, an important issue to be resolved is consistency management, which means the cached replicas on different sites must be updated if the originals change. In this paper, based on the analytical formulation of object freshness time, web access distribution and network topology, we derive a novel algorithm as follows: (1) For a given content which has been changed at its original server, only a limited number of its replicas, instead of all replicas are updated. (2) After a replica has been selected for update, the latest version will be sent from an algorithm-decided site instead of from its original server. Simulation results verify that the proposed algorithm provides much better consistency management than, conventional methods with the reduced update overhead and network traffic.

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

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

    U2 - 10.1109/CLUSTR.2005.347082

    DO - 10.1109/CLUSTR.2005.347082

    M3 - Conference contribution

    AN - SCOPUS:50149102670

    SN - 0780394852

    SN - 9780780394858

    BT - Proceedings - IEEE International Conference on Cluster Computing, ICCC

    ER -