Skip to main content

A Hybrid Neural Network and Genetic Algorithm Approach for Multicast QoS Routing

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3174))

Abstract

Computing the Multicast QoS routing is an NP-complete problem. Generally, it was solved by heuristic algorithms, which include tabu search, simulated annealing, genetic algorithms (GA), neural networks (NN), etc. In this paper, a hybrid neural network and genetic algorithm approach is described to compute the multicast QoS routing tree. The integration of neural network and genetic algorithm can overcome the premature and increase the convergence speed. The simulation results show that the proposed approach outperforms the traditional GA and NN algorithm in terms of both solution accuracy and convergence speed.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Wang, Z., Crowcroft, J.: Quality of service for supporting multimedia applications. IEEE JSAC 14, 1228–1234 (1996)

    Google Scholar 

  2. Wu, J.J., Hwang, R.H., Liu, H.I.: Multicast routing with multiple QoS constraints in ATM networks. Information Sciences 124, 29–57 (2000)

    Article  Google Scholar 

  3. Chotipat, P., Goutam, C., Norio, S.: A Neural Network Approach to Multicast Routing in Real-Time Communication Networks. Network Protocols, IEEE CNF 11, 332–339 (1995)

    Google Scholar 

  4. Lin, J.S., Liu, M., Huang, N.F.: The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule. Information Sciences 129, 17–30 (2000)

    Article  MATH  Google Scholar 

  5. Zhang, S., Liu, Z.: A new dynamic routing algorithm based on chaotic neural networks. Journal of china instituation of communication 12, 1–7 (2001)

    Google Scholar 

  6. Xiang, F., Junzhou, L., Jieyi, W., Guanqun, G.: QoS routing based on genetic algorithm. Computer Communication 22, 1394–1399 (1999)

    Google Scholar 

  7. Wang, Z., Shi, B., Zhao, E.: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Computer Communication 24, 685–692 (2001)

    Article  Google Scholar 

  8. Haghighatab, A.T., Faezb, K., Dehghan, M.A., Mowlaeib, Y.: GA-Based heuristic algorithms for QoS based multicast routing. Knowledge-Based Systems 16, 305–312 (2003)

    Article  Google Scholar 

  9. Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE JSAC 15, 332–345 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pan, D., Du, M., Wang, Y., Yuan, Y. (2004). A Hybrid Neural Network and Genetic Algorithm Approach for Multicast QoS Routing. In: Yin, FL., Wang, J., Guo, C. (eds) Advances in Neural Networks - ISNN 2004. ISNN 2004. Lecture Notes in Computer Science, vol 3174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28648-6_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28648-6_42

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-28648-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics