An Effective Algorithm for Routing with Node Inclusion Constraint

摘要：

In this paper, we propose a heuristic algorithm for solving node inclusion routing problem with additive constraints for the first time. The node inclusion routing problem is significant while a demand need to by-pass several domains and some boundary routers are assigned to be appeared in the route. The integer linear programming model is presented. Two other heuristic algorithms are evaluated. The results show that our heuristic algorithm is more effective with lower trap ratio and very close to the optimal result.

关键词： Node inclusion multi-constraints routing Integer linear programming

作者: Jian Wu Sheng Wang Hongfang Yu Li Wang Hongbin Luo

作者单位: Key Lab of Broadband Optical Fiber Transmission and Communication Networks Technology,University of Electronic Science and Technology of China,Chengdu 610054,China

会议类型: 国际会议

会议名称: 2008亚太光通信会议(Asia-Pacific Optical Communications 2008)

会议地点: 杭州

会议语种:英文

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