Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The Electoral District Strategy of Replicated Data in Distrinuted Systems
Proceedings of the 5th International GI/ITG/GMA Conference on Fault-Tolerant Computing Systems, Tests, Diagnosis, Fault Treatment
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
The Power of DHT as a Logical Space
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
Flexible Update Management in Peer-to-Peer Database Systems
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Multi-dimensional quorum sets for read-few write-many replica control protocols
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Scalable and dynamic quorum systems
Distributed Computing
Journal of Systems and Software
Dynamic quorums for DHT-based enterprise infrastructures
Journal of Parallel and Distributed Computing
The FastTrack overlay: A measurement study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Dynamic hybrid replication effectively combining tree and grid topology
The Journal of Supercomputing
Binary vote assignment grid quorum for managing fragmented database
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Hi-index | 0.00 |
Managing updates in a peer-to-peer (P2P) network can be a challenging task, especially in the unstructured setting. If one peer reads or updates a data item, then it is desirable to read the most recent version or to have the update visible to all other peers. In practice, this should be accomplished by coordinating and writing to only a small number of peers. We propose two approaches, inspired by hierarchical quorums, to solve this problem in unstructured P2P networks. Our first proposal provides uniform load balancing, while the second sacrifices full load balancing for larger average quorum intersection, and hence greater tolerance to network churn. We demonstrate that applying a random logical tree structure to peers on a per-data item basis allows us to achieve near optimal quorum size, thus minimizing the number of peers that must be coordinated to perform a read or write operation. Unlike previous approaches, our random hierarchical quorums are always guaranteed to overlap at at least one peer when all peers are reachable and, as demonstrated through performance studies, prove to be more resilient to changing network conditions to maximize quorum intersection than previous approaches with a similar quorum size. Furthermore, our two quorum approaches are interchangeable within the same network, providing adaptivity by allowing one to be swapped for the other as network conditions change.