Automatic network configuration with dynamic churn prediction

Peer-to-Peer (P2P) systems have been deployed on millions of nodes worldwide in environments that range from static to very dynamic and therefore exhibit different churn levels. Typically, P2P systems introduce redundancy to cope with loss of nodes. In distributed hash tables, redundancy often fixed during development or at initial deployment of the system. This can limit the applicability of the system to stable environments or make them inefficient in such environments. Automatic network configuration can make a system more adaptable to changing environments and reduce manual configuration tasks. Therefore, this paper proposes an automatic replication configuration based on churn prediction that automatically adapts its replication configuration to its environment. The mechanism termed dynamic replication mechanism (dynamic RM) developed and evaluated in this paper is based on exponential moving averages to predict churn that is used itself to determine a replication factor meeting a certain reliability threshold. Simulations with synthetic data and experiments with data from torrent trackers show that the behavior can be predicted accurately in any environment, from low churn rates to diurnal and high churn rates.

[1]  Brian D. Noble,et al.  Exploiting Availability Prediction in Distributed Systems , 2006, NSDI.

[2]  Yookun Cho,et al.  Chordet: an efficient and transparent replication for improving availability of peer-to-peer networked systems , 2010, SAC '10.

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

[4]  Robert Tappan Morris,et al.  Bandwidth-efficient management of DHT routing tables , 2005, NSDI.

[5]  Peter R. Winters,et al.  Forecasting Sales by Exponentially Weighted Moving Averages , 1960 .

[6]  Kam-Wing Ng,et al.  Analytical Study on Improving DHT Lookup Performance under Churn , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[7]  Karl Pearson F.R.S. LIII. On lines and planes of closest fit to systems of points in space , 1901 .

[8]  Krzysztof Rzadca,et al.  Replica Placement in P2P Storage: Complexity and Game Theoretic Analyses , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[9]  Md. Mustafizur Rahman,et al.  Diurnal availability for peer-to-peer systems , 2012, 2012 IEEE Consumer Communications and Networking Conference (CCNC).

[10]  Margo Seltzer,et al.  Reliability-and capacity-based selection in distributed hash tables , 2003 .

[11]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[12]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[13]  Seif Haridi,et al.  Symmetric Replication for Structured Peer-to-Peer Systems , 2005, DBISP2P.

[14]  Kenji Leibnitz,et al.  Estimating Churn in Structured P2P Networks , 2007, ITC.

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

[16]  Robert Goodell Brown,et al.  Smoothing, forecasting and prediction of discrete time series , 1964 .

[17]  Seif Haridi,et al.  ID-Replication for Structured Peer-to-Peer Systems , 2012, Euro-Par.

[18]  Pierre Sens,et al.  RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables , 2012, TAAS.

[19]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[20]  Barbara Pfeffer,et al.  Smoothing Forecasting And Prediction Of Discrete Time Series , 2016 .