A cutting plane approach to combinatorial bandwidth packing problem with queuing delays

详细信息    查看全文

• 作者：Sachin Jayaswal ; Navneet Vidyarthi ; Sagnik Das
• 关键词：OR in telecommunications ; Bandwidth packing ; Integer programming ; Queueing ; Cutting plane algorithm
• 刊名：Optimization Letters
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：11
• 期：1
• 页码：225-239
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Optimization; Operation Research/Decision Theory; Computational Intelligence; Numerical and Computational Physics, Simulation;
• 出版者：Springer Berlin Heidelberg
• ISSN：1862-4480
• 卷排序：11

文摘

The combinatorial bandwidth packing problem (CBPP), arising in a telecommunication network with limited bandwidth, is defined as follows. Given a set of requests, each with its potential revenue, and each consisting of calls with their bandwidth requirements, decide: (1) a subset of the requests to accept/reject; and (2) a route for each call in accepted requests, so as to maximize the total revenue earned in a telecommunication network with limited bandwidth. However, telecommunication networks are generally characterized by variability in the call (bits) arrival rates and service times, resulting in queuing delays in the network. In this paper, we present a non-linear integer programming model to account for such delays in CBPP. Using simple transformation and piecewise outer-approximation, we reformulate the model as a linear mixed integer program (MIP), but with a large number of constraints. We present an efficient cutting plane approach to solve the resulting linear MIP to \(\epsilon \)-optimality.