Constraint Games for stable and optimal allocation of demands in SDN - GREYC codag Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Constraint Games for stable and optimal allocation of demands in SDN

Résumé

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.
Fichier principal
Vignette du fichier
2018___Constraint_journal_2018___SDN_games (1).pdf (1.49 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02114831 , version 1 (29-04-2019)

Identifiants

  • HAL Id : hal-02114831 , version 1

Citer

Anthony Palmieri, Arnaud Lallouet, Luc Pons. Constraint Games for stable and optimal allocation of demands in SDN. 2019. ⟨hal-02114831⟩
127 Consultations
176 Téléchargements

Partager

Gmail Facebook X LinkedIn More