A demand based algorithm for rapid updating of replicas
Proceedings 22nd International Conference on Distributed Computing Systems Workshops - Trang 686-691
Tóm tắt
In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algorithms, we have observed that updating first replicas having most demand, a greater number of clients would gain access to updated content in a shorter period of time. In this work we have investigated the benefits that can be obtained by prioritizing replicas with greater demand, and considerable improvements have been achieved. In zones of higher demand, the consistent state is reached up to six times quicker than with a normal weak consistency algorithm, without incurring the additional costs of the strong consistency.
Từ khóa
#Delay #Costs #Web and internet services #Web server #Telecommunication traffic #Contracts #Collaborative work #Entropy #Peer to peer computingTài liệu tham khảo
medina, 0, BRITE: Universal Topology Generation from a User's Perspective
neuman, 1994, Scale in Distributed Systems. In Readings in Distributed Computing Systems
0, The Network Simulator
10.1145/268998.266711
duvvuri, 2000, Adaptative Leases: A Strong Consistency Mechanism for the World Wide Web, IEEE INFOCOM, 834
brun-cota, 1995, Adaptable Replicated Objects in Distributed Enviroments, INRIA
10.1145/163298.163303
10.1109/90.944338
faloutsos, 1999, On Power-Law Relationships of the Internet Topology, ACM SIGCOMM Cambridge MA, 10.1145/316194.316229
10.1145/331119.331171
golding, 1992, Weak-Consistency Group Communication and Membership, University of California Santa Cruz Computer and Information Sciences Technical Report UCSC-CRL-92–52
albert, 1999, Diameter of the World-Wide Web, Nature, 130, 10.1038/43601
adya, 1999, Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions
10.1145/505680.505683