Skip to main content
Log in

Optimizing self-organizing overlay network using evolutionary approach

  • BIC-TA 2006
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Self-organizing overlay networks are emerging as next generation networks capable of adapting to the needs of applications at runtime. Applications performance significantly depends on the structure and behaviors of the underlying self-organizing overlay networks. To achieve desired performance, not only the logical overlay topology but also the behaviors of nodes in this overlay network need to be optimized. Moreover, self-organizing overlay networks are extremely dynamic, unreliable and often large-scale. It is therefore important to design new optimizing approaches to meet these challenges. In this paper, we present an evolutionary optimization methodology for self-organizing overlay network. The optimizations of self-organizing overlay networks are modeled as dynamically evolutionary process, in which the nodes interact with each other, change their internal structures and alter their external links to improve the collective performance. To design appropriate fitness functions and rules that guides the direction of the evolution, overlay network can reach a stable state with desired global application performance eventually. Such a methodology leads to our distributed algorithms for proximity-based overlay topology maintenance and Peer-to-Peer living media streaming, in which every node in the overlay network rewires their behaviors and connectivity according to local available information and embedded rules. These algorithms are shown to perform well using simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In Proc. of ACM SIGCOMM

  2. Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. In Proc. of ACM SIGCOMM

  3. Saroiu S, Gnummadi P, Gribble S (2002) A Measurement Study of Peer-to-Peer File Sharing Systems. In Proc. of SPIE/ACM Conference on Multimedia Computing and Networking (MMCN)

  4. Holland J (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor

    Google Scholar 

  5. Lehmann K (2005), Why simulating evolutionary processes is just as interesting as applying them. In Proc. GECCO

  6. Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms, Oxford University Press

  7. Bäck T, Fogel D, Michalewicz Z. (1997) handbook of evolutionary computation, Oxford University Press, Oxford

  8. Eiben AE, Smith JE (2003) Introduction to evolutionary computing Springer,Heidelberg

  9. Liben-Nowell D, Balakrishnan H (2002) Analysis of the evolution of peer to peer systems. In Proc. of PODC, Monterey, CA

  10. Pandurangan G, Raghavan PE (2001) Building low-diameter P2P networks. In Proc. FOCS

  11. Pietzuch P, Ledlie J, Mitzenmacher M, Seltzer M (2006) Network-aware overlays with network coordinates. In Proc. of IWDDS 2006, Lisbon, Portugal

  12. Zhu Y, Guo J, Li B (2004) oEvolve: Towards evolutionary overlay topologies for high bandwidth data dissemination. IEEE J. Sel Areas Commun, Spec Issue Quality Service Delivery Variable Topol Netw 22:7

    Google Scholar 

  13. Wan H, Ishikawa N, Hjelm J (2005) Autonomous topology optimization for unstructured peer-to-peer networks. In proc. of parallel and distributed systems 2005, 488 – 494

  14. Dingledine R, Freedman MJ, Molnar D (2000) The free haven project: Distributed anonymous storage service, In: Workshop on design issues in anonymity and unobservability

  15. Lai K, Feldman M, Stoica I, Chuang J (2003) Incentives for cooperation in peer-to-peer networks, In: Workshop on economics of peer-to-peer systems

  16. Condie T, Kamvar S D (2004) Adaptive peer-to-peer topologies, In: P2P

  17. BRITE (2003) http://www.cs.bu.edu/brite/

  18. The Gnutella Protocol Specification v4.0 http://www.clip2.com/GnutellaProtocol04.pdf

  19. Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In Proc of SOSP

  20. PPLive homepage http://www.pplive.com/

  21. Vu L, Gupta I, Liang J, Nahrstedt K (2006) Mapping the PPLive network: studying the impacts of media streaming on P2P overlays UIUC Tech report

Download references

Acknowledgments

This work is supported by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry and the National Natural Science Foundation of China (NSFC) under grant number 60433040.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ke Shi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shi, K., Dong, Y. Optimizing self-organizing overlay network using evolutionary approach. Neural Comput & Applic 17, 129–138 (2008). https://doi.org/10.1007/s00521-007-0122-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-007-0122-x

Keywords

Navigation