Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Backoff Protocols for Distributed Mutual Exclusion and Ordering
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Failure detection and consensus in the crash-recovery model
Distributed Computing
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
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
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Wait-free regular storage from Byzantine components
Information Processing Letters
BitVault: a highly reliable distributed data retention platform
ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
Efficient Mutual Exclusion in Peer-to-Peer Systems
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Checking extended CTL properties using guarded quotient structures
Formal Methods in System Design
Dynamic quorums for DHT-based enterprise infrastructures
Journal of Parallel and Distributed Computing
Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Atomic distributed semaphores for accessing networked data
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Storing and locating mutable data in structured peer-to-peer overlay networks
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
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
Agent based cloud storage system
AIC'10/BEBI'10 Proceedings of the 10th WSEAS international conference on applied informatics and communications, and 3rd WSEAS international conference on Biomedical electronics and biomedical informatics
An agent-based collaborative framework for mobile p2p applications
AP2PC'05 Proceedings of the 4th international conference on Agents and Peer-to-Peer Computing
Hi-index | 0.00 |
Mutual exclusion is one of the well-studied fundamental primitives in distributed systems. However, the emerging P2P systems bring forward several challenges that can’t be completely solved by previous approaches. In this paper, we propose the Sigma protocol that is implemented inside a dynamic P2P DHT and circumvents those issues. The basic idea is to adopt queuing and cooperation between clients and replicas so as to enforce quorum consensus scheme. We demonstrate that this protocol is scalable with system size, robust to contention, and resilient to network latency variance and fault-tolerant.