Self-Tuning Distributed Hash Table (DHT) for REsource LOcation And Discovery (RELOAD)

REsource LOcation And Discovery (RELOAD) is a peer-to-peer (P2P) signaling protocol that provides an overlay network service. Peers in a RELOAD overlay network collectively run an overlay algorithm to organize the overlay, and to store and retrieve data. This document describes how the default topology plugin of RELOAD can be extended to support self-tuning, that is, to adapt to changing operating conditions such as churn and network size.

[1]  Yong Meng Teo,et al.  An adaptive stabilization framework for distributed hash tables , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[2]  Jonathan D. Rosenberg,et al.  Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols , 2010, RFC.

[3]  Miguel Castro,et al.  Controlling the Cost of Reliability in Peer-to-Peer Overlays , 2003, IPTPS.

[4]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in Ada , 1993 .

[5]  Scott O. Bradner,et al.  Key words for use in RFCs to Indicate Requirement Levels , 1997, RFC.

[6]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[7]  Henning Schulzrinne,et al.  REsource LOcation And Discovery (RELOAD) Base Protocol , 2014, RFC.

[8]  Gonzalo Camarillo,et al.  Study on maintenance operations in a chord-based Peer-to-Peer session initiation protocol overlay network , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[9]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[10]  Robert Tappan Morris,et al.  Comparing the Performance of Distributed Hash Tables Under Churn , 2004, IPTPS.

[11]  Michael Mealling,et al.  The IETF XML Registry , 2004, RFC.

[12]  Seif Haridi,et al.  Comparing Maintenance Strategies for Overlays , 2008, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008).

[13]  Dan Wing,et al.  Session Traversal Utilities for NAT (STUN) , 2020, RFC.

[14]  Indranil Gupta,et al.  Decentralized Schemes for Size Estimation in Large and Dynamic Groups , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[15]  Dahlia Malkhi,et al.  Estimating network size from local information , 2003, Information Processing Letters.

[16]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[17]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

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

[19]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in C , 1991 .

[20]  Gerald Kunzmann,et al.  A scalable algorithm to monitor chord-based P2P systems at runtime , 2006, IPDPS.

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