Heuristic Algorithm for K-disjoint QoS Routing Problem

摘要：

K-disjoint QoS Routing emphasizes to find k disjoint paths from source to destination satisfying the QoS requirements. It is well-known that this problem is NP-Complete. In this paper, we formulate the kdisjoint QoS routing problem as binary integer linear program (BILP) and propose a new heuristic algorithm based on integer linear programming and penalty function. Preliminary numerical results show that the proposed algorithm is viable.

关键词： disjoint QoS routing integer linear programming penalty function multi-constrained path

作者: Zhanke Yu Mingfang Ni Zeyan Wang Huajun Huang

作者单位: Institute of Communications Engineering PLA University of Science and Technology Nanjing, China, 210 Institute of Communications EngineeringPLA University of Science and Technology Nanjing, China, 2100 Institute of Sciences PLA University of Science and Technology Nanjing, China, 211101

会议类型: 国际会议

会议名称: The Fourth International Joint Conference on Computational Science and Optimization(第四届计算科学与优化国际大会 CSO 2011)

会议地点: 昆明、丽江

会议语种:英文

页码: 353-356

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