On the Stability-Scalability Tradeoff of DHT Deployment

Distributed hash tables (DHTs) provide efficient data naming and location with simple hash-table-like primitives, upon which sophisticated distributed applications can be built. DHT users provide free but unstable peer-to-peer (P2P) capacity. With stable DHT nodes being relatively scarce, a DHT can either rely on a small set of stable nodes with limited collective capacity, or a larger set of potentially less stable nodes and suffer maintenance and data redundancy overhead. In this paper, we provide an analytical model that captures the tradeoff between the stability and the scalability in DHT-based P2P systems. We use the model to demonstrate that the DHT throughput can be optimized through careful engineering of DHT node selection and data redundancy parameters.

[1]  Randy H. Katz,et al.  On failure detection algorithms in overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  R. M. Oliver.  TABLE OF THE WAITING TIME DISTRIBUTION FOR THE CONSTANT SERVICE QUEUE (M/D/1) , 1968 .

[3]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[4]  Seif Haridi,et al.  A Statistical Theory of Chord Under Churn , 2005, IPTPS.

[5]  Miguel Castro,et al.  SplitStream: High-Bandwidth Content Distribution in Cooperative Environments , 2003, IPTPS.

[6]  Scott Shenker,et al.  Fixing the Embarrassing Slowness of OpenDHT on PlanetLab , 2005, WORLDS.

[7]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[8]  Brighten Godfrey,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

[9]  David R. Karger,et al.  Observations on the Dynamic Evolution of Peer-to-Peer Networks , 2002, IPTPS.

[10]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

[11]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[12]  Rodrigo Rodrigues,et al.  Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .

[13]  Rodrigo Rodrigues,et al.  High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.

[14]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[15]  Brighten Godfrey,et al.  Heterogeneity and load balance in distributed hash tables , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Ugo Mocci,et al.  Broadband Network Teletraffic: Final Report of Action COST 242 , 1996 .

[17]  Rodrigo Rodrigues,et al.  When Multi-hop Peer-to-Peer Lookup Matters , 2004, IPTPS.

[18]  Stefan Savage,et al.  Understanding Availability , 2003, IPTPS.

[19]  J. T. Virtamo.  Numerical evaluation of the distribution of unfinished work in an M/D/1 system , 1995 .

[20]  Richard M. Karp,et al.  Load balancing in dynamic structured P2P systems , 2004, IEEE INFOCOM 2004.

[21]  Brian D. Noble,et al.  Predicting node availability in peer-to-peer networks , 2005, SIGMETRICS '05.

[22]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[23]  网行者.  最“变态”的下载：BitTorrent , 2003 .

[24]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[25]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[26]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.