Simone A. Ludwig
ABSTRACT
An overlay network is a virtual network that is built on top of the real network such as the Internet. Cloud computing, peer-to-peer networks, and client-server applications are examples of overlay networks since their nodes run on top of the Internet. The major needs of overlay networks are content distribution and caching, file sharing, improved routing, multicast and streaming, ordered message delivery, and enhanced security and privacy. The focus of this paper is the optimization of overlay networks using a Particle Swarm Optimization (PSO) approach. However, since the ever growing need for more infrastructure causes the number of network nodes to grow significantly, the parallelization of the PSO approach becomes a necessity. In this paper, the MapReduce concept, proposed by Google, is adopted for the PSO approach in order to be able to optimize large-scale networks. MapReduce is easy to implement since it is based on the divide and conquer method, and implementation frameworks such has Hadoop allow for scalability and fault tolerance. Experiments of the MapReduce based PSO algorithm are performed to investigate the solution quality and scalability of the approach.
- S. Tarkoma, "Overlay Networks: Toward Information Networking", CRC Press, Auerbach Publications, ISBN: 978--1--4398--1371--3, 2010. Google Scholar
Digital Library
- N. Lam, Z. Dziong, L. G. Mason, "Service Overlay Network Design with Reliability Constraints", Proceedings of IEEE 7th International Workshop on the Design of Reliable Communication Networks, Washington, D.C., USA, 2009.Google Scholar
- T. Baeck, D. Fogel, and Z. Michalewicz, "Handbook of Evolutionary Computation", IOP Publ. Ltd., Bristol, UK, 1997. Google ScholarDigital Library
- G. D. Caro, M. Dorigo, "AntNet: distributed stigmergetic control for communications networks", J. Artif. Int. Res. 9, 1 (December 1998), 317--365, 1998. Google ScholarDigital Library
- J. Montoya, Y. Donoso, E. Montoya, D. Echeverri, "Multiobjective model for multicast overlay networks over IP/MPLS using MOEA", Proceedings of International Conference on Optical Network Design and Modeling, 1--6, 2008.Google ScholarCross Ref
- A. Abraham, H. Liu, Y. Badr, C. Grosan, "A multi-swarm approach for neighbor selection in peer-to-peer networks", Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology (CSTST '08), ACM, New York, NY, USA, 178--184, 2008. Google ScholarDigital Library
- D. Montana, T. Hussain, T. Saxen, "Adaptive reconfiguration of data networks using genetic algorithms", Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1141--1149, San Francisco, CA, USA, 2002. Google ScholarDigital Library
- A. J. Ramirez, D. B. Knoester, B. H. C. Cheng, P. K. McKinley, "Plato: A Genetic Algorithm Approach to Run-Time Reconfiguration in Autonomic Computing Systems", Journal of Cluster Computing, 2010. Google ScholarDigital Library
- S. A. Ludwig, "Nature-Inspired Reconfiguration of Overlay Networks", Proceedings of Third World Congress on Nature and Biologically Inspired Computing (NaBIC), Salamanca, Spain, 2011.Google Scholar
- S. A. Ludwig, "Scalability Analysis: Reconfiguration of Overlay Networks Using Nature-Inspired Algorithms", in Advances in Intelligent Modelling and Simulation: Artificial Intelligence-based Models and Techniques in Scalable Computing, Studies in Computational Intelligence series, vol. 422, pp. 137--154, Springer, 2012.Google Scholar
- MPI (Message Passing Interface), 2014, http://www-unix.mcs.anl.gov/mpi/.Google Scholar
- PVM (Parallel Virtual Machine), 2014, http://www.csm.ornl.gov/pvm/.Google Scholar
- C. Zhou, "Fast parallelization of differential evolution algorithm using MapReduce", Proceedings of the 12th annual conference on Genetic and evolutionary computation, 2010. Google ScholarDigital Library
- C. T. Chu, S. K. Kim, Y. A. Lin, et al., "Map-Reduce for Machine Learning on Multicore", In NIPS (2006), pp. 281--288 by edited by Bernhard Schoelkopf, John C. Platt, Thomas Hoffman.Google Scholar
- K. Kambatla, N. Rapolu, S. Jagannathan, and A. Grama, "Asynchronous Algorithms in MapReduce", Proceedings of the 2010 IEEE International Conference on Cluster Computing (CLUSTER '10), Washington, DC, USA, 245--254, 2010. Google ScholarDigital Library
- A. Verma, X. Llora, D. E. Goldberg, and R. H. Campbell, "Scaling Genetic Algorithms Using MapReduce", Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications (ISDA '09), Washington, DC, USA, 2009. Google ScholarDigital Library
- J. Schaffer and L. Shelman, "On Crossover as an Evolutionary Viable Strategy", In R. Belw and L. Booker, editors, Proceedisn of the 4th International Conference on Genetic Algorithms, Morgan Kaufmann, 1991.Google Scholar
- C. Jin, C. Vecchiola, R. Buyya, "MRPGA: An Extension of MapReduce for Parallelizing Genetic Algorithms", Proceedings of IEEE Fourth International Conference on eScience, 2008. Google ScholarDigital Library
- A. W. McNabb, C. K. Monson, K. D. Seppi, "Parallel PSO using MapReduce", Proceedings of Congress of Evolutionary Computation (CEC), 2007.Google Scholar
- I. Aljarah and S. A. Ludwig, "MapReduce Intrusion Detection System based on a Particle Swarm Optimization Clustering Algorithm", Proceedings of the 2013 IEEE Congress on Evolutionary Computation, Cancun, Mexico, June 2013.Google ScholarCross Ref
- K. Keeton, C. Santos, D. Beyer, J. Chase, J. Wilkes, "Designing for disasters", Proceedings of the 3rd USENIX Conference on File and Storage Technologies, pp. 59--62. Berkeley, CA, USA, 2004. Google ScholarDigital Library
- J. Kennedy, R. Eberhart, "Particle swarm optimization", Proceedings of IEEE International Conference on Neural Networks, Perth, Western Australia, 1995.Google ScholarCross Ref
- A. Engelbrecht, "Computational Intelligence - An Introduction", 2nd Edition, Wiley, 2007. Google ScholarDigital Library
- M. Clerc, "Discrete particle swarm optimization - illustrated by the traveling salesman problem". New Optimization Techniques in Engineering, In Studies in Fuzziness and Soft Computing, Springer, 2004.Google Scholar
- Apache Software Foundation, Hadoop MapReduce, 2011. http://hadoop.apache.org/mapreduce.Google Scholar
Index Terms
- MapReduce-based optimization of overlay networks using particle swarm optimization
Recommendations
Center particle swarm optimization
Center particle swarm optimization algorithm (CenterPSO) is proposed where a center particle is incorporated into linearly decreasing weight particle swarm optimization (LDWPSO). Unlike other ordinary particles in LDWPSO, the center particle has no ...
Euclidean Particle Swarm Optimization
ICINIS '09: Proceedings of the 2009 Second International Conference on Intelligent Networks and Intelligent SystemsParticle swarm optimization (PSO) is a swarm intelligence algorithm, has been successfully applied to many engineering optimization problems and shown its high search speed in these applications. However, as the dimension and the number of local optima ...
Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems
Distributed Algorithms in Science and EngineeringIn this paper, we focus on solving non-linear programming (NLP) problems using quantum-behaved particle swarm optimization (QPSO). After a brief introduction to the original particle swarm optimization (PSO), we describe the origin and development of ...
Comments