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.
In this paper, we focus on the survivable traffic grooming problem under SRLG (Shared Risk Link Groups)
constraints in WDM mesh networks. Our objective is to minimize the total network resource for a given traffic
demands metric. An efficient simplified ILP (Integer Linear Programming) mathematical formulation is presented.
Considering the computational complexity of ILP, a fast heuristic algorithm named Cross Layer Information
Routing & Multi-Layer Traffic Grooming (CLIR-MLTG) is proposed and evaluated. We compare our simplified
ILP model with the regular ILP model, and the CLIR-MLTG algorithm is also compared both with our simplified
model and a heuristic algorithm named SSR in the literature [1]. Finally, we demonstrate in numerical results that our
simplified ILP model obtains optimal performance and costs much less time compared to the regular ILP model, and
the CLIR-MLTG algorithm outperforms the SSR scheme and it obtains similar performance compared to the ILP
model.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.