Adaptive load balancing in KAD

The endeavor of this work is to study the impact of content popularity in a large-scale Peer-to-Peer network, namely KAD. Armed with the insights gained from an extensive measurement campaign, which pinpoints several deficiencies of the present KAD design in handling popular objects, we set off to design and evaluate an adaptive load balancing mechanism. Our mechanism is backward compatible with KAD, as it only modifies its inner algorithms, and presents several desirable properties: (i) it drives the process that selects the number and location of peers responsible to store references to objects, based on their popularity; (ii) it solves problems related to saturated peers, that entail a significant drop in the diversity of references to objects, and (iii) if coupled with an enhanced content search procedure, it allows a more fair and efficient usage of peer resources, at a reasonable cost. Our evaluation uses a trace-driven simulator that features realistic peer churn and a precise implementation of the inner components of KAD.

[1]  Ernst W. Biersack,et al.  Building a reliable P2P system out of unreliable P2P clients: the case of KAD , 2007, CoNEXT '07.

[2]  Friedhelm Meyer auf der Heide,et al.  Dynamic Load Balancing in Distributed Hash Tables , 2005, IPTPS.

[3]  Sanja Petrovic,et al.  Unfairness in the e-Mule File Sharing System , 2007, International Teletraffic Congress.

[4]  Zhiyong Xu,et al.  Effective Load Balancing in P2P Systems , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[5]  Jeffrey Considine,et al.  Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.

[6]  Yongdae Kim,et al.  Attacking the kad network - real world evaluation and high fidelity simulation using DVN , 2013, Secur. Commun. Networks.

[7]  Yongdae Kim,et al.  Why Kad lookup fails , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[8]  Kuochen Wang,et al.  An efficient load balancing scheme for resilient search in KAD peer to peer networks , 2009, 2009 IEEE 9th Malaysia International Conference on Communications (MICC).

[9]  Taoufik En-Najjary,et al.  Exploiting KAD: possible uses and misuses , 2007, CCRV.

[10]  Taoufik En-Najjary,et al.  Long Term Study of Peer Behavior in the kad DHT , 2009, IEEE/ACM Transactions on Networking.

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

[12]  Moritz Steiner,et al.  Faster Content Access in KAD , 2008, 2008 Eighth International Conference on Peer-to-Peer Computing.

[13]  Liwei Zhou,et al.  EMule Simulator: A Practical Way to Study the eMule System , 2010, 2010 Ninth International Conference on Networks.

[14]  Moritz Steiner.  Load reduction in the KAD peer-to-peer system , 2007 .

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

[16]  Moritz Steiner,et al.  Evaluating and improving the content access in KAD , 2010, Peer Peer Netw. Appl..

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

[18]  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..

[19]  Kam-Wing Ng,et al.  Resilient and efficient load balancing in distributed hash tables , 2009, J. Netw. Comput. Appl..