Abstract
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This is something which needs to be taken into account when searching for a set of paths that minimize capacity consumption.
In this paper, we discuss a new necessary condition that can be used during search to prune infeasible path systems. The condition can be expressed using linear inequalities, or used in constraint programming, where its simple definition is convenient for the efficient implementation of propagation. Experiments on networks from the SNDLib benchmark show that this condition has strong pruning capabilities.
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
Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, San Francisco (2004)
Rossi, F., Beek, P.v., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Pettersson, M.P., Szymanek, R., Kuchcinski, K.: A CP-LP approach to network management in OSPF routing. In: Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), Seoul, Korea, March 11-15, 2007, ACM Press, New York (to appear, 2007)
Tomaszewski, A., Pióro, M., Dzida, M., Zagożdżon, M.: Optimization of administrative weights in IP networks using the branch-and-cut approach. In: Proceedings of the Second International Network Optimization Conference (INOC 2005), Lisbon, March 2005, vol. 2, pp. 393–400 (2005)
Ben-Ameur, W., Gourdin, E.: Internet routing and related topology issues. SIAM J. Discrete Math. 17(1), 18–49 (2003)
Broström, P., Holmberg, K.: Determining the Non-Existence of a Compatible OSPF Metric. In: International Network Optimization Conference, INOC 2005, pp. 106–113 (2005)
Kuchcinski, K.: Constraints-driven scheduling and resource assignment. ACM Transactions on Design Automation of Electronic Systems (TODAES) 8(3), 355–383 (2003)
SNDlib 1.0–Survivable network design data library (2005), http://sndlib.zib.de
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pettersson, M.P., Kuchcinski, K. (2007). A New Necessary Condition for Shortest Path Routing. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-72709-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72708-8
Online ISBN: 978-3-540-72709-5
eBook Packages: Computer ScienceComputer Science (R0)