Skip to main content

Clone Selection Based Multicast Routing Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Abstract

The problem of multicast routing with delay constraints is of great interest in the communication area in the last few years and has been proved a NP-Complete problem. A novel multicast routing algorithm based on clone selection operator is proposed to solve the problem. Simulations illustrate that compared with other algorithms, the proposed algorithm has a fast convergence speed and powerful search ability. The result shows that the proposed algorithm can find a better solution in the same time or even the shorter time.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   119.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M., Johoson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  2. Kompella, V., Pasquale, J., Polyzos, G.: Multicast Routing for Multimedia Communication. IEEE/ACM Trans on Networking 1, 286–292 (1993)

    Article  Google Scholar 

  3. Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.J.: An Iterative Algorithm for Delay-constrained Minimum-cost Multicasting. IEEE/ACM Trans on Networking 6, 461–474 (1998)

    Article  Google Scholar 

  4. Salama, H.F., Reeves, D.S., Vinitos, I.: Evaluation of Multicast Routing Algorithms for Real-Time Communication on High Speed Networks. IEEE Journal on Selected Area in Communications 15, 332–345 (1997)

    Article  Google Scholar 

  5. Zhang, Q.F., Leung, Y.W.: An Orthogonal Genetic Algorithm for Multimedia Multicast Routing. IEEE Transations on Evolutionary Computation 3, 53–62 (1999)

    Article  Google Scholar 

  6. Du, H.F., Jiao, L.C., Gong, M.G., Liu, R.C.: Adaptive Dynamic Clone Selection Algorithms. In: Zdzislaw, P., Lotfi, Z. (eds.) Proceedings of the Fourth International Conference on Rough Sets and Current Trends in Computing (RSCTC 2004), Uppsala, Sweden, pp. 1–5 (2004)

    Google Scholar 

  7. Wang, Z.Y.: Reach of high Speed network QoS routing technique and simulation environment (Chinese). PHD. Huazhong University of science and technology, Wuhan (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

Hou, C., Jiao, L., Gong, M., Lu, B. (2005). Clone Selection Based Multicast Routing Algorithm. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_94

Download citation

  • DOI: https://doi.org/10.1007/11539902_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics