Abstract
Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peer-to-Peer (P2P) computing has recently revealed as a powerful way to harness these resources and efficiently deal with such problems. In this paper, we present a P2P implementation of Genetic Programming based on the JXTA technology. To run genetic programs we use a distributed environment based on a hybrid multi-island model that combines the island model with the cellular model. Each island adopts a cellular genetic programming model and the migration occurs among neighboring peers. The implementation is based on a virtual ring topology. Three different termination criteria (effort, time and max-gen) have been implemented. Experiments on some popular benchmarks show that the approach presents a accuracy at least comparable with classical distributed models, retaining the obvious advantages in terms of decentralization, fault tolerance and scalability of P2P systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
The jxta project., http://www.jxta.org
Fernandez, F., Galeano, G., Gomez, J.A.: Comparing synchronous and asynchronous parallel and distributed genetic programming models. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 326–335. Springer, Heidelberg (2002)
Fernandez, F., Tomassini, M., Vanneschi, L.: An empirical study of multipopulation genetic programming. Genetic Programming and Evolvable Machines 4(1), 21–51 (2003)
Folino, G., Pizzuti, C., Spezzano, G.: A scalable cellular implementation of parallel genetic programming. IEEE Transactions on Evolutionary Computation 7(1), 37–53 (2003)
Johnson, D.M., Teredesai, A., Saltarelli, R.T.: Genetic programming in wireless sensor networks. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 96–107. Springer, Heidelberg (2005)
Koza, J.R.: Genetic Programming: On the Programming of Computers by means of Natural Selection. MIT Press, Cambridge (1992)
Litrán, J.C.C., Défago, X., Satou, K.: Asynchronous peer-to-peer communication for failure resilient distributed genetic algorithms. In: Proc. 15th IASTED Int’l Conf. on Parallel and Distributed Computing and Systems (PDCS), Marina del Rey, CA, USA, November 2003, vol. II, pp. 769–773 (2003)
Sobeih, A., Yurcik, W., Hou, J.C.: Vring: A case for building application-layer multicast rings (rather than trees). In: MASCOTS, pp. 437–446 (2004)
Tackett, W.A., Carmi, A.: SGPC (simple genetic programming in C). C Users Journal 12(4), 121 (1994), ftp://ftp.io.com/pub/genetic-programming
Tan, K.C., Wang, M.L., Peng, W.: A p2p genetic algorithm environment for the internet. Commun. ACM 48(4), 113–116 (2005)
Tomassini, M., Vanneschi, L., Fernández, F., Galeano, G.: Experimental investigation of three distributed genetic programming models. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 641–650. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Folino, G., Spezzano, G. (2006). P-CAGE: An Environment for Evolutionary Computation in Peer-to-Peer Systems. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds) Genetic Programming. EuroGP 2006. Lecture Notes in Computer Science, vol 3905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11729976_31
Download citation
DOI: https://doi.org/10.1007/11729976_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33143-8
Online ISBN: 978-3-540-33144-5
eBook Packages: Computer ScienceComputer Science (R0)