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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.