Share Email Print
cover

Proceedings Paper

An effective algorithm for routing with node inclusion constraint
Author(s): Jian Wu; Sheng Wang; Hongfang Yu; Li Wang; Hongbin Luo
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 19 November 2008
PDF: 8 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71372N (19 November 2008); doi: 10.1117/12.804137
Show Author Affiliations
Jian Wu, Univ. of Electronic Science and Technology of China (China)
Sheng Wang, Univ. of Electronic Science and Technology of China (China)
Hongfang Yu, Univ. of Electronic Science and Technology of China (China)
Li Wang, Univ. of Electronic Science and Technology of China (China)
Hongbin Luo, Univ. of Electronic Science and Technology of China (China)


Published in SPIE Proceedings Vol. 7137:
Network Architectures, Management, and Applications VI
Weisheng Hu; Shoa-Kai Liu; Ken-ichi Sato; Lena Wosinska, Editor(s)

© SPIE. Terms of Use
Back to Top