P. Ho, J. Tapolcai, and H. Mouftah, On Achieving Optimal Survivable Routing for Shared Protection in Survivable Next-Generation Internet, IEEE Transactions on Reliability, vol.53, issue.2, pp.216-225, 2004.
DOI : 10.1109/TR.2004.829141

L. Fleischer, Approximating Fractional Multicommodity Flow Independent of the Number of Commodities, SIAM Journal on Discrete Mathematics, vol.13, issue.4, pp.505-520, 2000.
DOI : 10.1137/S0895480199355754

N. Garg and J. Koenemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.300, 1998.

J. W. Suurballe and R. E. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks, vol.3, issue.2, pp.325-336, 1986.
DOI : 10.1002/net.3230140209

S. Lahoud, Survivable routing and flow allocation in next generation internet networks, 2006.

O. Hauser, M. Kodialam, and T. Lakshman, Capacity design of fast path restorable optical networks, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp.817-826, 2002.
DOI : 10.1109/INFCOM.2002.1019328

L. Fleischer, A. Meyerson, I. Saniee, B. Sheperd, and A. Srinivasan, A scalable algorithm for the minimum expected cost restorable flow problem, 2004.

A. Todimala and B. Ramamurthy, Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006.
DOI : 10.1109/INFOCOM.2006.92