Harnessing the power of DHTs to build dynamic quorums in large-scale enterprise infrastructures
Authors: 
Roberto Baldoni, Ricardo Jiménez-Peris, Marta Patiño-Martínez, 
Leonardo Querzoni, Antonino VirigllitoAuthors Info & Claims
Roberto Baldoni, Ricardo Jiménez-Peris, Marta Patiño-Martínez, Leonardo Querzoni, Antonino VirigllitoAuthors Info & ClaimsArticle No.: 5, Pages 1 - 7
Abstract
Recently, enterprises owning a large IT hardware and software infrastructure have started looking at Peer-to-peer technologies as a mean both to reduce costs and to help their technical divisions to manage huge number of devices characterized by a high level of cooperation and a relatively low churn. Obtaining the complete and exclusive control of the system for maintenance or auditing purposes in these enterprise infrastructures is a fundamental operation to be implemented. In the context of classical distributed applications, quorum systems have been considered as a major building block for implementing many paradigms, from distributed mutual exclusion to data replication management. In this paper, we explore how to architect decentralized protocols implementing quorum systems in Distributed Hash Table based cooperative P2P networks. This paper introduces some design principles for both quorum systems and protocols using them that boost their scalability and performance. These design principles consist of a dynamic and decentralized selection of quorums and in the exposure and exploitation of internals of the DHT. As a third design principle it is also shown how to redesign quorum systems to enable efficient decentralization.
References
[1]
R. Baldoni, R. R. Jiménez-Peris, M. Patiño-Martínez, L. Querzoni, and A. Virgillito. Dynamic quorums for dht-based enterprise infrastructures. Journal of Parallel and Distributed Computing, 68(9):1235--1249, 9 2008.
[2]
W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. In SIGMETRICS '00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 34--43, New York, NY, USA, 2000. ACM.
[3]
M. Burrows. The chubby lock service for loosely-coupled distributed systems. In OSDI, pages 335--350. USENIX Association, 2006.
[4]
S. Y. Cheung, M. H. Ammar, and M. Ahamad. The grid protocol: A high performance scheme for maintaining replicated data. In Proceedings of the 6th International Conference on Data Engineering (ICDE), pages 438--445. IEEE Computer Society, 1990.
[5]
G. De Candia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazon's highly available key-value store. In SOSP '07: Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, pages 205--220, New York, NY, USA, 2007. ACM.
[6]
R. Jiménez-Peris, M. Patiño-Martínez, G. Alonso, and B. Kemme. Are quorums an alternative for data replication? ACM Transactions on Database Systems, 28(3):257--294, 2003.
[7]
A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Transactions on Computers, 40(9):996--1004, 1991.
[8]
A. Kumar and S. Y. Cheung. A high availability √N hierarchical grid algorithm for replicated data. Information Processing Letters, 40(6):311--316, 1991.
[9]
M. Naor and A. Wool. The load, capacity, and availability of quorum systems. SIAM Journal of Computing, 27(2):423--447, 1998.
[10]
S. Ratnasamy, M. Handley, R. M. Karp, and S. Shenker. Application-level multicast using content-addressable networks. In J. Crowcroft and M. Hofmann, editors, Networked Group Communication, volume 2233 of Lecture Notes in Computer Science, pages 14--29. Springer, 2001.
[11]
A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329--350, 12--16 November 2001.
[12]
I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), pages 149--160, 2001.
[13]
C. Tang, R. N. Chang, and E. So. A distributed service management infrastructure for enterprise data centers based on peer-to-peer technology. In Proceedings of the IEEE International Conference on Services Computing (SCC), pages 52--59. IEEE Computer Society, 2006.
[14]
C. Tang, M. Steinder, M. Spreitzer, and G. Pacifici. A scalable application placement controller for enterprise data centers. In C. L. Williamson, M. E. Zurko, P. F. Patel-Schneider, and P. J. Shenoy, editors, Proceedings of the 16th international conference on World Wide Web (WWW), pages 331--340. ACM, 2007.
Index Terms
- Harnessing the power of DHTs to build dynamic quorums in large-scale enterprise infrastructures
Recommendations
Dynamic quorums for DHT-based enterprise infrastructures
Peer-to-peer systems (P2P) have become a popular technique to design large-scale distributed applications in unmanaged inter-domain settings, such as file sharing or chat systems, thanks to their capabilities to self-organize and evenly split the load ...
Efficient Discovery of Widely Distributed and Non-volatile Resources on DHTs
ICIW '08: Proceedings of the 2008 Third International Conference on Internet and Web Applications and ServicesIn recent years, a new generation of structured and decentralized P2P CDNs based on distributed hash tables (DHTs) has emerged. Nowadays, DHT algorithms are a powerful building block when designing distributed behaviors. However, sometimes DHTs are not ...
Performance analysis of structured peer-to-peer overlays for mobile networks
Distributed Hash Table DHT based Peer-to-Peer P2P overlays have been widely researched and deployed in many applications such as file sharing, IP telephony, content distribution and media streaming applications. However, their deployment has largely ...
Comments
Information & Contributors
Information
Published In
September 2008
85 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- IBMR: IBM Research
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 September 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
LADIS '08
Sponsor:
- IBMR
LADIS '08: Conference on Large Scale Distributed Systems and Middleware
September 15 - 17, 2008
New York, Yorktown Heights, USA
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 94Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in