A new method for approximating blocking probability in overflow loss networks

Authors:
Eric W. M. Wong;Andrew Zalesky;Zvi Rosberg;Moshe Zukerman
Affiliations:
Department of Electronic Engineering, City University of Hong Kong, Hong Kong SAR, China;ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, Vic. 3010, Australia;CSIRO ICT Centre, PO BOX 76, Epping NSW 1710, Sydney, Australia;ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, Vic. 3010, Australia
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 7
Cited 2

Computing approximate blocking probabilities for large loss networks with state-dependent routing

IEEE/ACM Transactions on Networking (TON)
ATM network design and optimization: a multirate loss network framework

IEEE/ACM Transactions on Networking (TON)
Analysis of rerouting in circuit-switched networks

IEEE/ACM Transactions on Networking (TON)
Routing and Dimensioning in Circuit-Switched Networks

Routing and Dimensioning in Circuit-Switched Networks
A taxonomy of rerouting in circuit-switched networks

IEEE Communications Magazine
Interactive video on demand

IEEE Communications Magazine
Performance analyses of optical burst-switching networks

IEEE Journal on Selected Areas in Communications

Blocking probability evaluation of end-to-end dynamic WDM networks

Photonic Network Communications
A novel approach for the performance bound of QoS-aware data networks under greedy CAC policy

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new approximation for estimating blocking probability in overflow loss networks and systems. Given a system for which an estimate of blocking probability is sought, we first construct a second system to act as a surrogate for the original system. Estimating blocking probability in the second system with Erlang's fixed point approximation (EFPA) provides a better estimate for blocking probability in the original system than if we were to use the conventional approach of directly using EFPA in the original system. We present a combination of numerical and theoretical results that indicate our new approximation offers a better estimate than EFPA for a certain pure overflow loss network. Moreover, we demonstrate the accuracy of our new approximation for circuit-switched networks using alternative routing. We argue that the success of our new approximation is due to its ability to utilize congestion information imbedded in overflow traffic, whereas the conventional approach fails to utilize such information.