A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths

Authors:
Farid Ajili;Robert Rodošek;Andrew Eremin
Affiliations:
Imperial College London, London, UK;Imperial College London, London, UK;Imperial College London, London, UK
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 9
Cited 2

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
MPLS: technology and applications

MPLS: technology and applications
Traffic Engineering with MPLS

Traffic Engineering with MPLS
Internet Routing and Related Topology Issues

SIAM Journal on Discrete Mathematics
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research
Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)

Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)
A hybrid multicommodity routing algorithm for traffic engineering

Networks
Traffic engineering with traditional IP routing protocols

IEEE Communications Magazine

A CP-LP approach to network management in OSPF routing

Proceedings of the 2007 ACM symposium on Applied computing
Constraint based resilience analysis

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

An Interior Gateway Protocol (IGP) routes Internet end-to-end traffic via the shortest paths according to a set of IGP weights assigned to the network links. These weights, which can be re-set by the administrator, uniquely determine the traffic routes and thus the network performance. Assigning and provisioning the IGP weights incurring the minimum network congestion, is a common practice in Traffic Engineering. Motivated by an application, this paper considers the problem of optimizing the IGP weights so that the shortest paths are unique in the network. Despite its relevance in the telecoms sector, the problem poses considerable modelling and optimization challenges which have yet to be addressed. We develop a constraint model for the problem, and show that even small instances are too difficult for traditional optimization approaches. Our main contribution is a new hybrid optimizer that combines constraint programming and cut/column generation in order to exploit the model structure. Our optimizer succeeds in solving most of a set of realistically sized benchmarks.