Constraint Games for stable and optimal allocation of demands in SDN

Abstract : Software Defined Networking (or SDN) allows to apply a centralized control over a network of commuters in order to provide better global performances. One of the problem to solve is the multicommodity flow routing where a set of demands have to be routed at minimum cost. In contrast with other versions of this problem, we consider here problems with congestion that change the cost of a link according to the capacity used. We propose here to study centralized routing with Constraint Programming and Column Generation approaches. Furthermore, selfish routing is studied through with Constraint Games. Selfish routing is important for the perceived quality of the solution since no user is able to improve his cost by changing only his own path. We present real and synthetic benchmarks that show a good scalability.
Complete list of metadatas

Cited literature [54 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02114831
Contributor : Anthony Palmieri <>
Submitted on : Monday, April 29, 2019 - 10:56:06 PM
Last modification on : Thursday, October 17, 2019 - 8:56:11 AM

File

2018___Constraint_journal_2018...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02114831, version 1

Citation

Anthony Palmieri, Arnaud Lallouet, Luc Pons. Constraint Games for stable and optimal allocation of demands in SDN. 2019. ⟨hal-02114831⟩

Share

Metrics

Record views

58

Files downloads

74