Blocking probability estimation for trunk reservation networks

Garvesh Raskutti; Andrew Zalesky; Eric W. M. Wong; Moshe Zukerman

doi:10.1109/ICC.2007.45

Blocking probability estimation for trunk reservation networks

Garvesh Raskutti^*
, Andrew Zalesky
, Eric W. M. Wong
, Moshe Zukerman

^*Corresponding author for this work

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

4 Citations (Scopus)

Abstract

In this paper, we consider the problem of estimating steady-state blocking probability for circuit-switched networks with alternate routing. In particular, we focus on networks protected by trunk reservation. A new blocking probability estimate, the so-called Overflow Priority Classification Approximation (OPCA), is considered as an alternative to the currently used the Erlang Fixed-Point Approximation (EFPA). OPCA is applied to the case of arbitrary circuit-switched networks with trunk reservation. We show through empirical results that OPCA yields a superior estimate for blocking probability compared to EFPA for circuit-switched networks with alternate routing that are reasonably protected against instability by trunk reservation. © 2007 Crown Copyright.

Original language	English
Title of host publication	IEEE International Conference on Communications
Pages	223-228
DOIs	https://doi.org/10.1109/ICC.2007.45
Publication status	Published - 2007
Event	2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom Duration: 24 Jun 2007 → 28 Jun 2007

Publication series

Name
ISSN (Print)	0536-1486

Conference

Conference	2007 IEEE International Conference on Communications, ICC'07
Place	United Kingdom
City	Glasgow, Scotland
Period	24/06/07 → 28/06/07

Access Output

10.1109/ICC.2007.45

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{3f6c6608197a48b398e880bcd548b3f1,

title = "Blocking probability estimation for trunk reservation networks",

abstract = "In this paper, we consider the problem of estimating steady-state blocking probability for circuit-switched networks with alternate routing. In particular, we focus on networks protected by trunk reservation. A new blocking probability estimate, the so-called Overflow Priority Classification Approximation (OPCA), is considered as an alternative to the currently used the Erlang Fixed-Point Approximation (EFPA). OPCA is applied to the case of arbitrary circuit-switched networks with trunk reservation. We show through empirical results that OPCA yields a superior estimate for blocking probability compared to EFPA for circuit-switched networks with alternate routing that are reasonably protected against instability by trunk reservation. {\textcopyright} 2007 Crown Copyright.",

author = "Garvesh Raskutti and Andrew Zalesky and Wong, \{Eric W. M.\} and Moshe Zukerman",

year = "2007",

doi = "10.1109/ICC.2007.45",

language = "English",

isbn = "1424403537",

pages = "223--228",

booktitle = "IEEE International Conference on Communications",

note = "2007 IEEE International Conference on Communications, ICC'07 ; Conference date: 24-06-2007 Through 28-06-2007",

}

TY - GEN

T1 - Blocking probability estimation for trunk reservation networks

AU - Raskutti, Garvesh

AU - Zalesky, Andrew

AU - Wong, Eric W. M.

AU - Zukerman, Moshe

PY - 2007

Y1 - 2007

N2 - In this paper, we consider the problem of estimating steady-state blocking probability for circuit-switched networks with alternate routing. In particular, we focus on networks protected by trunk reservation. A new blocking probability estimate, the so-called Overflow Priority Classification Approximation (OPCA), is considered as an alternative to the currently used the Erlang Fixed-Point Approximation (EFPA). OPCA is applied to the case of arbitrary circuit-switched networks with trunk reservation. We show through empirical results that OPCA yields a superior estimate for blocking probability compared to EFPA for circuit-switched networks with alternate routing that are reasonably protected against instability by trunk reservation. © 2007 Crown Copyright.

AB - In this paper, we consider the problem of estimating steady-state blocking probability for circuit-switched networks with alternate routing. In particular, we focus on networks protected by trunk reservation. A new blocking probability estimate, the so-called Overflow Priority Classification Approximation (OPCA), is considered as an alternative to the currently used the Erlang Fixed-Point Approximation (EFPA). OPCA is applied to the case of arbitrary circuit-switched networks with trunk reservation. We show through empirical results that OPCA yields a superior estimate for blocking probability compared to EFPA for circuit-switched networks with alternate routing that are reasonably protected against instability by trunk reservation. © 2007 Crown Copyright.

UR - https://www.scopus.com/pages/publications/38549084051

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-38549084051&origin=recordpage

U2 - 10.1109/ICC.2007.45

DO - 10.1109/ICC.2007.45

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1424403537

SN - 9781424403530

SP - 223

EP - 228

BT - IEEE International Conference on Communications

T2 - 2007 IEEE International Conference on Communications, ICC'07

Y2 - 24 June 2007 through 28 June 2007

ER -

Blocking probability estimation for trunk reservation networks

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this