Hop-constrained node survivable network design: An application to MPLS over WDM

Networks and Spatial Economics

Volumn 8, Issue 1, 2008, Pages 3-21

  Gouveia, Luís ^a   Patrício, Pedro ^b   de Sousa, Amaro ^c  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF BEIRA INTERIOR   (Portugal)

^c UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

Hop constraints; MPLS over WDM network design; Survivability

Indexed keywords

HOP-CONSTRAINTS; INTEGER LINEAR PROGRAMMING MODELS; MULTI PROTOCOL LABEL SWITCHING; PATH PROTECTION MECHANISM; SURVIVABILITY; TELECOMMUNICATIONS NETWORKS; WAVELENGTH DIVISION MULTIPLEXING NETWORKS; WDM NETWORKS;

COSTS; INTEGER PROGRAMMING; TELECOMMUNICATION; WAVELENGTH DIVISION MULTIPLEXING;

DESIGN;

EID: 38649089178     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-007-9038-3     Document Type: Conference Paper

References (19)

1. Balakrishnan A, Altinkemer K (1992) Using a hop-constrained model to generate alternative communication network design. ORSA J Comput 4(1):92-205
2. Balakrishnan A, Magnanti TL, Mirchandani P (2004) Connectivity-splitting models for survivable network design. Networks 43:10-27
3. Borne S, Gourdin E, Liau B, Mahjoub AR (2006) Design of survivable IP-over-optical networks. Ann Oper Res 146(1):41-73
4. Gouveia L (1998) Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J Comput 10:180-188
5. Gouveia L, Patrício P, de Sousa A, Valadas R (2003) MPLS over WDM network design with packet level QoS constraints based on ILP models. In: Proc of IEEE INFOCOM, San Francisco, April, 2003
6. Gouveia L, Patrício PF, Sousa AF (2006) Compact models for hop-constrained node survivable network design. In: Anandaligam G, Raghavan S (eds) Telecommunications network planning: Innovations in pricing, network design and management. Springer, Berlin Heidelberg New York, pp 167-180
7. Huygens D, Mahjoub AR, Pesneau P (2005) Two edge-disjoint hop-constrained paths and polyhedra. SIAM J Discrete Math 18(2):287-312
8. Huygens D, Labbé M, Mahjoub AR, Pesneau, P (2004) Two edge-disjoint hop-constrained paths: Valid inequalities and branch-and-cut. Paper presented at Optimization 2004, Lisbon, 2004
9. Koster A, Zymolka A, Jager M, Hulsermann R (2005) Demand-wise shared protection for meshed optical networks. J Netw Syst Manag 13(1):35-55
10. LeBlanc L, Chifflet J, Mahey P (1999) Packet routing in telecommunication networks with path and flow restrictions. INFORMS J Comput 11:188-197
11. Magnanti T, Raghavan S (2005) Strong formulations for network design problems with connectivity requirements. Networks 45(2):61-79
12. Magnanti TL, Mirchandani P, Vachani R (1995) Modeling and solving the two-facility capacitated network loading problem. Oper Res 43:142-157
13. Mannie E (2004) Generalized multi-protocol label switching (GMPLS) architecture. RFC 3945. Internet Engineering Task Force, Sterling
14. Orlowski S, Wessaely R (2006) The effect of hop limits on optimal cost in survivable network. In: Anandaligam G, Raghavan S (eds) Telecommunications network planning: Innovations in pricing, network design and management. Springer, Berlin Heidelberg New York, pp 151-166
15. Raghavan S (1995) Formulations and algorithms for network design problems with connectivity requirements. Ph.D thesis, MIT, Cambridge
16. Raghavan S, Magnanti TL (1997) Network connectivity. In: Dell'Amico M, Maffiolli F, Martello S, (eds.) Annotated bibliographies in combinatorial optimization. Wiley, New York, pp 335-354
17. Ramaswami R, Sivarajan KN (2002) Optical networks: A practical perspective, 2nd edn. Morgan-Kaufmann, San Mateo
18. Sharma V, Hellstrand F (2003) Framework for multi-protocol label switching (MPLS)-based recovery. RFC 3469. Internet Engineering Task Force, Sterling
19. Stoer M (1992) Design of survivable networks. Lecture notes in mathematics, No. 1531, Springer, Berlin Heidelberg New York