Skip to main content
SpringerLink
Log in

Hybrid Genetic Algorithm for Solving the Degree-Constrained Minimal Bandwidth Multicast Routing Problem

  • Conference paper
Computational Intelligence and Security (CIS 2005)

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

Included in the following conference series:

Abstract

In this paper, we propose a programming model for the degree-constrained minimal bandwidth multicast routing problem in overlay networks, and design a hybrid genetic algorithm to solve it. The algorithm combines heuristic searching and genetic searching together for global optimal seeking. The complexity analysis and numerical experiments suggest our proposed model and algorithm are practical and efficient.

Partially supported by the National Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20030290003.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Deering, S.E., Cheriton, D.R.: Multicast routing in datagram internetworks and extended LANs. ACM Transactions on Computer Systems 2, 85–110 (1990)

    Article  Google Scholar 

  2. Diot, C., Levine, B.N., Lyles, B., Kassem, H., Balensiefen, D.: Deployment issues for the IP multicast service and architecture. IEEE Network 1, 78–88 (2000)

    Article  Google Scholar 

  3. Saltzer, J.H., Reed, D.P., Clark, D.D.: End-to-end arguments in system design. ACM Transactions on Computer Systems 2, 277–288 (1984)

    Article  Google Scholar 

  4. Chu, Y., Sanjay, G.R., Zhang, H.: A case for end system multicast. ACM SIGMETRICS Performance Evaluation Review 1, 1–12 (2000)

    Article  Google Scholar 

  5. Yousefi’zadeh, H., Jafarkhani, H., Habibi, A.: Layered media multicast control (LMMC): Rate allocation and partitioning. IEEE/ACM Transactions on Networking 3, 540–553 (2005)

    Article  Google Scholar 

  6. Kwon, M., Fahmy, S.: Path-aware overlay multicast. Computer Networks 1, 23–45 (2005)

    Article  Google Scholar 

  7. Raidl, G.R., Julstrom, B.A.: Edge sets: An effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation 3, 225–239 (2003)

    Article  Google Scholar 

  8. Feng, Y., Yu, Z., Pan, Y.: Heuristic genetic algorithm for degree-constrained multicast routing problem. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, pp. 2448–2452 (2004)

    Google Scholar 

  9. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: an approach to universal topology generation. In: Proceedings of the Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 346–353 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, China University of Mining and Technology-Beijing,  

    Yun Pan & Zhenwei Yu

  2. Institute of Computing and Technology, Chinese Academy of Science,  

    Yun Pan

  3. Dept. Computer Science, Shanghai Jiao Tong University,  

    Licheng Wang

Authors
  1. Yun Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenwei Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Licheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yuping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security (Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pan, Y., Yu, Z., Wang, L. (2005). Hybrid Genetic Algorithm for Solving the Degree-Constrained Minimal Bandwidth Multicast Routing Problem. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_41

Download citation

  • DOI: https://doi.org/10.1007/11596448_41

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation