An Optimal Route Computation Method for GMPLS Based Survivable Network with a Tabu Search Algorithm for the Weighted Constraint Satisfaction Problem
Conference: networks 2006 - 12th International Telecommunications Network Strategy and Planning - Symposium
11/06/2006 - 11/09/2006 at New Delhi, India
Proceedings: networks 2006
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Furuya, Hiroki; Ogino, Nagao; Konishi, Satoshi; Nakamura, Hajime (KDDI R&D Laboratories, Inc. 2-1-15 Ohara, Fujimino, Saitama, 356-8502, Japan)
Tanabe, Takahito; Nitta, Toshihiro; Sato, Makoto (Mathematical Systems, Inc. 2-4-3 Shinjyuku, Shinjyuku-ku, Tokyo, 160-0022, Japan)
Abstract:
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.