期刊
NETWORKS
卷 77, 期 4, 页码 538-558出版社
WILEY
DOI: 10.1002/net.21999
关键词
integer programming; multicommodity flows; semi‐ stable routing; software defined networks; time‐ dependent traffic
资金
- National Science Centre, Poland [2017/25/B/ST7/02313]
In this paper, the focus is on optimizing routing in the network while considering limitations on the number of routing configurations that can be used. The proposed solution approach is based on routing cluster generation and provides a tight lower bound on the minimum of a selected objective function.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据