Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks

1 March 1995

journal article
general applied-probability
Published by Cambridge University Press (CUP) in Advances in Applied Probability

Vol. 27 (01) , 273-292
https://doi.org/10.1017/s0001867800046346

Abstract

In this paper we consider the analysis of call blocking at a single resource with differing capacity requirements as well as differing arrival rates and holding times. We include in our analysis trunk reservation parameters which provide an important mechanism for tuning the relative call blockings to desired levels. We base our work on an asymptotic regime where the resource is in heavy traffic. We further derive, from our asymptotic analysis. methods for the analysis of finite systems. Empirical results suggest that these methods perform well for a wide class of examples.

Keywords

This publication has 11 references indexed in Scilit:

A Simple Numerical Approach for Infinite-State Markov Chains
Probability in the Engineering and Informational Sciences, 1991
On blocking in loss networks
Advances in Applied Probability, 1991
Effective bandwidths for the multi-type UAS channel
Queueing Systems, 1991
Effective bandwidths at multi-class queues
Queueing Systems, 1991
Optimal Control and Trunk Reservation in Loss Networks
Probability in the Engineering and Informational Sciences, 1990
Resource allocation for broadband networks
IEEE Journal on Selected Areas in Communications, 1988
Congestion probabilities in a circuit-switched integrated services network
Performance Evaluation, 1987
Blocking probabilities in large circuit-switched networks
Advances in Applied Probability, 1986
Insensitivity of blocking probabilities in a circuit-switching network
Journal of Applied Probability, 1984
Blocking in a Shared Resource Environment
IEEE Transactions on Communications, 1981