Evolving distributed algorithms with genetic programming

IEEE Transactions on Evolutionary Computation

Volumn 16, Issue 2, 2012, Pages 242-265

  Weise, Thomas ^a   Tang, Ke ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Critical section; distributed algorithms; election; fraglets; GCD; genetic programming; LGP; mutual exclusion; rule based genetic programming; SGP

Indexed keywords

CRITICAL SECTIONS; ELECTION; FRAGLETS; GCD; LGP; MUTUAL EXCLUSIONS; RULE BASED; SGP;

GENETIC PROGRAMMING; PARALLEL ALGORITHMS;

ALGORITHMS;

EID: 84859728298     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2011.2112666     Document Type: Article

References (83)

1. A. S. Tanenbaum and M. van Steen, Distributed Systems. Principles and Paradigms. Upper Saddle River, NJ: Prentice-Hall International, 2003.
2. T. Weise, K. Geihs, and P. A. Baer, "Genetic programming for proactive aggregation protocols," in Proc. 8th Int. Conf. Adaptive Natural Comput. Algorithms, Part I (ICANNGA), LNCS 4431. 2007, pp. 167-173.
3. S. Vasudevan, J. Kurose, and D. Towsley, "Design and analysis of a leader election algorithm for mobile ad hoc networks," in Proc. 12th IEEE ICNP, Oct. 2004, pp. 350-360. (Pubitemid 40574724)
4. Ö. Babaoǧlu, G. Canright, A. Deutsch, G. A. D. Caro, F. Ducatelle, L. M. Gambardella, N. Ganguly, M. Jelasity, R. Montemanni, A. Montresor, and T. Urnes, "Design patterns from biology for distributed computing," ACM Trans. Autonomous Adaptive Syst., vol. 1, no. 1, pp. 26-66, 2006.
5. G. A. D. Caro and M. Dorigo, "AntNet: Distributed stigmergetic control for communications networks," J. Artif. Intell. Res., vol. 9, pp. 317-365, Dec. 1998. (Pubitemid 128636207)
6. T. B̈ack, Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. New York, NY: Oxford University Press, 1996.
7. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Boston, MA: Addison-Wesley Longman Publishing, 1989.
8. T. Weise. (2009). Global Optimization Algorithms: Theory and Application [Online]. Available: http://www.it-weise.de
9. D. B. Fogel, Ed., Evolutionary Computation: The Fossil Record. Los Alamitos, CA: IEEE Computer Society Press, 1998.
10. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press/Stanford University, 1992.
11. T. Weise, "Evolving distributed algorithms with genetic programming," Ph.D. dissertation, Fachbereich 16: Elektrotechnik/Informatik Distributed Syst. Group, Univ. Kassel, Kassel, Germany, 2009 [Online]. Available: http://www.it-weise.de/documents/files/W2009DISS.pdf
12. T. Weise and M. Zapf, "Evolving distributed algorithms with genetic programming: Election," in Proc. 1st ACM/SIGEVO Summit GEC, 2009, pp. 577-584.
13. M. Zapf and T. Weise, "Applicability of emergence engineering to distributed systems scenarios," Fachbereich 16: Elektrotechnik/Informatik, Univ. Kassel, Kassel, Germany, Kasseler Informatikschriften (KIS) 2008, 5, 2009.
14. T. Weise, M. Zapf, and K. Geihs, "Rule-based genetic programming," in Proc. 2nd Int. Conf. Bio-Inspired Models Netw. Inform. Comput. Syst. (BIONETICS), 2007, pp. 8-15.
15. T. Weise, M. Zapf, M. U. Khan, and K. Geihs, "Genetic programing meets model-driven development," in Proc. 7th Int. Conf. HIS, 2007, pp. 332-335.
16. T. Weise and K. Geihs, "Genetic programing techniques for sensor networks," in 5. GI/ITG KuVS Fachgespr̈ach "Drahtlose Sensornetze". Stuttgart, Germany: Universiẗat Stuttgart, Fakulẗat 5: Informatik, Elektrotechnik und Informationstechnik, Institut f̈ur Parallele und Verteilte Systeme, 2006, pp. 21-25.
17. M. C. Sinclair, "Evolutionary telecommunications: A summary," in Proc. Evol. Telecommun.: Past, Present Future A Bird-of-a-Feather Workshop GECCO, 1999, pp. 209-212.
18. P. Kampstra, "Evolutionary computing in telecommunications: A likely EC success story," M.S. thesis, Faculty Sci., Vrije Univ. Amsterdam, Amsterdam, The Netherlands, 2005.
19. D. W. Corne, M. J. Oates, and G. D. Smith, Eds., Telecommunications Optimization: Heuristic and Adaptive Techniques. New York, NY: Wiley, 2000.
20. W. Pedrycz and A. V. Vasilakos, Eds., Computational Intelligence in Telecommunications Networks. Boca Raton, FL: CRC Press, 2000.
21. Y. A. Ş ekerciöglu, A. Pitsilides, and A. V. Vasilakos, "Computational intelligence in management of ATM networks: A survey of current state of research," in Proc. ESIT, European Network for Fuzzy Logic and Uncertainty Modeling in Information Technology (ERUDIT), 1999.
22. A. V. Vasilakos, K. G. Anagnostakis, and W. Pedrycz, "Application of computational intelligence techniques in active networks," Soft Comput.: A Fusion Found. Methodol. Applicat., vol. 5, no. 4, pp. 264-271, 2001. (Pubitemid 33324870)
23. Y. Xu, S. Salcedo-Sanz, and X. Yao, "Metaheuristic approaches to traffic grooming in WDM optical networks," Int. J. Comput. Intell. Applicat., vol. 5, no. 2, pp. 231-249, 2005.
24. T. Weise, H. Skubch, M. Zapf, and K. Geihs, "Global optimization algorithms and their application to distributed systems," Fachbereich 16: Elektrotechnik/Informatik, Univ. Kassel, Kassel, Germany, Kasseler Informatikschriften (KIS) 2008, 3, 2008.
25. Y. Xu, S. Salcedo-Sanz, and X. Yao, "Editorial to the special issue on nature inspired approaches to networks and telecommunications," Int. J. Comput. Intell. Applicat., vol. 5, no. 2, pp. iii-viii, 2005.
26. I. M. A. Kirkwood, S. H. Shami, and M. C. Sinclair, "Discovering simple fault-tolerant routing rules using genetic programming," in Proc. ICANNGA, 1997.
27. S. Salcedo-Sanz, J. Portilla-Figueras, E. Ortiz-García, A. Ṕerez-Bellido, C. Thraves, A. Ferńandez-Anta, and X. Yao, "Optimal switch location in mobile communication networks using hybrid genetic algorithms," Appl. Soft Comput., vol. 8, no. 4, pp. 1486-1497, 2008.
28. M. C. Sinclair, "Optical mesh network topology design using node-pair encoding genetic programming," in Proc. GECCO, vol. 2. 1999, pp. 1192-1197.
29. S. Pierre and F. Hoúeto, "Assigning cells to switches in cellular mobile networks using taboo search," IEEE Trans. Syst. Man Cybern. Part B: Cybern., vol. 32, no. 3, pp. 351-356, Jun. 2002. (Pubitemid 34692407)
30. D. X. Song, M. I. Heywood, and A. N. Zincir-Heywood, "A linear genetic programming approach to intrusion detection," in Proc. Genet. Evol. Comput. Conf. Part II, LNCS 2724. 2003, pp. 2325-2336.
31. B. Xi, Z. Liu, M. Raghavachari, C. H. Xia, and L. Zhang, "A smart hill-climbing algorithm for application server configuration," in Proc. 13th Int. Conf. WWW, 2004, pp. 287-296. (Pubitemid 40752763)
32. J. Tate, B. Woolford-Lim, I. Bate, and X. Yao, "Comparing design of experiments and evolutionary approaches to multiobjective opti mization of sensornet protocols," in Proc. IEEE CEC, May 2009, pp. 1137-1144.
33. H. Yamaguchi, K. Okano, T. Higashino, and K. Taniguchi, "Synthesis of protocol entities' specifications from service specifications in a Petri net model with registers," in Proc. 15th ICDCS, 1995, pp. 510-517.
34. K. El-Fakihy, H. Yamaguchi, and G. von Bochmann, "A method and a genetic algorithm for deriving protocols for distributed applications with minimum communication cost," in Proc. 11th IASTED Int. Conf. PDCS, 1999, pp. 863-868.
35. S. G. de Aráujo, A. de Castro Pinto Pedroza, and A. C. de Mesquita Filho, "Evolutionary synthesis of communication protocols," in Proc. 10th ICT, vol. 2. 2003, pp. 986-993.
36. H. Iba, T. Nozoe, and K. Ueda, "Evolving communicating agents based on genetic programming," in Proc. IEEE Int. CEC, Apr. 1997, pp. 297-302.
37. M. A. Qureshi, "Evolving agents," in Proc. 1st Annu. Conf. GP, 1996, pp. 369-374.
38. C. F. Tschudin, "Fraglets: A metabolistic execution model for communication protocols," in Proc. 2nd Annu. Symp. AINS, 2003.
39. L. A. R. Yamamoto and C. F. Tschudin, "Experiments on the automatic evolution of protocols using genetic programming," in Proc. Revised Sel. Papers From 2nd IFIP WAC, LNCS 3854/2006. 2005, pp. 13-28.
40. L. A. R. Yamamoto and C. F. Tschudin, "Experiments on the automatic evolution of protocols using genetic programming," Comput. Sci. Dept., Comput. Netw. Group, Univ. Basel, Basel, Switzerland, Tech. Rep. CS-2005-002, 2005.
41. G. M. Werner and M. G. Dyer, "Evolution of communication in artificial organisms," in Proc. Workshop Artificial Life II (Santa Fe Institue Studies in the Sciences of Complexity, X). 1990, pp. 659-687.
42. P. K. McKinley, B. H. C. Cheng, C. A. Ofria, D. B. Knoester, B. Beckmann, and H. J. Goldsby, "Harnessing digital evolution," Computer, vol. 41, no. 1, pp. 54-63, 2008.
43. P. K. McKinley, B. H. C. Cheng, and C. A. Ofria, "Applying digital evolution to the development of self-adaptive ULS systems (position paper)," in Proc. Int. Workshop Softw. Technol. ULS, 2007, p. 3.
44. C. A. Ofria and C. O. Wilke, "Avida: A software platform for research in computational evolutionary biology," Artif. Life, vol. 10, no. 2, pp. 191-229, 2004.
45. D. B. Knoester, P. K. McKinley, B. Beckmann, and C. A. Ofria, "Evolution of leader election in populations of self-replicating digital organisms," Dept. Comput. Sci., Michigan State Univ., East Lansing, MI, Tech. Rep. MSU-CSE-06-35, 2006.
46. G. F. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems: Concepts and Design. Upper Saddle River, NJ: Pearson Education, 2005.
47. F. Mattern, Verteilte Basisalgorithmen [Informatik-Fachberichte (IFB), vol. 226]. Berlin, Germany: Springer-Verlag GmbH, 1989.
48. T. Weise, M. Zapf, and K. Geihs, "Evolving proactive aggregation protocols," in Proc. 11th Eur. Conf. Genet. Programming (EuroGP), LNCS 4971. 2008, pp. 254-265.
49. T. Weise, M. Zapf, R. Chiong, and A. J. N. Urbaneja, "Why is optimization difficult?" in Nature-Inspired Algorithms for Optimisation (Studies in Computational Intelligence, vol. 193). Berlin, Germany: Springer-Verlag, 2009, ch. 1, pp. 1-50.
50. I. Rechenberger, Evolutionsstrategie: Optimierung Technischer Systeme Nach Prinzipien der Biologischen Evolution. Stuttgart, Germany: Friedrick Frommann Verlag, 1971/1973.
51. P. C. Phillips, "The language of gene interaction," Genetics, vol. 149, no. 3, pp. 1167-1171, 1998. (Pubitemid 28334514)
52. C. W. G. Lasarczyk and W. Banzhaf, "An algorithmic chemistry for genetic programming," in Proc. 8th EuroGP, LNCS, vol. 3447. 2005, pp. 1-12. (Pubitemid 41274009)
53. N. F. McPhee and R. Poli, "Memory with memory: Soft assignment in genetic programming," in Proc. GECCO, 2008, pp. 1235-1242.
54. F. D. Francone, M. Conrads, W. Banzhaf, and P. Nordin, "Homologous crossover in genetic programming," in Proc. GECCO, vol. 2. 1999, pp. 1021-1026.
55. M. Ben-Ari, Principles of the Spin Model Checker. Berlin, Germany: Springer-Verlag GmbH, 2008.
56. M.-P. Gleizes, V. Camps, and P. Glize, "A theory of emergent computation based on cooperative self-organization for adaptive artificial systems," in Proc. 4th Eur. Congr. Syst. Sci., 1999.
57. S. Bleuler, M. Brack, L. Thiele, and E. Zitzler, "Multiobjective genetic programming: Reducing bloat using SPEA2," in Proc. IEEE CEC, May 2001, pp. 536-543. (Pubitemid 32806386)
58. W. M. Spears and K. A. De Jong, "Using genetic algorithms for supervised concept learning," in Proc. Int. IEEE Conf. TAI, Nov. 1990, pp. 335-341.
59. J. Zhang, "Evolution by gene duplication: An update," Trends Ecol. Evol., vol. 18, no. 6, pp. 292-298, 2003. (Pubitemid 36631749)
60. T. Hu and W. Banzhaf, "Evolvability and acceleration in evolutionary computation," Dept. Comput. Sci., Memorial Univ., St. John's, Canada, Tech. Rep. MUN-CS-2008-04, 2008.
61. A. Teller, "Turing completeness in the language of genetic programming with indexed memory," in Proc. 1st IEEE Conf. Evol. Comput. World Congr. Comput. Intell., Jun. 1994, pp. 136-141.
62. J. R. Woodward, "Evolving turing complete representations," in Proc. IEEE CEC, vol. 2. Jul. 1999, pp. 830-837.
63. W. Banzhaf, "Genetic programming for pedestrians," in Proc. 5th ICGA, 1993, pp. 17-21.
64. Intel Architecture Software Developer's Manual-Volume 1: Basic Architecture, Intel Corporation, Mt. Prospect, IL, 1997.
65. L. A. R. Yamamoto and C. F. Tschudin, "Genetic evolution of protocol implementations and configurations," in Proc. IFIP/IEEE Int. Workshop Self-Managed Syst. Services (SelfMan), May 2005.
66. C. F. Tschudin and L. A. R. Yamamoto. (2007). Fraglets Instruction Set [Online]. Available: http://www.fraglets.net/frag-instrset-20070924.txt
67. P. Dini, "Section 1: Science, new paradigms. Subsection 1: A scientific foundation for digital ecosystems," in Digital Business Ecosystems. Office for Official Publications of the European Communities, Luxembourg, 2007.
68. T. Weise, S. Niemczyk, H. Skubch, R. Reichle, and K. Geihs, "A tunable model for multiobjective, epistatic, rugged, and neutral fitness landscapes," in Proc. GECCO, 2008, pp. 795-802.
69. S. Siegel and N. J. C., Jr., Nonparametric Statistics for The Behavioral Sciences (Humanities/Social Sciences/Languages). New York, NY: McGraw-Hill, 1956/1988.
70. G. Le Lann, "Distributed systems: Toward a formal approach," in Proc. Int. Federation Inform. Process. World Comput. Congr. Information Process., vol. 7. 1977, pp. 155-160. (Pubitemid 8600188)
71. E. Chang and R. Roberts, "An improved algorithm for decentralized extrema-finding in circular configurations of processes," Commun. ACM, vol. 22, no. 5, pp. 281-283, 1979. (Pubitemid 9461372)
72. P. A. P. Moran, "Random processes in genetics," Math. Proc. Cambridge Philosophical Soc., vol. 54, no. 1, pp. 60-71, 1958.
73. E. W. Dijkstra, "Cooperating sequential processes," in Proc. Programming Languages (Electron. Comput.): Papers Presented at a NATO Summer School, 1968, pp. 43-112.
74. L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Commun. ACM, vol. 21, no. 7, pp. 558-565, 1978. (Pubitemid 8615486)
75. G. Ricart and A. K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks," Commun. ACM, vol. 24, no. 1, pp. 9-17, 1981. (Pubitemid 11466095)
76. M. Maekawa, "A √ N algorithm for mutual exclusion in decentralized systems," ACM Trans. Comput. Syst., vol. 3, no. 2, pp. 145-159, 1985. (Pubitemid 15608525)
77. N. R. Paterson, "Genetic programming with context-sensitive grammars," Ph.D. dissertation, School Comput. Sci., Univ. St. Andrews, St Andrews, Scotland, U.K., 2002.
78. M. Wan, T. Weise, and K. Tang, "Novel loop structures and the evolution of mathematical algorithms," in Proc. 14th EuroGP, 2011, to be published.
79. H. Ishibuchi, N. Tsukamoto, and Y. Nojima, "Evolutionary manyobjective optimization: A short review," in Proc. IEEE CEC, Jun. 2008, pp. 2424-2431.
80. H. Juilĺe and J. B. Pollack, "Massively parallel genetic programming," in Advances in Genetic Programming II. Cambridge, MA: MIT Press/Stanford University, 1996, pp. 339-358.
81. W. B. Langdon, "A SIMD interpreter for genetic programming on GPU graphics cards," Dept. Math. Biol. Sci., Univ. Essex, Colchester, Essex, U.K., Comput. Sci. Tech. Rep. CSM-470, 2007.
82. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997. (Pubitemid 127771019)
83. T. Weise, M. Zapf, M. U. Khan, and K. Geihs, "Combining genetic programming and model-driven development," Int. J. Comput. Intell. Applicat., vol. 8, no. 1, pp. 37-52, 2009.