Article ID: | iaor20001041 |
Country: | Netherlands |
Volume: | 111 |
Issue: | 2 |
Start Page Number: | 393 |
End Page Number: | 404 |
Publication Date: | Dec 1998 |
Journal: | European Journal of Operational Research |
Authors: | Elmaghraby Salah E., Lo Shuzhi Z., Makrucki Brad A., Bilbro Griff L. |
Keywords: | programming: integer, communication |
Call admission control criteria are not only important for call admission control itself, but also can be an important input to network topological design. In this paper, we show the difference in terms of network cost incurred by adopting different call admission control schemes in network topological design. We compare two call admission control schemes. Scheme 1 uses equivalent bandwidth as its call admission control criterion and Scheme 2 is based on modeling the volatility of call traffic using Reflected Brownian Motion. Though Scheme 2 increases the complexity of network topological design, it can give lower network costs. Our experimental results show that for the same traffic mix, ther network cost can be as little as 10% and as much as 35% lower when Scheme 2 is used instead of Scheme 1. The differences between the pair of resulting networks suggests that network topological design can be used as one of the criteria for choosing the call admission control scheme.