An adaptive stabilization framework for distributed hash tables
Gabriel Ghinita,Yong Meng Teo +1 more
- 25 Apr 2006
- pp 29-29
TL;DR: This work proposes a novel adaptive stabilization framework that takes into consideration the continuous evolution in network conditions and dynamically adjusts its stabilization rate based on the analysis of the data.
read more
Abstract: Distributed hash tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invariants of the overlay network, DHTs use stabilization procedures that reorganize the topology graph when participating nodes join or fail. Most DHTs use periodic stabilization, in which peers perform stabilization at fixed intervals of time, disregarding the rate of change in overlay topology; this may lead to poor performance and large stabilization-induced communication overhead. We propose a novel adaptive stabilization framework that takes into consideration the continuous evolution in network conditions. Each peer collects statistical data about the network and dynamically adjusts its stabilization rate based on the analysis of the data. The objective of our scheme is to maintain nominal network performance and to minimize the communication overhead of stabilization.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Estimating churn in structured P2P networks
Andreas Binzenhöfer,Kenji Leibnitz +1 more
- 17 Jun 2007
TL;DR: This paper shows how to obtain a robust estimate of the current churn rate in the Distributed Hash Table, independent of the implementation details of the DHT, and investigates the trade-offs between accuracy, overhead, and responsiveness to changes.
47
Modeling and simulation of adaptive Neuro-fuzzy based intelligent system for predictive stabilization in structured overlay networks
TL;DR: The predictive stabilization approach is discussed, a hybrid Neuro-fuzzy based predictor is implemented in MATLAB simulation and this model is applied in a chord based overlay network using OverSim as a simulation tool to enhance the accuracy of the predictions.
19
Survey of Attacks and Defenses on P2PSIP Communications
TL;DR: This analysis presents a clear picture of the new security challenges which must be considered for the development of a Peer-to-Peer Session Initialization Protocol system and a revision of the security mechanisms that can be used to secure them.
18
Still alive: Extending keep-alive intervals in P2P overlay networks
Richard Price,Peter Tino +1 more
- 28 Dec 2009
TL;DR: A number of algorithms which allow each individual connections to extend the interval between successive keep-alive messages based upon the likelihood that a corresponding node will remain in the system are investigated.
Still Alive: Extending Keep-Alive Intervals in P2P Overlay Networks
TL;DR: Three novel algorithms are investigated which prioritise keep-alive messages to nodes that are more likely to have failed and are complimentary to existing gossip-based mechanisms and investigate alternate methods of ascertaining a node’s age so that these algorithms can be robustly deployed in untrustworthy environments.
References
Chord: A scalable peer-to-peer lookup service for internet applications
Ion Stoica,Robert Morris,David R. Karger,M. Frans Kaashoek,Hari Balakrishnan +4 more
- 27 Aug 2001
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
11.2K
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
A scalable content-addressable network
Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard M. Karp,Scott Shenker +4 more
- 27 Aug 2001
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
7.2K
Chord: a scalable peer-to-peer lookup protocol for Internet applications
Ion Stoica,Robert Morris,David Liben-Nowell,David R. Karger,M. Frans Kaashoek,Frank Dabek,Hari Balakrishnan +6 more
TL;DR: Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Ben Y. Zhao,John Kubiatowicz,Anthony D. Joseph +2 more
- 01 Jan 2001
TL;DR: Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources.