DocumentCode :
231294
Title :
A heuristic for widest edge-disjoint path pair lexicographic optimization
Author :
Cruz, Pedro ; Gomes, Teresa ; Medhi, Deep
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Coimbra, Coimbra, Portugal
fYear :
2014
fDate :
17-19 Nov. 2014
Firstpage :
9
Lastpage :
15
Abstract :
Telecommunication services are pervasive in today´s human activity and are required to offer reliable and quality-of-service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.
Keywords :
optimisation; telecommunication network routing; disjoint routing; lexicographic optimization; maximum-bandwidth disjoint paths; multipath routing; widest edge-disjoint path pair; Algorithm design and analysis; Bandwidth; Complexity theory; Equations; Mathematical model; Multiprotocol label switching; Optimization; disjoint routing; lexicographic optimization; widest path;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reliable Networks Design and Modeling (RNDM), 2014 6th International Workshop on
Conference_Location :
Barcelona
Print_ISBN :
978-1-4799-7039-1
Type :
conf
DOI :
10.1109/RNDM.2014.7014925
Filename :
7014925
Link To Document :
بازگشت