Evolutionary P2P Networking That Fuses Evolutionary Computation and P2P Networking Together

In the present paper, we propose an evolutionary P2P networking technique that dynamically and adaptively optimizes several P2P network topologies, in which all of the nodes are included at the same time, in an evolutionary manner according to given evaluation criteria. In addition, through simulations, we examine whether the proposed evolutionary P2P networking technique can provide reliable search capability in dynamic P2P environments. In simulations, we assume dynamic P2P environments in which each node leaves and joins the network with its own probability and in which search objects vary with time. The simulation results show that topology reconstruction by the evolutionary P2P networking technique is better than random topology reconstruction when only a few types of search objects are present in the network at any moment and these search objects are not replicated. Moreover, for the scenario in which the evolutionary P2P networking technique is more effective, we show through simulations that when each node makes several links with other nodes in a single network topology, the evolutionary P2P networking technique improves the reliable search capability. Finally, the number of links that yields more reliable search capability appears to depend on how often nodes leave and join the network.

[1]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[2]  Kenji Ishida,et al.  Dynamic Peer Grouping Method Conforming with Tit-for-Tat Strategy for P2P File Distribution Systems , 2007, IEICE Trans. Commun..

[3]  David W. Corne,et al.  A new evolutionary approach to the degree-constrained minimum spanning tree problem , 1999, IEEE Trans. Evol. Comput..

[4]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[5]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[6]  Niloy Ganguly,et al.  Design of an Efficient Search Algorithm for P2P Networks Using Concepts from Natural Immune Systems , 2004, PPSN.

[7]  Sheng-Tzong Cheng.  Topological optimization of a reliable communication network , 1998 .

[8]  Niloy Ganguly,et al.  Bio-inspired Search and Distributed Memory Formation on Power-Law Networks , 2008, PPSN.

[9]  Steffen Wolf,et al.  Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies Based on Minimum Routing Cost Spanning Trees , 2006, PPSN.

[10]  Yuji Oie,et al.  Evolutionary P2P Networking for Enhancing Search Performance , 2008 .

[11]  Simon G. M. Koo,et al.  A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[12]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .