Bandwidth calendaring: Dynamic services scheduling over Software Defined Networks
Bandwidth calendaring: Dynamic services scheduling over Software Defined Networks
复制标题
带宽日历：软件定义网络上的动态服务调度
DOI：
10.1109/icc.2016.7510888
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
S. Chouvardas
中科院分区：
文献类型：
--
作者：
Lazaros Gkatzikis;Stefano Paris;Ioannis Steiakogiannakis;S. Chouvardas
软件定义的网络实现了集中的网络控制，从而为更有效地利用网络资源的新服务铺平了道路。带宽日历(BWC)就是一个典型的这样的例子，它利用对未来的了解来最佳地打包网络上不断产生的需求。在本文中，我们考虑了一个通用的BWC实例，其中运营商网络运营商必须以最小的成本满足预定的、但随时间变化的带宽需求。一些需求可以是灵活的，即可以在特定的时间窗口内调度。我们证明了所得到的问题是NP难的，并提出了一种基于列生成的可伸缩问题分解。数值结果表明，该方法是接近最优的，在网络开销方面比现有的基于松弛和随机舍入的方法高出20%以上。
Software Defined Networking enables centralized network control and hence paves the way for new services that use network resources more efficiently. Bandwidth Calendaring (BWC) is a typical such example that exploits the knowledge of future to optimally pack the arising demands over the network. In this paper, we consider a generic BWC instance, where a carrier network operator has to accommodate at minimum cost demands of predetermined, but time-varying, bandwidth requirements. Some of the demands may be flexible, i.e., can be scheduled within a specific time window. We demonstrate that the resulting problem is NP-hard and we propose a scalable problem decomposition based on column generation. Our numerical results reveal that the proposed solution approach is near-optimal and outperforms state-of-the art methods based on relaxation and randomized rounding by more than 20% in terms of network cost.