Abstract
Link weight is the primary parameter of OSPF, the most commonly used IP routing protocol. The problem of setting link weights optimally for unique-path OSPF routing is addressed. A complete formulation with a polynomial number of constraints is introduced and is mathematically proved to model the problem correctly. An exact algorithm is thereby proposed to solve the problem based on the analysis of the hardness of problem constraints.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
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, 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 User’s 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 (January-June 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., Rodosek, R. (2005). Modelling and Constraint Hardness Characterisation of the Unique-Path OSPF Weight Setting Problem. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428831_100
Download citation
DOI: https://doi.org/10.1007/11428831_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26032-5
Online ISBN: 978-3-540-32111-8
eBook Packages: Computer ScienceComputer Science (R0)