Paper Info
Title
A cutting plane approach to combinatorial bandwidth packing problem with queuing delays.
Abstract
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.
Year
DOI
Venue
2017
10.1007/s11590-016-1005-9
Optimization Letters
Keywords
Field
DocType
OR in telecommunications, Bandwidth packing, Integer programming, Queueing, Cutting plane algorithm
Integer,Cutting-plane method,Mathematical optimization,Telecommunications network,Packing problems,Computer science,Queueing theory,Integer programming,Bandwidth (signal processing),Piecewise
Journal
Volume
Issue
ISSN
11
1
1862-4480
Citations 
PageRank 
References 
1
0.37
11
Authors
3
Name
Order
Citations
PageRank
Sachin Jayaswal1263.52
Navneet Vidyarthi2544.86
Sagnik Das342.44