Decentralized weighted voting for P2P data management
Maya Rodrig, Anthony LaMarca · 2003
This paper presents a decentralized variant of David Gifford's classic weighted-voting scheme for managing replicated data. Weighted voting offers a familiar consistency model and supports on-line replica reconfiguration. These properties make it a good fit for applications in the pervasive computing domain. By distributing versioned metadata along with data replicas, and managing access to both data and metadata with the same quorums, our algorithm supports a peer-to-peer environment with dynamic device membership. Our algorithm has been implemented as part of a database called Oasis that was designed for pervasive environments.