A CP-LP approach to network management in OSPF routing

Authors:
Mats Petter Pettersson;Radosław Szymanek;Krzysztof Kuchcinski
Affiliations:
Lund University, Sweden;University College Cork, Ireland;Lund University, Sweden
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 8
Cited 2

Resource Allocation and Constraint Satisfaction Techniques

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Robust and Parallel Solving of a Network Design Problem

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraints-driven scheduling and resource assignment

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Internet Routing and Related Topology Issues

SIAM Journal on Discrete Mathematics
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths

Proceedings of the 2005 ACM symposium on Applied computing
Enforcing path uniqueness in internet routing

Proceedings of the 2006 ACM symposium on Applied computing
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

A new necessary condition for shortest path routing

NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
A combined CLP-MILP approach for scheduling commodities in a pipeline

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a routing problem related to the widely used Open Shortest Path First (OSPF) protocol, which is considered a challenge within the Constraint Programming (CP) community. We address the special version of OSPF which requires unique and symmetrical paths. To solve this problem, we propose a novel hybrid approach which combines CP and Linear Programming (LP). Our approach employs a new global constraint with problem-specific filtering algorithms to efficiently remove inconsistent values from partial solutions. Moreover, this constraint employs two LP relaxations which are used to indicate in-feasible partial solutions due either to network capacity constraints, or to protocol-specific routing constraints. We show the efficiency of our complete approach on backbone networks with hundreds of different demands to route.