An effective algorithm for routing with node inclusion constraint

Jian Wu; Sheng Wang; Hongfang Yu; Li Wang; Hongbin Luo

doi:10.1117/12.804137

19 November 2008 An effective algorithm for routing with node inclusion constraint

Jian Wu, Sheng Wang, Hongfang Yu, Li Wang, Hongbin Luo

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.

Citation Download Citation

Jian Wu, Sheng Wang, Hongfang Yu, Li Wang, and Hongbin Luo "An effective algorithm for routing with node inclusion constraint", Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71372N (19 November 2008); https://doi.org/10.1117/12.804137

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available