Ideally, the network should be dynamically reconfigured as traffic evolves. Yet, even within the software defined network paradigm, network reconfigurations cannot be too frequent due to a number of reasons related to route consistency, forwarding rules instantiation, individual flows dynamics, traffic monitoring overhead, and so on. In this paper, we focus on the fundamental issue of deciding whether, when, and how to reconfigure the network while traffic evolves. We consider a problem of optimizing semi‐stable routing in the capacitated multicommodity flow network when one may use at most a given maximum number of routing configurations (called routing clusters) and when each routing configuration must be used for at least a given minimum amount of time. We propose an efficient solution approach based on routing cluster generation that provides a tight lower bound on the minimum of a selected objective function (like maximum link delay or a sum of link delays) and suboptimal solutions very close to the calculated bound. The approach scales well with the size of the network.

中文翻译：

---

一种优化多商品流网络中半稳定路由的有效方法

理想情况下，应该随着流量的发展动态地重新配置网络。但是，即使在软件定义的网络范例中，由于与路由一致性，转发规则实例化，单个流动态，流量监视开销等相关的多种原因，网络重新配置也不会太频繁。在本文中，我们关注于确定在流量变化时是否，何时以及如何重新配置​​网络的基本问题。当一个容量最多可以使用给定最大数量的路由配置（称为路由群集），并且每个路由配置必须至少用于给定的最小数量的路由配置时，我们考虑优化带电容的多商品流网络中的半稳定路由的问题。时间。我们提出了一种基于路由簇生成的有效解决方案方法，该方法在选定目标函数的最小值（例如最大链路延迟或链路延迟之和）的最小值上提供了严格的下限，并且非常接近所计算的边界的次优解决方案。该方法可以随着网络规模的扩展而很好地扩展。