Efficient algorithms for physically-disjoint routing in survivable GMPLS/ASTN networks

Péter Laborczi, Tibor Cinkler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

With the advent of intelligent multilayer networks, like GMPLS, connections can be protected against failures effectively; however, to capitalize the advantages, novel sophisticated routing methods are needed. This paper addresses the task of finding path-pairs in a survivable multilayer network in order to ensure high availability for each connection. Known methods (like running a shortest path algorithm twice) either do not guarantee physical disjointness (SRLG constraints) or may not find solution even if it exists. Besides the Integer Linear Program based approach that yields a solution with minimal total cost, we propose a heuristic method to solve the problem, and extend it to (1) minimize the number of spans used by both working and protection paths, (2) to find the weighted working path while ensuring the existence of a protection path, and (3) to find more than one backup paths for high priority traffic. It is shown with numerous simulations that our proposed method finds solution for significantly (up to 35%) more node pairs than traditional methods, while the running time is only slightly increased. Furthermore, it yields connection availabilities close to the optimum.

Original languageEnglish
Title of host publicationNetworks 2004 - 11th International Telecommunications Network Strategy and Planning Symposium
PublisherVDE VERLAG GMBH
Pages185-192
Number of pages8
ISBN (Print)3800728400, 9783800728404
DOIs
Publication statusPublished - 2004
EventNetworks 2004 - 11th International Telecommunications Network Startegy and Planning Symposium - Vienna, Austria
Duration: Jun 13 2004Jun 16 2004

Publication series

NameNetworks 2004 - 11th International Telecommunications Network Strategy and Planning Symposium

Other

OtherNetworks 2004 - 11th International Telecommunications Network Startegy and Planning Symposium
CountryAustria
CityVienna
Period6/13/046/16/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Efficient algorithms for physically-disjoint routing in survivable GMPLS/ASTN networks'. Together they form a unique fingerprint.

  • Cite this

    Laborczi, P., & Cinkler, T. (2004). Efficient algorithms for physically-disjoint routing in survivable GMPLS/ASTN networks. In Networks 2004 - 11th International Telecommunications Network Strategy and Planning Symposium (pp. 185-192). (Networks 2004 - 11th International Telecommunications Network Strategy and Planning Symposium). VDE VERLAG GMBH. https://doi.org/10.1109/netwks.2004.240884