Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problem

Authors:
Changyong Zhang;Robert Rodosek
Affiliations:
IC-Parc, Imperial College London, London, United Kingdom;IC-Parc, Imperial College London, London, United Kingdom
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
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 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.