Design of survivable networks with a single facility

2nd European Conference on Universal Multiservice Networks, ECUMN 2002

Volumn , Issue , 2002, Pages 208-218

  Kerivin, H ^a   Pham, Thi Tuyet Loan ^a,b   Nace, D ^b   Geffard, J ^a  

^a ORANGE LABS   (France)

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

Author keywords

dimensioning; mixed integer linear programming; network topology; rerouting strategies; Survivable networks

Indexed keywords

INTEGER PROGRAMMING; TOPOLOGY;

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

BRANCH AND BOUND METHOD;

EID: 84964478581     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECUMN.2002.1002107     Document Type: Conference Paper

References (23)

1. Chopra, S., Gilboa, I. and Sastry, S.T., "Source sink flows with capacity installation in batches", Discrete Applied Mathematics 85, (1998), pp 165-192.
2. Ben-Ameur, W., "Optimisation et Sécurisation de réseaux", PhD. Dissertation, ENST Paris, France, (1999).
3. Kerivin, H., "Réseaux fiables et polyèdres", PhD. Dissertation, Université Blaise Pascal, Clermont-Ferrand, France, (2000).
4. Stoer, M., "Design of Survivable Networks", Lecture Notes in Mathematics 1531, Springer-Verlag, (1992).
5. Balakrishnan, A., Magnanti, T.L. and Wong R.T., "A dual-ascent procedure for large-scale uncapacitated network design" Operations Research 37, (1989), pp 716-740
6. Lutton, J.-L., Nace, D. and Carlier, J., "Assigning Spare Capacities in Survivable Mesh Networks", Telecommunication Systems 13, (2000), pp 441-452.
7. Poppe, F. and Demeester, P., "Economic Allocation of Spare Capacity in Mesh-Restorable Networks", Proceedings of the sixth International Conference on Telecommunication Systems, (1998), pp 77-86.
8. Stoer, M. and Dahl, G., "A polyhedral approach to multicommodity survivable network design", Numerische Mathematik 68, (1994), pp 149-167.
9. Ben-Ameur, W. and Pham, T.-T.-L., "Design of survivable networks based on end-to-end rerouting", Proceedings of the third International Workshop on Design of Reliable Communication Networks, Budapest, Hungary, (2001), pp 258-265.
10. Doucette, J. and Grover, W.D., "Influence of Modularity and Economy-of-Scale Effects on Design of Mesh-Restorable DWDM Networks", IEEE Journal on Selected Areas in Communications 18, (2000), pp 1912-1923.
11. Poppe, F. and Demeester, P., "An Integrated Approach to a Capacitated Survivable Network Design Problem", Proceedings of the fourth International Conference on Telecommunication Systems, (1996), pp 931-397.
12. Lutton, J.-L. and Geffard, J., "Dimensionnement de réseaux sécurisés", Proceedings of Francoro 2, Sousse, Tunisia, (1998).
13. Murakami, K. and Kim, S., "Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration", IEEE Transactions on Networking 6, (1998), pp 207-221.
14. Minoux, M., "Network synthesis and optimum network design problems: Models, solution methods and applications", Networks 19, (1989), pp 313-360.
15. Benders, J.F., "Partitioning procedures for solving mixed variables programming problems", Numerische Mathematik 4, (1962), pp 238-252.
16. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R. and Schrijver, A. "Combinatorial Optimization", Wiley Interscience Series in Discrete Mathematics and Optimization, (1998).
17. Nemhauser, G.L. and Wolsey, L.A., "Integer and Combinatorial Optimization", Wiley Interscience Series in Discrete Mathematics and Optimization, (1988).
18. Avis, D. "On the extreme rays of the metric cone", Canadian Journal of Mathematics XXXII, (1980), pp 126-144.
19. Deza, M. and Laurent, M. "Applications of cut polyhedra" Journal of Computational and Applied Mathematics 55, (1994), pp 191-216.
20. Lomonossov, M.V. "Combinatorial approaches to multiflows problems", Discrete Applied Mathematics 11, (1985), pp 1-93.
21. Iri, M., "On an Extension of the Maximum-Flow Minimum-Cut Theorem to Multicommodity Flows", Journal of the Operations Research Society of Japan 13, (1971), pp 129-135.
22. Onaga, K. and Kakusho, O., "On Feasibility Conditions of Multicommodity Flows in Networks", Transactions on Circuit Theory 4, (1971), pp 425-429.
23. Dijkstra, E.W. "A note on two problems in connexion with graphs", Numerische Mathematik 1, (1959), pp 269-271.