| | |
Summary: Maintaining Database Consistency in Peer to Peer Networks
Baruch Awerbuch and Ciprian Tutu
Department of Computer Science
Johns Hopkins University
Baltimore, MD 21218, USA
fbaruch, cipriang@cnds.jhu.edu
Technical Report
CNDS-2002-2
http://www.cnds.jhu.edu
February 6th, 2002
Abstract
We present an algorithm for persistent consistent distributed commit (distributed database
commit) in a dynamic, asynchronous, peer to peer network. The algorithm has constant overhead
in time and space and almost constant communication complexity, allowing it to scale to very large
size networks. Previous solutions required linear overhead in communication and space, making
them unscalable.
We introduce a modular solution based on several well de ned blocks with clear formal speci-
cations. These blocks can be implemented in a variety of ways and we give examples of possible
implementations. Most of the existing solutions require acknowledgments from every participant
for each action. Our algorithm is highly eÆcient by aggregating these acknowledgments. Also,
|
