Abstract
This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap are very large, we then apply a Benders decomposition to isolate the failure case capacity constraints, related linearisation variables and linearisation constraints.
The disaggregated Benders cuts are generated, which is actually the set of violated failure case capacity constraints with their linearisation variables and the required linearisation constraints. This corresponds to adding the failure case capacity constraints, their linearisation variables and linearisation constraints only as they are needed.
Some results on generated test cases for different network topologies are given. In comparison with the standard MILP formulation, we reduce execution times on average by a factor of 1000 using the Benders decomposition. We also compare with a scheme of accepting demands one-by-one, which can handle more large-scale problems at the cost of loosing optimality.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Awduche, D., et al.: Requirements for Traffic Engineering over MPLS. Internet Draft - draft-ietf-mpls-traffic-eng.00.txt (1998)
Cisco Inc., MPLS Bandwidth Protection, White Paper (2001)
Papadakos, N.P.: Optimising Network Utilisation with Backup Routes. M.Sc. Thesis, Imperial College London (2002)
ILOG Inc., ILOG CPLEX 6.5 User’s Manual (1999)
Benders, J.F.: Partitioning Procedures for Solving Mixed Variables Programming Problems. Numerische Mathematik 4, 238–252 (1962)
Pataki, G.: Teaching Integer Programming Formulation Using the Travelling Salesman Problem. SIAM Review 45(1) (2003)
Imperial College London, ECLiPSe 5.6 User’s Manual (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, Q., Simonis, H. (2005). Primary/Secondary Path Generation Problem: Reformulation, Solutions and Comparisons. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_72
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)