Two mathematically equivalent models of the unique-path OSPF weight setting problem

Authors:
Changyong Zhang;Robert Rodošek
Affiliations:
IC-Parc, Imperial College London, London, United Kingdom;IC-Parc, Imperial College London, London, United Kingdom
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 6
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols

IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols
Deriving traffic demands for operational IP networks: methodology and experience

IEEE/ACM Transactions on Networking (TON)
OSPF: Anatomy of an Internet Routing Protocol

OSPF: Anatomy of an Internet Routing Protocol
Internet Routing and Related Topology Issues

SIAM Journal on Discrete Mathematics
A hybrid multicommodity routing algorithm for traffic engineering

Networks

Quantified Score

Hi-index	0.00

Visualization

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.