Skip to main content

A Frame for Selecting Replicated Multicast Servers Using Genetic Algorithm

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Included in the following conference series:

  • 1204 Accesses

Abstract

Multicast server replication effectively utilizes the network resources and improves the performance of the clients. Selection of servers in such environments decides the quality of services. In this paper, we provide a frame to select replicated servers with genetic algorithm. A two-level coding scheme is developed to represent a server selection candidate to chromosome efficiently. In the coding process, a method based on Dijkstra’s algorithm and random disturbance is designed that ensures generating a valid multicast tree. We discuss two options of genetic operators, namely crossover and mutation only at the first level code (GA1) or two levels (GA2). GA2 offers higher heritability and locality, but it requires more techniques to guarantee the validity of offspring. Extensive simulations demonstrate that both GA1 and GA2 outperform other heuristics. Particularly, GA2 is superior to GA1 in the complex network.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fei, Z., Ammar, M., Zegura, E.: Multicast Server Selection: Problems, Complexity and Solutions. IEEE Journal on Selected Areas in Communications 20, 1399–1413 (2002)

    Article  Google Scholar 

  2. Fei, Z., Yang, M., Ammar, M., Zegura, E.: A Framework for Allocating Clients to Rate-Constrained Multicast Servers. Computer Communications 26, 1255–1262 (2003)

    Article  Google Scholar 

  3. Raidl, G.R., Julstrom, B.A.: Edge Set: An Effective Evolutionary Coding of Spanning Trees. IEEE Transations on Evolutionary Computation 7(3), 225–239 (2003)

    Article  Google Scholar 

  4. Fei, X., Luo, J., Wu, J., Gu, G.: QoS Routing Based on Genetic Algorithm. Computer Communications 22, 1394–1399 (1999)

    Google Scholar 

  5. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An Approach to Universal Topology Generation. In: Proc of MASCOTS 2001, Cincinnati, Ohio (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Q., Wu, C. (2005). A Frame for Selecting Replicated Multicast Servers Using Genetic Algorithm. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_102

Download citation

  • DOI: https://doi.org/10.1007/11596981_102

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics