Hybrid genetic algorithm for solving the degree-constrained minimal bandwidth multicast routing problem

Authors:
Yun Pan;Zhenwei Yu;Licheng Wang
Affiliations:
Dept. Computer Science, China University of Mining and Technology-Beijing;Dept. Computer Science, China University of Mining and Technology-Beijing;Dept. Computer Science, Shanghai Jiao Tong University
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 8
Cited 0

Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
A case for end system multicast (keynote address)

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-to-end arguments in system design

ACM Transactions on Computer Systems (TOCS)
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Layered media multicast control (LMMC): rate allocation and partitioning

IEEE/ACM Transactions on Networking (TON)
Path-aware overlay multicast

Computer Networks: The International Journal of Computer and Telecommunications Networking
Edge sets: an effective evolutionary coding of spanning trees

IEEE Transactions on Evolutionary Computation
Deployment issues for the IP multicast service and architecture

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

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.