Bandwidth packing problem with queueing delays: modelling and exact solution approach
We present a more generalized model for the bandwidth packing problem with queuing delays under congestion than available in the extant literature. The problem, under Poison call arrivals and general service times, is set up as a network of spatially distributed independent M/G/1 queues. We further present two exact solution approaches to solve the resulting nonlinear integer programming model. The first method, called finite linearization method, is a conventional Big-M based linearization, resulting in a finite number of constraints, and hence can be solved using an off-the-shelve MIP solver. The second method, called constraint generation method, is based on approximating the non-linear delay terms using supporting hyperplanes, which are generated as needed. Based on our computational study, the constraint generation method outperforms the finite linearization method. Further comparisons of results of our proposed constraint generation method with the Lagrangean relaxation based solution method reported in the literature for the special case of exponential service times clearly demonstrate that our approach outperforms the latter, both in terms of the quality of solution and computation times.
KeywordsBandwidth packing Telecommunications Call routing Integer programming Queuing delay Finite linearization Constraint generation
- 8.Cox, L., Davis, L., Qui, Y.: Dynamic anticipatory routing in circuit-switched telecommunications networks. In: Davis, L. (ed.) Handbook of Genetic Algorithms, vol. 11, pp. 229–340. Van Norstrand/Reinhold, New York (1991)Google Scholar