Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

  • Authors:
  • Wang Zhengying;Shi Bingxin;Zhao Erdun

  • Affiliations:
  • Department of Electronics and Information Engineering, Hua Zhong University of Science and Technology, Wuhan, Hubei 430074, People's Republic of China 430074;Department of Electronics and Information Engineering, Hua Zhong University of Science and Technology, Wuhan, Hubei 430074, People's Republic of China 430074;Department of Electronics and Information Engineering, Hua Zhong University of Science and Technology, Wuhan, Hubei 430074, People's Republic of China 430074

  • Venue:
  • Computer Communications
  • Year:
  • 2001

Quantified Score

Hi-index 0.25

Visualization

Abstract

We present an heuristic genetic algorithm for the quality of service (QoS) multicast routing that depends on: (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree, where the link delay and the link cost are independent metrics. The problem of computing such a constrained multicast tree is NP-complete. We show by experiments that our proposed genetic algorithm is efficient and effective.