19 November 2008 An effective algorithm for routing with node inclusion constraint
Author Affiliations +
Proceedings Volume 7137, Network Architectures, Management, and Applications VI; 71372N (2008) https://doi.org/10.1117/12.804137
Event: Asia-Pacific Optical Communications, 2008, Hangzhou, China
Abstract
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jian Wu, Sheng Wang, Hongfang Yu, Li Wang, Hongbin Luo, "An effective algorithm for routing with node inclusion constraint", Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71372N (19 November 2008); doi: 10.1117/12.804137; https://doi.org/10.1117/12.804137
PROCEEDINGS
8 PAGES


SHARE
Back to Top