Abstract
In this paper we discuss compact models for a hop-constrained node survivable network design problem. We discuss two models involving one set of variables associated to each path between each pair of demand nodes (a standard network flow model with additional cardinality constraints and a model with hop-indexed variables) and a third model involving one single set of hop-indexed variables for each demand pair. We show that the aggregated more compact hop-indexed model produces the same linear programming bound as the multi-path hop-indexed model. This work is given in the context of the following MPLS network design problem. Given the location of edge nodes, the candidate locations of core nodes and the pairs of locations that can be physically connected, the MPLS network design problem addressed in this paper is the determination of the physical network topology, i.e., the location of core nodes and the connections required between all nodes. The aim of the design task is to determine the least cost network. The physical network must support routing paths between all pairs of edge nodes fulfilling two types of path constraints. The first type is a MPLS hop constraint on the maximum number of edges traversed by each routing path, which guarantees a given packet level quality of service (QoS). The second type is the fault-tolerance constraint. An important component of providing QoS is the service reliability and a fault-tolerance scheme must be present in the network to deal efficiently with failure scenarios. We present computational results, taken from graphs with up to 50 nodes and slightly more than 400 edges.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Balakrishnan, A., Magnanti, T.L., and Mirchandani, P., (2004), “Connectivity-Splitting Models for Survivable Network Design”, Networks, Vol 43, pp 10–27.
Ben-Ameur, W. (2000), “Constrained Length Connectivity and Survivable Networks”, Vol 36, pp 17–33.
Dahl, G. and Gouveia, L. (2004), “On the Directed Hop-Constrained Shortest Path Problem”, O.R. Letters, Vol 32, pp 15–22.
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.
Gouveia, L., Patrício, 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.
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, Université Blaise Pascal, Clermont-Ferrand, France, (to appear in SIAM Journal on Discrete Math).
Huygens, D., Labbé, 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.
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.
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.
Orlowski, S., and Wessaely, R. (2004), “The Effect of Hop Limits on Optimal Cost in Survivable Network”, ZIB-Report 04-23 (June 2004).
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.
Raghavan, S., (1995), “Formulations and Algorithms for Network Design Problems with Connectivity Requirements”, PhD Thesis, MIT, Cambridge.
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.
Stoer, M. (1992), “Design of Survivable Networks”, Lecture Notes in Mathematics, No 1531, Springer Verlag.
Swallow, G. (1999), “MPLS Advantages for Traffic Engineering”, IEEE Communications Magazine, Vol. 37, No. 12, pp. 54–57.
Xiao, X., Hannan, A. and Bailey, B. (2000), “Traffic Engineering with MPLS in the Intemef”, IEEE Network, Vol. 14, No. 2, pp. 28–33.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Gouveia, L., Patrício, P., de Sousa, A. (2006). Compact Models for Hop-Constrained Node Survivable Network Design: An Application to MPLS. In: Raghavan, S., Anandalingam, G. (eds) Telecommunications Planning: Innovations in Pricing, Network Design and Management. Operations Research/Computer Science Interfaces Series, vol 33. Springer, Boston, MA. https://doi.org/10.1007/0-387-29234-9_9
Download citation
DOI: https://doi.org/10.1007/0-387-29234-9_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-29222-9
Online ISBN: 978-0-387-29234-2
eBook Packages: Business and EconomicsBusiness and Management (R0)