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.
| Original language | English |
|---|---|
| Pages (from-to) | 301-313 |
| Number of pages | 13 |
| Journal | Telecommunication Systems |
| Volume | 18 |
| Issue number | 4 |
| Publication status | Published - 2001 Dec 1 |
Fingerprint
Keywords
- ATM networks
- Capacity planning
- Integer programming
- Tabu search
ASJC Scopus subject areas
- Computer Networks and Communications
Cite this
An ATM switch capacity allocation problem. / Lee, Youngho; Kim, Seong In; Han, Junghee; Kang, Kugchang.
In: Telecommunication Systems, Vol. 18, No. 4, 01.12.2001, p. 301-313.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - An ATM switch capacity allocation problem
AU - Lee, Youngho
AU - Kim, Seong In
AU - Han, Junghee
AU - Kang, Kugchang
PY - 2001/12/1
Y1 - 2001/12/1
N2 - 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.
AB - 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.
KW - ATM networks
KW - Capacity planning
KW - Integer programming
KW - Tabu search
UR - http://www.scopus.com/inward/record.url?scp=27144503678&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27144503678&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:27144503678
VL - 18
SP - 301
EP - 313
JO - Telecommunication Systems
JF - Telecommunication Systems
SN - 1018-4864
IS - 4
ER -