Abstract
Link weight is the essential parameter of OSPF, which is the most commonly used IP routing protocol. The problem of optimally setting link weights for unique-path OSPF routing is addressed. Existing methods solve the problem heuristically and generally result in local optima. In this paper, with the aim of finding a global optimal solution, two complete and explicit formulations with polynomial number of constraints are developed and mathematically proved equivalent. The two formulations are further compared on both model size and constraint structure for a proposed decomposition method to solve the problem.
This is a preview of subscription content, log in via an institution to check access.
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
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Ameur, W.B., Bourquia, N., Gourdin, E., Tolla, P.: Optimal Routing for Efficient Internet Networks. In: Proc. of ECUMN, pp. 10–17 (2002)
Ameur, W.B., Gourdin, E.: Internet Routing and Related Topology Issues. SIAM J. on Discrete Mathematics 17(1), 18–49 (2003)
Benders, J.: Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik 4, 238–252 (1962)
Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1992)
Black, U.: IP Routing Protocols: RIP, OSPF, BGP, PNNI and Cisco Routing Protocols. Prentice Hall, Englewood Cliffs (2000)
Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. J. of Combinatorial Optimization 6(3), 299–333 (2002)
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., True, F.: Deriving Traffic Demands for Operational IP Networks: Methodology and Experience. IEEE/ACM Transactions on Networking 9(3), 265–279 (2001)
Fortz, B., Thorup, M.: Internet Traffic Engineering by Optimizing OSPF Weights. In: Proc. of INFOCOM, pp. 519–528 (2000)
ILOG Inc.: ILOG CPLEX 6.5 User’s Manual (1999)
Imperial College London: ECLiPSe 5.7 Users Manual (2003)
Lin, F.Y.S., Wang, J.L.: Minimax Open Shortest Path First Routing Algorithms in Networks Supporting the SMDS Services. In: Proc. of ICC, vol. 2, pp. 666–670 (1993)
Moy, J.: OSPF Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1998)
Ouaja, W., Richards, B.: A Hybrid Multicommodity Routing Algorithm for Traffic Engineering. Networks 43(3), 125–140 (2004)
Ramakrishnan, K.G., Rodrigues, M.A.: Optimal Routing in Shortest-Path Data Network. Bell Labs Technical Journal, 117–138 (2001)
Wang, Y., Wang, Z.: Explicit Routing Algorithms for Internet Traffic Engineering. In: Proc. of ICCCN, pp. 582–588 (1999)
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
Zhang, C., Rodošek, R. (2005). Two Mathematically Equivalent Models of the Unique-Path OSPF Weight Setting Problem. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)