The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees

This paper deals with the multi-hour bandwidth packing problem in telecommunication networks. The problem consists of selecting calls from a list of requests with time varying traffic conditions to be routed on an arc-capacitated network in order to maximize profit. Response time to users is considered by specifying an upper limit on the queueing delay in the network. The paper represents a significant improvement over previous research by presenting a unified model of the problem that considers all possible paths for each call, allows the traffic requirements of the calls to vary over the busy-hours of the day and integrates quality of service to users. A mathematical programming formulation for the problem is presented. A Lagrangean relaxation based heuristic solution procedure is developed. The results of extensive computational experiments over a wide range of problem structures indicate that the procedure is both efficient and effective.

[1]  Christian Hofmann,et al.  Supplier's pricing policy in a Just-in-Time environment , 2000, Comput. Oper. Res..

[2]  Bezalel Gavish,et al.  Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..

[3]  Erik Rolland,et al.  Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures , 1999, Eur. J. Oper. Res..

[4]  Bezalel Gavish,et al.  On obtaining the 'best' multipliers for a lagrangean relaxation for integer programming , 1978, Comput. Oper. Res..

[5]  Mario Gerla,et al.  The design of store-and-forward (s/f) networks for computer communications , 1973 .

[6]  Jennifer Ryan,et al.  Path assignment for call routing: An application of tabu search , 1993, Ann. Oper. Res..

[7]  Mario Gerla,et al.  Topology design and bandwidth allocation in ATM nets , 1989, IEEE J. Sel. Areas Commun..

[8]  Erik Rolland,et al.  Queueing delay guarantees in bandwidth packing , 1999, Comput. Oper. Res..

[9]  Mario Gerla,et al.  Bandwidth allocation in ATM networks , 1994, Ann. Oper. Res..

[10]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[11]  M. Bazaraa,et al.  A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

[12]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[13]  Sungsoo Park,et al.  An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .

[14]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[15]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..