International Journal of High Performance Systems Architecture · 2008 · 36 citations · 15 references
ComputingComputer ScienceComputer SystemsAlgorithmsDistributed SystemsEvolutionary TheoryDistributed AlgorithmsDistributed ComputingEvolutionary ComputationGenetic AlgorithmsPeer-to-peer NetworksPeer-to-peer SystemsDistributed Evolutionary ComputationPeer Churn ManagementPeer-to-peer ComputingResilienceResilience In Peer-to-peer NetworksScalabilityScalability Modeling
In this paper we analyse the resilience of a peer-to-peer (P2P) evolutionary algorithm (EA) subject to the following dynamics: computing nodes acting as peers leave the system independently from each other causing a collective effect known as churn. Since the P2P EA has been designed to tackle large instances of computationally expensive problems, we will assess its behaviour under these conditions, by performing a scalability analysis in five different scenarios using the massively multimodal deceptive problem as a benchmark. In all cases, the P2P EA reaches the success criterion without a penalty on the runtime. We show that the key to the algorithm resilience is to ensure enough peers at the beginning of the experiment; even if some of them leave, those that remain contain enough information to guarantee a reliable convergence.
15
Understanding churn in peer-to-peer networks
Daniel Stutzbach, Reza Rejaie · 2006 · 741 citations
The gambler's ruin problem, genetic algorithms, and the sizing of populations
G.R. Harik, Erick Cantú‐Paz, David E. Goldberg et al. · 2002 · 153 citations
Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms
Kumara Sastry, Martin Pelikán, Prasanna Parthasarathy et al. · 2004 · 114 citations