An Improved Genetic Algorithm for QOS Multicast Routing

摘要：

Aiming at the problem of multicast routing with multiple QoS constraint, such as delay, bandwidth, losing rate, a new genetic algorithm is brought up based on the k-th shortest path in this paper. Our algorithm outputs an approximate Steiner tree satisfying all QoS constraint of multicast request in a network with e edges and v vertices,in time O(e+vlogv+kv). Under the genetic algorithm we proposed, a set of new methods in coding, crossover and mutation operation are also introduced which effectively improving the convergence of the genetic algorithm.

关键词： GA multicast routing k-th shortest path

作者: FAN Yiming YU Jianjun FANG Zhimin

作者单位: Department of Information and Electronic Engineering of West branch of Zhejiang University of Technology, Zhejiang, Quzhou, 324000, China

会议类型: 国际会议

会议名称: 第三届信号设计及其在通信中的应用国际会议(Proceedings of 2007 International Workshop on Signal Design and Its Applications in Communications IWSDA07)

会议地点: 成都

会议语种:英文

页码: 133-137

在线出版日期: 2007-09-23（万方平台首次上网日期，不代表论文的发表时间）