Finding failure-disjoint paths for path diversity protection in communication networks

IEEE Communications Letters

Volumn 14, Issue 8, 2010, Pages 776-778

  Zotkiewicz, Mateusz ^a,b   Ben Ameur, Walid ^a   Pióro, Michał ^a,c  

^a TELECOM PARISTECH   (France)

^b WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^c LUND UNIVERSITY   (Sweden)

Author keywords

Algorithms; network reliability; optimization methods

Indexed keywords

COMMUNICATION NETWORKS; DISJOINT PATHS; FLOW PROBLEMS; NETWORK RELIABILITY; OPTIMIZATION METHODS; PATH DIVERSITY; POLYNOMIAL-TIME ALGORITHMS; WEIGHTED DIRECTED GRAPH;

OPTIMIZATION;

ALGORITHMS;

EID: 77955590843     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2010.08.100653     Document Type: Article

References (8)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. New York: Prentice Hall, 1993.
2. P. Demeester, M. Gryseels, A. Autenrieth, C. Brianza, L. Castagna, G. Signorelli, R. Clemente, M. Ravaera, A. Jajszczyk, D. Janukowicz, K. Van Doorselaere, and Y. Harada, "Resilience in multilayer networks," IEEE Commun. Mag., vol.37, no.8, pp. 70-75, 1999.
3. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol.1, pp. 269-271, 1959.
4. W. D. Grover, Meshed-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Netwroking. New York: Prentice Hall, 2004.
5. M. Píoro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. San Francisco: Morgan Kaufman, 2004.
6. J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol.14, no.2, pp. 325-336, 1984.
7. A. Urra, E. Calle, and J. Marzo, "Partial disjoint path for multi-layer protection in gmpls networks," in Proc. DRCN, 2005.
8. J.-P. Vasseur, P. Demeester, and M. Pickavet, Network Recovery. San Francisco: Morgan Kaufman, 2004.