Skip to main content

A Two-Stage Genetic Algorithm for the Multi-multicast Routing

  • Conference paper
Advances in Computation and Intelligence (ISICA 2007)

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

Included in the following conference series:

  • 1398 Accesses

Abstract

The multi-multicast routing problem is to find a set of multicasts which allows transmission and routing of packets from many sources to many destinations. Due to the amount of residual bandwidth of a link, the problem becomes complicated. This paper presents an approach to solve the problem based on a two-stage genetic algorithm. The problem is decomposed into two objectives, the primary objective is to find a multicast group from a source to its destinations satisfied bandwidth and delay constraints, and the secondary objective is to find an optimal combinatorial solution in all multicasts. For the objectives, two evolving modules are designed. In the first module a method of encoding tree-like chromosome, and corresponding crossover and mutation operator are presented. The numerical simulation shows that the algorithm is efficient to solve the multi-multicast routing problem.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lee, K.J., Gersht, A., Friedman, A.: Multiple connection routing. Int. J. Digital Analog Commun. Syst. 3, 177–186 (1990)

    Article  Google Scholar 

  2. Downsland, K.A.: Hill-climbing, simulated annealing and the Steiner problem in graphs. Eng.Optim. 17, 91–107 (1991)

    Article  Google Scholar 

  3. Tanaka, Y., Huang, P.C.: Multiple destination routing algorithms. IEICE Trans. Commun. E76-B(5), 544–552 (1993)

    Google Scholar 

  4. Esbensen, H.: Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm. Networks 26, 173–185 (1995)

    Article  MATH  Google Scholar 

  5. Priwan, V., Aida, H., Saito, T.: The multicast tree based routing for the complete broadcast multipoint-to-multipoint communications. IEICE Trans. Commun. E78-B(5), 720–728 (1995)

    Google Scholar 

  6. Leun, Y., Li, G., Xu, Z.B.: A Genetic Algorithm for the Multiple Destination Routing Problems. IEEE Transactions on evolutionary computation 2(4), 150–161 (1998)

    Article  Google Scholar 

  7. Yu, Y.P., Qiu, P.L.: An improved algorithm for Steiner tree. Journal of China Institute of Communications 23(11), 35–40 (2002)

    Google Scholar 

  8. Sun, Q., Langendoerfer, H.: Computation of costrained multicast trees using a genetic algorithm. Eur. Trans. Telecommun. 10, 513–516 (1999)

    Article  Google Scholar 

  9. Salah, A., Fawaz, A.: A Hybrid Evolutionary Algorithm for Multiple-destinations Routing Problem. International Journal of Computational Intelligence & Application 4(4), 337–353 (2004)

    Article  Google Scholar 

  10. Chen, L., Yang, Z.Y., Xu, Z.Q.: A Degree-Delay-Constrained Genetic Algorithm for Multicast Routing Tree. In: Proc. IEEE International Conference on Computer and Information Technology, IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  11. He, X.Y., Fei, X., Luo, J.Z., Wu, J.Y.: A Scheme for QoS-Based Routing Using Genetic Algorithm in Internet. Chinese Journal of Computers 23(11), 1171–1178 (2000)

    Google Scholar 

  12. kim, J., Zeigler, B.P.: Hierarchical Distributed Genetic Algorithms: A Fuzzy Logic Controller Design Application. IEEE Expert, 76–84 (1996)

    Google Scholar 

  13. Liu, Y., Liu, S.Y.: Degree-Constrained Multicasting for Multimedia Communications. Chinese Journal of Computers 24(4), 367–372 (2001)

    Google Scholar 

  14. Chen, M., Li, Z.J.: A Real-Time Multicast Routing Algorithm Based on Genetic Algorithms. Journal of Software 12(5), 721–728 (2001)

    Google Scholar 

  15. Cao, Y.D., Cai, G.: Genetic Algorithm Study of Group Broadcast QoS Router. Computer Engineering 30(7), 80–82 (2004)

    Google Scholar 

  16. Sun, B.L., Li, L.Y.: A Multicast Routing Optimization Algorithm with Bandwidth and Delay-Constrained Based on Genetic Algorithm. Computer Engineering and Applications 11, 30–33 (2004)

    Google Scholar 

  17. Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Comp. Oper. Res. 32(8), 1953–1981 (2005)

    Article  MATH  Google Scholar 

  18. Oh, S., Ahn, C., Ramakrishna, R.S.: A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints. In: King, I., Wang, J., Chan, L., Wang, D. (eds.) ICONIP 2006. LNCS, vol. 4234, pp. 807–816. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lishan Kang Yong Liu Sanyou Zeng

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ma, X., Sun, L., Zhang, Y. (2007). A Two-Stage Genetic Algorithm for the Multi-multicast Routing. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74581-5_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74580-8

  • Online ISBN: 978-3-540-74581-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics