research-article

Stealth distributed hash table: a robust and flexible super-peered DHT

Authors:

Andrew Brampton,

Andrew MacQuire,

Nicholas J. P. Race,

Laurent MathyAuthors Info & Claims

CoNEXT '06: Proceedings of the 2006 ACM CoNEXT conference

Article No.: 19, Pages 1 - 12

https://doi.org/10.1145/1368436.1368462

Published: 04 December 2006 Publication History

Abstract

Most Distributed Hash Tables (DHTs) simply consider interconnecting homogeneous nodes on the same overlay. However, realistically nodes on a network are heterogeneous in terms of their capabilities. Because of this, traditional DHTs have been shown to exhibit poor performance in a real-world environment. Additionally, we believe that it is this approach that contributes to a limited exploitation of peer-to-peer technologies. Previous work on super-peers in DHTs was proposed to address these performance issues, however the strategy used is often based on locally clustering peers around individual super-peers. This method of super-peering, however, compromises fundamental features such as load-balancing, resilience and routing efficiency, which traditional DHTs originally promised to offer.

We propose a Stealth DHT which addresses the deficiencies of previous super-peer approaches by using the DHT algorithm itself to select the most appropriate super-peer for each message sent by peers. Through simulations and measurements, we show the fitness for purpose of our proposal.

References

[1]

K. Calvert and E. Zegura. Georgiatech internetwork topology models.

[2]

M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC), 20(8), 2002.

Digital Library

[3]

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. of ACM SOSP, October 2001.

Digital Library

[4]

P. Druschel, E. Engineer, R. Gil, Y.-C. Hu, S. Iyer, A. Ladd, A. Mislove, A. Nandi, A. Post, C. Reis, A. Singh, and R. Zhang. Freepastry implementation.

[5]

P. Druschel and A. Rowstron. A large-scale, persistent peer-to-peer storage utility. In Proc. of the Eigth Workshop on Hot Topics in Operating Systems, pages 75--80, May 2001.

Digital Library

[6]

M. J. Freedman, K. Lakshminarayanan, S. Rhea, and I. Stoica. Non-transitive connectivity and DHTs. In Proc. of USENIX WORLDS 2005, December 2005.

Digital Library

[7]

P. B. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In Proc. of IEEE INFOCOM, March 2005.

[8]

H.-C. Hsiao and C.-T. King. Mobility churn in DHTs. In Proc. of the 1st International Workshop on Mobility in Peer-to-Peer Systems (MPPS'05), pages 799--805, June 2005.

Digital Library

[9]

D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In ACM Symposium on Parallelism in Algorithms and Architectures, pages 36--43, June 2004.

Digital Library

[10]

J. Kubiatowicz. Oceanstore: An architecture for global-scalable persistent storage. In Proc. of the ASPLOS 2000, November 2000.

Digital Library

[11]

J. Li, J. Stribling, R. Morris, M. F. Kaashoek, and T. M. Gil. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proc. of IEEE INFOCOM, Miami, FL, March 2005.

[12]

A. MacQuire, A. Brampton, I. A. Rai, and L. Mathy. Authentication in Stealth Distributed Hash Tables. In Proc. of the 32nd Euromicro Conference on Software Engineering and Advanced Applications, August 2006.

Digital Library

[13]

A. MacQuire, A. Brampton, I. A. Rai, and L. Mathy. Performance analysis of Stealth DHT with mobile nodes. In Proc. of the 3rd IEEE International Workshop on Mobile Peer-to-Peer Computing, Pisa, Italy, March 2006.

Digital Library

[14]

A. T. Mizrak, Y. Cheng, V. Kumar, and S. Savage. Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In Proc. of the Third IEEE Workshop on Internet Applications (WIAPP'03), pages 104--111, 2003.

Digital Library

[15]

L. Peterson, D. Culler, T. Anderson, and T. Roscoe. A blueprint for introducing disruptive technology into the Internet. In Proc. of the 1st Workshop on Hot Topics in Networks (HotNets-I), October 2002.

[16]

H. Pucha, S. M. Das, and Y. C. Hu. How to implement DHTs in mobile ad hoc networks? In Proc. of the 10th ACM International Conference on Mobile Computing and Networks, September 2004.

[17]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. of ACM SIGCOMM, August 2001.

Digital Library

[18]

S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In Proc. of the USENIX Annual Technical Conference, June 2004.

Digital Library

[19]

A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329--350, Nov. 2001.

Digital Library

[20]

S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proc. of MMCN, 2002.

[21]

K. Sripanidkulchai. The popularity of gnutella queries and its implications on scalability. In OReillys http://www.openp2p.com, Feb. 2001.

[22]

I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. of ACM SIGCOMM, pages 149--160, August 2001.

Digital Library

[23]

Z. Xu, R. Min, and Y. Hu. Reducing maintenance overhead in DHT based peer-to-peer algorithms. In Proc. of Peer-to-Peer Computing (P2P03), 2003.

Digital Library

[24]

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1):41--53, 2004.

Digital Library

[25]

Y. Zhu, H. Wang, and Y. Hu. A super-peer based lookup in structured peer-to-peer systems. In Proc. of the 16th International Conference on Parallel and Distributed Computing Systems (PDCS'03), 2003.

[26]

S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Proc. of NOSSDAV, June 2001.

Digital Library

Cited By

Singh RChakraborty SKarmakar S(2015)Concurrent deterministic 1–2 skip list in distributed message passing systemsInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2013.87663730:2(135-174)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1080/17445760.2013.876637
Serbanescu VPop FCristea VAntoniu G(2015)A formal method for rule analysis and validation in distributed data aggregation serviceWorld Wide Web10.1007/s11280-015-0334-418:6(1717-1736)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s11280-015-0334-4
Serbanescu VPop FCristea VAntoniu G(2014)Architecture of Distributed Data Aggregation ServiceProceedings of the 2014 IEEE 28th International Conference on Advanced Information Networking and Applications10.1109/AINA.2014.89(727-734)Online publication date: 13-May-2014
https://dl.acm.org/doi/10.1109/AINA.2014.89
Show More Cited By

Index Terms

Stealth distributed hash table: a robust and flexible super-peered DHT

Recommendations

Stealth distributed hash table: unleashing the real potential of peer-to-peer
CoNEXT '05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology
A Promotion Mechanism for Scalable Stealth DHT
ICIW '10: Proceedings of the 2010 Fifth International Conference on Internet and Web Applications and Services

Most Distributed Hash Tables (DHTs) inherently assume interconnecting nodes with homogeneous capabilities. Realistically however, capabilities of nodes on a network widely vary, leading traditional DHTs to inevitably exhibit poor performance in real-...
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CoNEXT '06: Proceedings of the 2006 ACM CoNEXT conference

December 2006

318 pages

ISBN:1595934561

DOI:10.1145/1368436

Program Chairs:
C. Diot
Thomson, France
,
M. Ammar
Georgia Tech

Copyright © 2006 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

Fundacao para a Ciencia e Tecnologia
Associacao de Turismo de Lisboa
SIGCOMM: ACM Special Interest Group on Data Communication
Microsoft: Microsoft
Intel: Intel
ISCTE
Thomson
CISCO
Camara Municipal de Lisboa
E-Next

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 December 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
258
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Singh RChakraborty SKarmakar S(2015)Concurrent deterministic 1–2 skip list in distributed message passing systemsInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2013.87663730:2(135-174)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1080/17445760.2013.876637
Serbanescu VPop FCristea VAntoniu G(2015)A formal method for rule analysis and validation in distributed data aggregation serviceWorld Wide Web10.1007/s11280-015-0334-418:6(1717-1736)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s11280-015-0334-4
Serbanescu VPop FCristea VAntoniu G(2014)Architecture of Distributed Data Aggregation ServiceProceedings of the 2014 IEEE 28th International Conference on Advanced Information Networking and Applications10.1109/AINA.2014.89(727-734)Online publication date: 13-May-2014
https://dl.acm.org/doi/10.1109/AINA.2014.89
Junemann KAndelfinger PHartenstein H(2011)Towards a Basic DHT Service: Analyzing Network Characteristics of a Widely Deployed DHT2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)10.1109/ICCCN.2011.6005906(1-7)Online publication date: Jul-2011
https://doi.org/10.1109/ICCCN.2011.6005906
Cristea VDobre CStratan CPop FCristea VDobre CStratan CPop FCostan A(2010)Architectures for Large Scale Distributed SystemsLarge-Scale Distributed Computing and Applications10.4018/978-1-61520-703-9.ch002(23-46)Online publication date: 2010
https://doi.org/10.4018/978-1-61520-703-9.ch002
Rai I(2010)A Promotion Mechanism for Scalable Stealth DHTProceedings of the 2010 Fifth International Conference on Internet and Web Applications and Services10.1109/ICIW.2010.37(207-212)Online publication date: 9-May-2010
https://dl.acm.org/doi/10.1109/ICIW.2010.37
Visan AIstin MPop FXhafa FCristea V(2010)Peer Interest-based Discovery for Decentralized Peer-to-Peer SystemsProceedings of the 2010 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing10.1109/3PGCIC.2010.60(363-368)Online publication date: 4-Nov-2010
https://dl.acm.org/doi/10.1109/3PGCIC.2010.60
Jimenez ROsmani FKnutsson B(2009)Connectivity properties of Mainline BitTorrent DHT nodes2009 IEEE Ninth International Conference on Peer-to-Peer Computing10.1109/P2P.2009.5284530(262-270)Online publication date: Sep-2009
https://doi.org/10.1109/P2P.2009.5284530
Tyson GGrace PMauthe ABlair GKaune S(2009)A Reflective Middleware to Support Peer-to-Peer Overlay AdaptationProceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems10.1007/978-3-642-02164-0_3(30-43)Online publication date: 4-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02164-0_3
MacQuire ABrampton ARai IRace NMathy L(2008)Authentication in stealth distributed hash tablesJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2008.01.00454:6(607-618)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1016/j.sysarc.2008.01.004
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten