Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pawlowski, B., Shepler, S., et al.: The NFS Version 4 Protocol. In: Proceedings of the 2nd international system administration and networking conference, SANE 2000 (2000)
Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the Evolution of Peer-to-Peer Systems. In: 21st ACM Symposium on Principles of Distributed Computing (PODC), Monterey, CA (July 2002)
Chokler, G., Malkhi, D., Reiter, M.: Backoff Protocols for Distributed Mutual Exclusion and Ordering. In: Proceedings of 21st International Conference on Distributed Computing Systems, ICDCS (2001)
Stoica, I., et al.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM 2001, San Deigo, CA (August 2001)
Yin, J., et al.: Separating Agreement from execution for Byzantine Fault Tolerant Services. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles, Octobor (2003)
Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)
Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565 (1978)
Aguilera, M.K., Chen, W., Toueg, S.: Failure detection and consensus in the crashrecovery model. Distributed Computing 13(2), 99–125 (2000)
Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans (February 1999)
Velazquez, M.G.: A Survey of Distributed Mutual Exclusion Algorithms, Colorado State University, Technical Report CS-93-116
Abramson, N.: The Aloha System. Another Alternative for Computer Communications. In: AFIPS Conference Proceedings, vol. 36, pp. 295–298 (1970)
Saroiu, S., Krishna Gummadi, P., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Proceedings of Multimedia Computing and Networking, MMCN (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of ACM SIGCOMM (2001)
Lin, S., Lian, Q., Chen, M., Zhang, Z.: A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems, Microsoft Research, Technical Report MSR-TR-2004-13
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 255–267
Zhang, Z.: The Power of DHT as a Logical Space. In: FTDCS 2004 (2004) (to appear)
Chen, W., Lin, S., Lian, Q., Zhang, Z.: Sigma: A Fast Fault-Tolerant Mutual Exclusion Algorithm in Dynamic Distributed System (submission in preparation)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, SD., Lian, Q., Chen, M., Zhang, Z. (2005). A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems. In: Voelker, G.M., Shenker, S. (eds) Peer-to-Peer Systems III. IPTPS 2004. Lecture Notes in Computer Science, vol 3279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30183-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30183-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24252-9
Online ISBN: 978-3-540-30183-7
eBook Packages: Computer ScienceComputer Science (R0)