Abstract
In this paper, we consider a capacity allocation problem arising in the context of deploying asynchronous transfer mode (ATM) networks. Given types of ATM switches, the problem is to find an optimal allocation of capacity such that the total cost of installed switch modules is minimized, while satisfying all traffic demands. We formulate the problem as an integer programming model, which can be conceptualized as a generalized bin packing problem with capacity constraints. We then develop a surrogate constraint technique of the formulation for enhancing the representation of the model. Guided by the tight lower bound of the surrogate relaxation, we devise an effective tabu search heuristic that provides good quality solutions with guaranteed optimality. We present promising computational results that show the viability of the proposed heuristic and lower bounding methods, and that provide insights into implementation for configuring ATM switch in practice.
Similar content being viewed by others
References
K. Aardal, Reformulation of capacitated facility location problems: How redundant information can help, Annals of Operations Research 82 (1998) 289-308.
CPLEX Division, Using the CPLEX Callable Library, ILOG (1999).
F. Glover and M. Laguna, Tabu Search (Kluwer Academic, Boston, 1997).
M. Hung and J. Brown, An algorithm for a class of loading problems, Naval Research Logistics Quarterly 25 (1978) 289-297.
T. Kwok, ATM: The New Paradigm for Internet, Intranet and Residential Broadband Services and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1997).
R.T. Lewis and R.G. Parker, On a generalized bin-packing problem, Naval Research Logistics Quarterly 29 (1982) 119-145.
S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations (Wiley, Chichester, UK, 1990).
D. Medhi, Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks, IEEE/ACMTransactions on Networking 3 (1995) 809-818.
G. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
L.M. Robert, J.L. and S.P.M. Hoesel, Routing and capacity installation in ATM backbone networks, in: Proc. of INFORMS Telecommunications Conference, Florida, USA, 1998.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lee, Y., Kim, Si., Han, J. et al. An ATM Switch Capacity Allocation Problem. Telecommunication Systems 18, 301–313 (2001). https://doi.org/10.1023/A:1016724127118
Issue Date:
DOI: https://doi.org/10.1023/A:1016724127118