An Efficient Solution Approach for Combinatorial Bandwidth Packing Problem with Queuing Delays

Sachin Jayaswal, Navneet Vidyarthi and Sagnik Das

No WP2014-12-05, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: The Combinatorial bandwidth packing problem (CBPP), arising in a telecommunication network with limited bandwidth, is defined as: given a set of request, each with its potential revenue and consisting of calls with their bandwidth requirements, deciding (i) a subset of the requests to accept/reject, and (ii) a route for each call in an accepted request, so as to maximize total revenue earned. However, telecommunication networks are generally characterized by variability in the call (bits) arrival rates and service times, resulting in delays in the network. In this paper, we present a non-linear integer programming model for CBPP accounting for such delays. By using simple transformation and piecewise outer-approximation, we linearize the model, and present an efficient cutting plane based approach to solve the resulting linear mixed integer program to optimality.

Date: 2014-12-15
New Economics Papers: this item is included in nep-pay
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/14998504692014-12-05.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:13113

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().