Abstract
Content distribution networks use certain mechanisms to guarantee that the replicated documents are consistent with the original documents undergoing updates. In this paper, we present an improved hybrid consistency method based on an existing algorithm which dynamically combines server-side propagation and invalidation. A new threshold, in terms of the ratio of a document’s request rate to its update rate, is established to determine which approach (invalidation or propagation) should be used. In addition, the improved algorithm makes consistency enhancement decisions based on request temporal locality and document size. Simulation results show that the improved algorithm reduces network traffic, achieves high request freshness rates, and introduces little extra response time when compared to other algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Almeida, V., Bestavros, A., Crovella, M., de Oliveira, A.: Characterizing Reference locality in the WWW. In: Proceedings of PDIS (December 1996)
Arlitt, M., Williamson, C.: Web server workload characteristics: The search for invariants. In: Proceedings of ACM SIGMETRICS (May 1996)
Barabasi, A., Albert, R.: Emergence of Scaling in Random Networks. Science 286(5439), 509–512 (1999)
Barford, P., Bestavros, A., Bradley, A., Crovella, M.: Changes inWeb client access patterns: Characteristics and caching implications. World Wide Web 2(1), 15–28 (1999)
Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web Caching and Zipflike Distributions: Evidence and Implications. In: Proceedings of IEEE INFOCOM 2000, New York, NY, March 1999, pp. 126–134 (2000)
Cao, P., Irani, S.: Cost-aware WWW proxy caching algorithms. In: Proceedings USITS 1997, Monterey, California (December 1997)
Chung, J., Sirbu, M.: Pricing Multicast Communication: A Cost-Based Approach. Telecommunication Systems 17(3), 281–297 (2001)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. ACM SIGCOMM 29(4) (October 1999)
Fei, Z.: A new consistency algorithm for dynamic documents in content distribution networks. Journal of Parallel and Distributed Computing 63(10), 916–926 (2003)
GT-ITM: Georgia Tech. Internetwork Topology Models, http://www.cc.gatech.edu/projects/gtitm/
Gwertzman, J., Seltzer, M.: World-Wide Web Cache Consistency. In: Proceedings of the 1996 USENIX Technical Conference (January 1996)
Huberman, B., Adamic, L.: Growth dynamics of the World-Wide Web. Nature 401(6749), 131 (1999)
Iyengar, A., Nahum, E., Shaikh, A., Tewari, R.: Enhancing Web Performance. In: IFIP World Computer Congress (WCC) (2002)
Jin, S., Bestavros, A.: Sources and Characteristics of Web Temporal Locality. In: Proceedings MACOTS 2000, San Francisco, California (August 2000)
Li, D., Cao, P., Dahlin, M.: WCIP: Web Cache Invalidation Protocol. IETF Internet Draft (November 2000)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An Approach to Universal Topology Generation. In: Proceedings of MASCOTS 2001, Cincinnati, Ohio (August 2001)
Medina, A., Matta, I., Byers, J.: On the origin of Power Laws in Internet Topologies. ACM Comp. Comm. Review (April 2000)
Phillips, G., Shenker, S.: Scaling of Multicast Trees: Comments on the Chuang-Sirbu Scaling Law. ACM SIGCOMM 29(4), 41–51 (1999)
Yin, J., Alvisi, L., Dahlin, M., Lin, C.: Volume Leases for Consistency in Large- Scale Systems. IEEE Transactions on Knowledge and Data Engineering (January 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, C., Cooke, D. (2004). An Improved Hybrid Method of Maintaining Content Consistency. In: Chi, CH., Lam, KY. (eds) Content Computing. AWCC 2004. Lecture Notes in Computer Science, vol 3309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30483-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30483-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23898-0
Online ISBN: 978-3-540-30483-8
eBook Packages: Springer Book Archive