Design of capacitated survivable networks with a single facility

IEEE/ACM Transactions on Networking

Volumn 13, Issue 2, 2005, Pages 248-261

  Kerivin, Hervé ^a,b   Nace, Dritan ^c   Pham, Thi Tuyet Loan ^d  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITÉ BLAISE PASCAL   (France)

^c UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^d TMA Company   (Viet Nam)

Author keywords

Dimensioning; Mixed integer linear programming; Network topology; Rerouting strategies; Survivable networks

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

DIMENSIONING; MIXED INTEGER LINEAR PROGRAMMING; NETWORK TOPOLOGY; REROUTING STRATEGIES; SURVIVABLE NETWORKS;

DATA COMMUNICATION SYSTEMS;

EID: 18844406007     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.845547     Document Type: Article

References (26)

1. S. Chopra, I. Gilboa, and S. T. Sastry, "Source sink flows with capacity installation in batches," Discrete Appl. Math., vol. 85, pp. 165-192, 1998.
2. W. Ben-Ameur, "Optimization et sécurization de réseaux," Ph.D. thesis, ENST, Paris, France, 1999.
3. B. Fortz, "Design of survivable networks with bounded rings," in SMG Thesis Series. Brussels, Belgium: Université Libre de Bruxelles, 1998.
4. H. Kerivin, "RéSeaux Fiables et PolyèDres," Ph.D. thesis, Université Blaise Pascal, Clermont-Ferrand, France, 2000.
5. T.-T.-L. Palm, "Optimization et Conception Des RéSeaux SéCurisés: Une Approche Basée Sur la DèComposition De Benders," Ph.D. thesis, Université de Technologie de Compiègne, Compiègne cedex, France, 2004.
6. M. Stoer, Design of Survivable Networks. New York: Springer-Verlag, 1992, vol. 1531, Lecture Notes in Mathematics.
7. A. Balakrishnan, T. L. Magnanti, and R. T. Wong, "A dual-ascent procedure for large-scale uncapacitated network design," Op. Res., vol. 37, pp. 716-740, 1989.
8. J.-L. Lutton, D. Nace, and J. Carlier, "Assigning spare capacities in survivable mesh networks," Telecommun. Syst., vol. 13, pp. 441-452, 2000.
9. F. Poppe and P. Demeester, "Economic allocation of spare capacity in mesh-restorable networks," in Proc. 6th Int. Conf. Telecommunication Systems, 1998, pp. 77-86.
10. M. Stoer and G. Dahl, "A polyhedral approach to multicommodity survivable network design," Numerische Mathematik, vol. 68, pp. 149-167, 1994.
11. W. Ben-Ameur and T.-T.-L. Plam, "Design of survivable networks based on end-to-end rerouting," in Proc. 3rd Int. Workshop on DRCN, Budapest, Hungary, 2001, pp. 258-265.
12. J. Doucette and W. D. Grover, "Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks," IEEE J. Select. Areas Commun., vol. 18, no. 10, pp. 1912-1923, Oct. 2000.
13. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. New York: Springer-Verlag, 1988.
14. J.-L. Lutton and J. Geffard, "Dimensionnement de réseaux sécurisés," in Proc. Francoro, vol. 2, Sousse, Tunisia, 1998.
15. K. Murakami and S. Kim, "Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration," IEEE Trans. Netw., vol. 6, no. 2, pp. 207-221, Apr. 1998.
16. M. Minoux, "Network synthesis and optimum network design problems: Models, solution methods and applications," Networks, vol. 19, pp. 313-360, 1989.
17. J. F. Benders, "Partitioning procedures for solving mixed variables programming problems," Numerische Mathematik, vol. 4, pp. 238-252, 1962.
18. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, "Combinatorial optimization," in Wiley Interscience Series in Discrete Mathematics and Optimization. New York: Wiley, 1998.
19. G. L. Nemhauser and L. A. Wolsey, "Integer and combinatorial optimization," in Wiley Interscience Series in Discrete Mathematics and Optimization. New York: Wiley, 1988.
20. M. Iri, "On an extension of the maximum-flow minimum-cut theorem to multicommodity flows," J. Oper. Res. Soc. Jpn., vol. 13, pp. 129-135, 1971.
21. K. Onaga and O. Kakusho, "On feasibility conditions of multicommodity flows in networks," IEEE Trans. Circuit Theory, vol. 4, pp. 425-429, 1971
22. D. Avis, "On the extreme rays of the metric cone," Canad. J. Math. XXXII, pp. 126-144, 1980.
23. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
24. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum-flow problem," J. ACM, vol. 35, pp. 921-940, 1988.
25. T. L. Magnanti, P. Mirchandani, and R. Vachani, "Modeling and solving the capacitated network loading problem," Op. Res., vol. 43, pp. 142-157, 1995.
26. F. Barahona, "Network design using cut inequalities," SIAM J. Optimization, vol. 6, pp. 823-837, 1996.