STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
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
| Hi-index | 0.00 |
Distributed hash tables (DHTs), based on consistent hashing, offer efficient lookup services for decentralized distributed systems. DHTs operate efficiently to handle large number of network nodes with continual node arrivals, departures, and failures. Upon addressing the crucial issues of communication efficiency and offering load balancing in dynamic networking environments, DHTs are the essential components for building structured peer-to-peer (P2P) overlay networks. Although structured overlays improve data availability and consistency, they do not provide strong semantics on distributed data mutual exclusion operations. For a robust network operating system, it is essential to provide atomic data access semantic services. In this paper, a distributed semaphore (DISEM) mechanism is proposed, and it is designed on top of a dynamic structured overlay. The proposed design circumvents the availability and consistency issues. Independent of any underlying overlay algorithms, DISEM provides a tunable level of data availability and consistency, while offering fault tolerance and reliable delivery services. A testbed prototype has been implemented to validate the mutual exclusiveness of networked replicas under different traffic loadings. The measured results indicate that DISEM offers high mutual exclusive access rates under different networking conditions.