A demand based algorithm for rapid updating of replicas Conference Paper

•  
• Overview
•  
• Research
•  
• Identity
•  
• Additional Document Info
•  
• View All
•  

Overview

abstract

• 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. © 2002 IEEE.

authors

• Acosta Elías J. Jesús
• Navarro-Moldes L.

publication date

• 2002-01-01

published in

• Proceedings - International Conference on Distributed Computing Systems  Proceedings

Research

keywords

• consistency algorithms; distributed system; replication; Weak consistency Additional costs; Consistency algorithms; Consistent state; Distributed systems; nocv1; Replicated systems; replication; Strong consistency; Weak consistency; Distributed computer systems

Identity

Digital Object Identifier (DOI)

• 10.1109/ICDCSW.2002.1030848

Additional Document Info

start page

• 686

end page

• 691

volume

• 2002-January