Advertisement

Scalability Analysis: Reconfiguration of Overlay Networks Using Nature-Inspired Algorithms

  • Simone A. Ludwig
Part of the Studies in Computational Intelligence book series (SCI, volume 422)

Abstract

Overlay networks are virtual networks of nodes and logical links built on top of the existing network infrastructure, with the purpose of contributing new functionality. There are many different solutions proposed to tackle a range of specific needs such as content distribution and caching, file sharing, improved routing, multicast and streaming, ordered message delivery, and enhanced security and privacy. In this chapter, the focus lies on the optimization of overlay networks in terms of cost, performance, and reliability. In particular, the main objective is the optimization of data mirroring. Three different optimization approaches are introduced. The first approach is based on a “related work” implementation using Genetic algorithms, the second makes use of artificial immune systems, and the third approach uses the Particle swarm optimization approach. The three algorithms are implemented and experiments are conducted to measure the overall performance, the behavior and feasibility of network and link failures, as well as a scalability analysis is performed.

Keywords

Particle Swarm Optimization Overlay Network Link Failure Genetic Algorithm Approach Discrete Particle Swarm Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Internet Usage Statistics, World Internet Users and Population Stats (2011), http://www.internetworldstats.com/stats.htm (last retrieved in December 2011)
  2. 2.
    Tarkoma, S.: Overlay Networks: Toward Information Networking. CRC Press, Auerbach Publications (2010) ISBN: 978-1-4398-1371-3Google Scholar
  3. 3.
    Awerbuch B., Terzis, A.: A Robust Routing Algorithm for Overlay Networks. Technical Report (2004), http://www.cs.jhu.edu/~terzis/reprouting.pdf (last retrieved in December 2011)
  4. 4.
    Ludwig, S.A.: Nature-Inspired Reconfiguration of Overlay Networks. In: Proc. of the Third World Congress on Nature and Biologically Inspired Computing (NaBIC), Salamanca, Spain (2011)Google Scholar
  5. 5.
    Kostic, D., Rodriguez, A., Albrecht, J., Vahdat, A.: Bullet: High bandwidth data dissemination using an overlay mesh. In: Proc. of the Nineteenth ACM Symposium on Operating Systems Principles (SOSP), Bolton Landing, NY, USA (2003)Google Scholar
  6. 6.
    Cohen, B.: Incentives build robustness in Bit Torrent. In: Proc. of the 1st Workshop on Economics of Peer-to-Peer Systems, Berkley, CA, USA (2003)Google Scholar
  7. 7.
    Gummadi, K.P., Madhyastha, H., Gribble, S.D., Levy, H.M., Wetherall, D.J.: Improving the reliability of internet paths with one-hop source routing. In: Proc. of OSDI 2004 (2004)Google Scholar
  8. 8.
    Chu, Y.H., Rao, S.G., Seshan, S., Zhang, H.: A case for end system multicast. IEEE Journal of Selected Areas in Communication 20(8) (2002)Google Scholar
  9. 9.
    Lumezanu, C., Spring, N., Bhattacharjee, B.: Decentralized message ordering for publish/subscribe systems. In: Proc. of the ACM/IFIP/USENIX 2006 International Conference on Middleware, Melbourne, Australia (2006)Google Scholar
  10. 10.
    Syverson, P., Goldschlag, D., Reed, M.: Anonymous connections and onion routing. Proceedings of Security and Privacy, IEEE Journal on Selected Areas in Communications 16(4), 482–494 (1997)Google Scholar
  11. 11.
    Jannotti, J., Gifford, D.K., Johnson, K.L., Kaashoek, M.F., O’Toole, J.W.: Overcast: reliable multicasting with on overlay network. In: Proceedings of 4th Conference on Symposium on Operating System Design & Implementation, Berkeley, CA, USA, vol. 4 (2000)Google Scholar
  12. 12.
    Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles (SOSP 2001), USA (2001)Google Scholar
  13. 13.
    Lam, N., Dziong, Z., Mason, L.G.: Service Overlay Network Design with Reliability Constraints. In: Proceedings of IEEE 7th International Workshop on the Design of Reliable Communication Networks, Washington, D.C. (2009)Google Scholar
  14. 14.
    Baeck, T., Fogel, D., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. IOP Publ. Ltd., Bristol (1997)zbMATHGoogle Scholar
  15. 15.
    Caro, G.D., Dorigo, M.: AntNet: distributed stigmergetic control for communications networks. J. Artif. Int. Res. 9(1), 317–365 (1998)zbMATHGoogle Scholar
  16. 16.
    Montoya, J., Donoso, Y., Montoya, E., Echeverri, D.: Multiobjective model for multicast overlay networks over IP/MPLS using MOEA. In: Proceedings of International Conference on Optical Network Design and Modeling, pp. 1–6 (2008)Google Scholar
  17. 17.
    Zhao, Y., Wang, J., An, Y., Xia, F.: A Layered Overlay Multicast Algorithm with PSO for Routing Web Streams. In: Liu, W., Luo, X., Wang, F.L., Lei, J. (eds.) WISM 2009. LNCS, vol. 5854, pp. 205–213. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Abraham, A., Liu, H., Badr, Y., Grosan, C.: A multi-swarm approach for neighbor selection in peer-to-peer networks. In: Proceedings of the 5th International Conference on Soft Computing as Transdisciplinary Science and Technology (CSTST 2008), pp. 178–184. ACM, New York (2008)CrossRefGoogle Scholar
  19. 19.
    Montana, D., Hussain, T., Saxena, T.: Adaptive reconfiguration of data networks using genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1141–1149 (2002)Google Scholar
  20. 20.
    Koo, S.G.M., Kannan, K., Lee, C.S.G.: On neighbor-selection strategy in hybrid peer-to-peer networks. Journal of Future Generation Comp. Syst., 732–741 (2006)Google Scholar
  21. 21.
    Ramirez, A.J., Knoester, D.B., Cheng, B.H.C., McKinley, P.K.: Plato: A Genetic Algorithm Approach to Run-Time Reconfiguration in Autonomic Computing Systems. Journal of Cluster Computing (2010)Google Scholar
  22. 22.
    Keeton, K., Santos, C., Beyer, D., Chase, J., Wilkes, J.: Designing for disasters. In: Proceedings of the 3rd USENIX Conference on File and Storage Technologies, USA, pp. 59–62 (2004)Google Scholar
  23. 23.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  24. 24.
    Burnet, F.M.: The Clonal selection theory of acquired immunity. Vanderbilt Univ. Press, Nashville (1959)Google Scholar
  25. 25.
    de Castro, L.N., Timmis, J.: An Artificial Immune Network for Multimodal Function Optimisation. In: Proceedings of the IEEE Congress on Evolutionary Computation, Honolulu, Hawaii, USA (2002)Google Scholar
  26. 26.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Western Australia (1995)Google Scholar
  27. 27.
    Clerc, M.: Discrete particle swarm optimization - illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering. STUDFUZZ. Springer (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceNorth Dakota State UniversityFargoUSA

Personalised recommendations