Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees

Authors:
Jinil Han;Kyungsik Lee;Chungmok Lee;Sungsoo Park
Affiliations:
RealOpt team, INRIA Bordeaux - Sud-Ouest, 33405 Talence, France/ and Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon 305-701, Republic ...;Department of Industrial and Management Engineering, Hankuk University of Foreign Studies, Gyeonggi-do 449-791, Republic of Korea;IT Convergence Technology Research Laboratory, Daejeon 305-700, Republic of Korea;Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon 305-701, Republic of Korea
Venue:
INFORMS Journal on Computing
Year:
2013

Citing 10
Cited 0

Bandwidth packing: a tabu search approach

Management Science
Path assignment for call routing: an application of tabu search

Annals of Operations Research - Special issue on Tabu search
An integer programming approach to the bandwidth packing problem

Management Science
Queueing delay guarantees in bandwidth packing

Computers and Operations Research
The multi-hour bandwidth packing problem

Computers and Operations Research
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research
Dual-Optimal Inequalities for Stabilized Column Generation

Operations Research
SNDlib 1.0—Survivable Network Design Library

Networks - Network Optimization (INOC 2007)
Exact solution of a class of nonlinear knapsack problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bandwidth packing problem BWP concerns the selection of calls from a given set and the assignment of one path to each selected call. The ultimate aim of the BWP is to maximize profit while the routings of the selected calls observe the capacity constraints of the links. Here, we additionally consider queueing delays in the network, which may cause a deterioration in the quality of service to users if they exceed the acceptable limits. The integer programming formulation for the BWP with the queueing delay restriction contains a nonlinear constraint that is intrinsic to the model. We apply the Dantzig-Wolfe decomposition to this nonlinear constraint, and since the Dantzig-Wolfe decomposition has exponentially many variables, we propose the branch-and-price procedure to find optimal solutions. We also propose a generalized Dantzig-Wolfe reformulation based on the aggregation of variables, which makes our branch-and-price algorithm more competitive. Computational results on cases of randomly generated networks and some real-life telecommunication networks demonstrate that our algorithm performs well for large networks.