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
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
The Repacking Efficiency for Bandwidth Packing Problem
IEICE - Transactions on Information and Systems
Multi-hour network planning based on domination between sets of traffic matrices
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.