Performance of mobile, single-object, replication protocols
Cetintemel, U.
Keleher, P.
Dept. of Comput. Sci., Maryland Univ., MD;
This paper appears in: Reliable Distributed Systems, 2000. SRDS-2000. Proceedings The 19th IEEE Symposium on
Publication Date: 2000
On page(s): 218-227
Meeting Date: 10/16/2000 - 10/18/2000
Location: Nurnberg, Germany
ISBN: 0-7695-0543-0
References Cited: 25
INSPEC Accession Number: 6763350
Digital Object Identifier: 10.1109/RELDI.2000.885409
Current Version Published: 2002-08-06
Abstract
Discusses the implementation and performance of bounded voting,
which is a new object replication protocol designed for use in mobile
and weakly-connected environments. We show that the protocol eliminates
several restrictions of previous work, such as the need for (1) strong
or complete connectivity, (2) complete knowledge of system membership,
and (3) low update rates. The protocol implements an asynchronous,
weighted-voting scheme via epidemic information flow, and commits
updates in an entirely decentralized fashion. A proxy mechanism is used
to enable transparent handling of planned disconnections. We use a
detailed simulation study to characterize the performance of bounded
voting under a variety of loads and environments, and to compare it to
another decentralized epidemic protocol. We further investigate the
performance impact of the proxy mechanism
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
