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.

中文翻译：

---

用于在SDN中稳定，优化分配需求的约束游戏

软件定义网络（SDN）允许对通勤者网络进行集中控制，以提供更好的全局性能。要解决的问题之一是多商品流路由，其中​​必须以最小的成本路由一组需求。与该问题的其他版本相比，我们在此考虑拥塞问题，这些问题会根据所使用的容量来改变链路的成本。我们在这里建议使用约束编程和列生成方法研究集中式路由。此外，通过Constraint Games研究自私路由。自私的路由对于解决方案的感知质量非常重要，因为没有用户能够通过仅更改自己的路径来提高成本。我们提供了真实和综合的基准，这些基准显示出良好的可伸缩性。