Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
A new evolutionary approach to the degree-constrained minimumspanning tree problem
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P) networking technique can provide reliable search capability in dynamic P2P environments. The evolutionary P2P networking technique optimizes several P2P network topologies, to which all of the nodes belong at the same time, in an evolutionary manner according to given evaluation criteria. 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 (1) that random topology reconstruction is better than topology reconstruction by the evolutionary P2P networking technique in terms of reliable search capability when several types of search objects are present in the network at any moment and replicas of these search objects are created in the nodes and (2) 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.