scispace - formally typeset
Journal ArticleDOI

Erlang capacity and uniform approximations for shared unbuffered resources

Debasis Mitra, +1 more
- 01 Dec 1994 - 
- Vol. 2, Iss: 6, pp 558-570
Reads0
Chats0
TLDR
A basic teletraffic model which has applications to integrated multirate services on ATM and wireless systems, and a uniform asymptotic approximation (UAA) for the blocking probabilities, which is uniformly effective for the complete range of loadings, simple to calculate and gives accurate results even for relatively small systems.
Abstract
We consider a basic teletraffic model, which has applications to integrated multirate services on ATM and wireless systems. In the "finite-sources" version of the model an unbuffered resource with C channels is shared by heterogeneous sources which alternate between arbitrarily distributed random periods in the on and off states, and in the on state require a fixed number of channels. If a source does not find enough free channels when it turns on, then it is blocked and the burst is lost. In the "infinite-sources" version of the model requests for connections form Poisson streams and connections hold fixed numbers of channels for random periods. The stationary distribution of the system has the product-form and the insensitivity property. Our main results for the finite-sources model are for the asymptotic scaling in which C and the number of sources of each type are large. The central result is a uniform asymptotic approximation (UAA) for the blocking probabilities. It is uniformly effective for the complete range of loadings, simple to calculate and gives accurate results even for relatively small systems. The UAA is also specialized to the overloaded, critical and underloaded regimes. For the admission control of the system we calculate its Erlang capacity, i.e., the set of combinations of sources of various types such that the blocking probabilities for all types do not exceed specified values. For the first two regimes we obtain the boundaries of the admissible sets in the form of hyperplanes, and thus the effective bandwidths of sources of each type. For the underloaded regime the boundary is nonlinear and we obtain a convenient parameterized characterization. Finally, various numerical results are presented. >

read more

Citations
More filters
Journal ArticleDOI

A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node

TL;DR: A new approach to determining the admissibility of variable bit rate (VBR) traffic in buffered digital networks is developed, and the boundary of the set of admissible traffic sources is found to be sufficiently linear that an effective bandwidth can be meaningfully assigned to each VBR source.
Journal ArticleDOI

Effective bandwidth-based admission control for multiservice CDMA cellular networks

TL;DR: In this paper, the authors developed product form traffic models for single and multiple-cell code-division multiple access (CDMA) networks with multiple classes of mobile subscribers, and the key feature of this development is the specification of a flexible call admission control procedure that details the numbers of mobiles of each class in each cell that the system operator should allow in order to maintain an acceptable QoS.
Journal ArticleDOI

A Diffusion Approximation for a Markovian Queue with Reneging

TL;DR: A single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time can be approximated by either a reflected Ornstein–Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate.
Journal ArticleDOI

Performance evaluation of a new technique for IP support in a WDM optical network: optical composite burst switching (OCBS)

TL;DR: In this article, the optical composite burst switching (OCBS) technique is proposed to implement in an all-optical backbone network to support Internet protocol (LP) traffic, where several IP packets are assembled in a single macropacket, called burst.
Journal ArticleDOI

Efficiently providing multiple grades of service with protection against overloads in shared resources

TL;DR: Analysis is made possible by a new algorithm for computing blocking probabilities based on numerical transform inversion, which achieves effective separation with sharing and can be efficiently enforced and analyzed.
References
More filters
Book

Theory of Functions of a Complex Variable

TL;DR: In this paper, the Laurent series is used for expanding functions in Taylor series, and the calculus of residues is used to expand functions in Laurent series volumes II, III, and IV.
Journal ArticleDOI

Blocking in a Shared Resource Environment

TL;DR: It is shown that, for the important and commonly implemented policy of complete sharing, a simple one-dimensional recursion can be developed which eliminates all difficulty in computing quantities of interest-regardless of both the size and dimensionality of the underlying model.
Journal ArticleDOI

Erlang capacity of a power controlled CDMA system

TL;DR: This work presents an approach to the evaluation of the reverse link capacity of a code-division multiple access (CDMA) cellular voice system which employs power control and a variable rate vocoder based on voice activity.