Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

A CP-LP approach to network management in OSPF routing

In English

Författare

  • Mats Petter Wallander
  • Radoslaw Szymanek
  • Krzysztof Kuchcinski

Summary, in English

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.

Publiceringsår

2007

Språk

Engelska

Publikation/Tidskrift/Serie

Proceedings of the ACM Symposium on Applied Computing

Dokumenttyp

Konferensbidrag

Förlag

Association for Computing Machinery (ACM)

Ämne

  • Computer Science

Conference name

ACM Symposium on Applied Computing

Conference date

2007-03-11 - 2007-03-15

Status

Published

Forskningsgrupp

  • ESDLAB