Abstract
The ever-growing Internet and the mounting evidence to the important role of circuit switching motivate the need for an accurate and scalable means for performance evaluation of large circuit switched networks. Previous work has shown that the Erlang Fixed Point Approximation (EFPA) achieves accurate results for such networks where the number of channels (circuits) per link is large. However, a conventional application of EFPA for large networks is computationally prohibitive. In cases where the EFPA solution is unattainable, we propose, in this paper, to use an asymptotic approximation, which we call A-EFPA, for the link blocking probability and demonstrate savings of many orders of magnitudes in computation time for blocking probability approximation in realistically sized networks with large number of circuits per link. We demonstrate for NSFNet and Internet2 accurate calculations of the blocking probability using simulations, EFPA and A-EFPA, where each of these three methods is used for a different range of parameter values. © 2012 IEEE.
Original language | English |
---|---|
Article number | 6317099 |
Pages (from-to) | 1892-1895 |
Journal | IEEE Communications Letters |
Volume | 16 |
Issue number | 11 |
DOIs | |
Publication status | Published - 2012 |
Research Keywords
- blocking probability
- circuit switched networks
- Erlang B formula
- Erlang fixed point approximation
Publisher's Copyright Statement
- COPYRIGHT TERMS OF DEPOSITED POSTPRINT FILE: © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Abramov, V., Li, S., Wang, M., Wong, E. W. M., & Zukerman, M. (2012). Computation of blocking probability for large circuit switched networks. IEEE Communications Letters, 16(11), 1892-1895. [6317099]. https://doi.org/10.1109/LCOMM.2012.092112.121557.