By Topic

An Optimal Route Computation Method for GMPLS Based Survivable Network with a Tabu Search Algorithm for the Weighted Constraint Satisfaction Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Furuya, H. ; KDDI R&D Lab. Inc., Saitama ; Ogino, N. ; Konishi, S. ; Nakamura, H.
more authors

This paper proposes a route computation method for a GMPLS based survivable network. It is classified as a precomputed and centralized approach. It tries to globally optimize both working and recovery routes for each demand while taking account of GMPLS recovery schemes and network resource constraints. To enhance its scalability as well as computational performance, two unique devices are introduced to the method: utilization of a tabu-search algorithm for the weighted constraint satisfaction problem (WCSP) and the limitation of candidate routes. Experimental results demonstrate the possibility that it could handle practical-scale networks with satisfactory performance in both optimality of solution and computational time

Published in:

Telecommunications Network Strategy and Planning Symposium, 2006. NETWORKS 2006. 12th International

Date of Conference:

Nov. 2006