Compact models for hop-constrained node survivable network design: An application to MPLS

Operations Research/ Computer Science Interfaces Series

Volumn 33, Issue , 2006, Pages 167-180

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

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF BEIRA INTERIOR   (Portugal)

^c INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

Author keywords

Hop constraints; MPLS; Network design; Survivability

Indexed keywords

EID: 84888593526     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-29234-9_9     Document Type: Article

References (17)

1. Balakrishnan, A., and Altinkemer, K. (1992), Using a Hop-constrained Model to Generate Alternative Communication Network Design, ORSA Journal on Computing, Vol 4, pp 192-205.
2. Balakrishnan, A., Magnanti, T.L., and Mirchandani, P., (2004), Connectivity-Splitting Models for Survivable Network Design, Networks, Vol 43, pp 10-27.
3. Ben-Ameur, W. (2000), Constrained Length Connectivity and Survivable Networks, Vol 36, pp 17-33.
4. Dahl, G. and Gouveia, L. (2004), On the Directed Hop-Constrained Shortest Path Problem, O.R. Letters, Vol 32, pp 15-22.
5. Gouveia, L. (1998), Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints, INFORMS Journal on Computing, Vol. 10, pp 180-188.
6. Gouveia, L., Patricio, P., de Sousa, A.F. and Valadas, R. (2003), MPLS over WDM Network Design with Packet Level QoS Constraints based on ILP Models, IEEE INFOCOM, Vol. 1, pp. 576-586.
7. Huygens, D., Mahjoub, A.R., and Pesneau, P. (2004), Two Edge-Disjoint Hop-Constrained Paths and Polyhedra Research Report LIMOS/RR 04-20 from LIMOS, Universita Blaise Pascal, Clermont-Ferrand, France, (to appear in SIAM Journal on Discrete Math).
8. Huygens, D., Labbe, M., Mahjoub, A.R., and Pesneau, P. (2004), Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut paper presented at Optimization 2004, Lisbon, July 1004.
9. LeBlanc, L., Chifflet, J., and Mahey, P. (1999), Packet Routing in Telecommunication Networks with Path and Flow Restrictions, INFORMS Journal on Computing, Vol. 11, pp 188-197.
10. Magnanti, T. and Raghavan, S. (1999), Strong Formulations for Network Design Problems with Connectivity Requirements, Working paper OR 332-99, Operations Research Center, MIT, April 1999.
11. Orlowski, S., and Wessaely, R. (2004), The Effect of Hop Limits on Optimal Cost in Survivable Network, ZIB-Report 04-23 (June 2004).
12. Parekh, A. and Gallager, R. (1994), A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case, IEEE/ACM Transactions on Networking, Vol. 2, No. 2, pp. 137-150.
13. Raghavan, S., (1995), Formulations and Algorithms for Network Design Problems with Connectivity Requirements, PhD Thesis, MIT, Cambridge.
14. Raghavan, S., and Magnanti, T. L., (1997), Network Connectivity, In M. Dell'Amico, F. Maffiolli and S. Martello, Eds., Annotated Bibliographies in Combinatorial Optimization, pp 335-354, John Wiley & Sons.
15. Stoer, M. (1992), Design of Survivable Networks, Lecture Notes in Mathematics, N° 1531, Springer Verlag.
16. Swallow, G. (1999), MPLS Advantages for Traffic Engineering, IEEE Communications Magazine, Vol. 37, No. 12, pp. 54-57.
17. Xiao, X., Hannan, A. and Bailey, B. (2000), Traffic Engineering with MPLS in the Internet, IEEE Network, Vol. 14, No. 2, pp. 28-33.