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
CitationAcosta, J; Navarro L. A demand based algorithm for rapid updating of replicas. A: ICDCSW 2002, p. 686-694.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org