R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Awd99] D. O. Awduche. MPLS and Traffic Engineering in IP Networks. IEEE Communications Magazine, pp.42-47, 1993.

]. B. Bea00 and . Beauquier, Communications dans les réseaux optiques par multiplexage en longueur d'onde, 2000.

C. [. Cormen, R. Leiserson, . W. Rivestdij59-]-e, and . Dijkstra, Introduction to Algorithms A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, pp.269-271, 1959.

M. Fredman and R. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987.
DOI : 10.1145/28869.28874

Z. Galil and E. Tardos, An O(n2(m + Nlog n)log n) min-cost flow algorithm, Journal of the ACM, vol.35, issue.2, pp.374-386, 1988.
DOI : 10.1145/42282.214090
URL : http://academiccommons.columbia.edu/download/fedora_content/download/ac:142124/CONTENT/CUCS-302-87.pdf

G. Mohan and A. Somani, Routing dependable connections with specified failure restoration guarantees in WDM networks, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), pp.1761-1770, 2000.
DOI : 10.1109/INFCOM.2000.832576

V. [. Makam, K. Sharma, C. Owens, and . Huang, Protection/Restoration of MPLS Networks. work in progress, Internet Draft draft-makam-mpls-protection-00.txt, 1999.

J. Orlin, A faster strongly polynominal minimum cost flow algorithm, Proceedings of the 20th ACM Symposium on Theory of Computing, pp.377-387, 1988.
DOI : 10.1287/opre.41.2.338
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.1933

G. Ramalingam and T. Reps, An Incremental Algorithm for a Generalization of the Shortest-Path Problem, Journal of Algorithms, vol.21, issue.2, pp.267-305, 1996.
DOI : 10.1006/jagm.1996.0046

R. Slosiar and D. Latin, A polynomial-time algorithm for the establishment of primary and alternate paths in ATM networks, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), pp.509-518, 2000.
DOI : 10.1109/INFCOM.2000.832224

J. Suurballe and R. Tarjan, A quick method for finding shortest pairs of disjoint paths. Networks, pp.325-336, 1984.

F. Tillerot, E. Didelet, A. Daviaud, and G. Claveau, Efficient network upgrade based on a WDM optical layer with automatic protection switching, OFC '98. Optical Fiber Communication Conference and Exhibit. Technical Digest. Conference Edition. 1998 OSA Technical Digest Series Vol.2 (IEEE Cat. No.98CH36177), pp.22-27, 1998.
DOI : 10.1109/OFC.1998.657414

D. Zhou and S. Subramaniam, Survivability in optical networks, IEEE Network, vol.14, issue.6, pp.16-23, 2000.