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. LOSS NETWORKS; INTEGRATED NETWORKS; TIME-SCALE SEPARATION; TRUNK RESERVATION; BLOCKING PROBABILITIES AMS 1991 Mathematics Subject Classification Primary: 60K20 Secondar...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
This paper proposes multirate teletraffic loss models of a link that accommodates different service-...
Most of the real-time applications involve connection establishment in point-to-point (unicast) comm...
In this paper we consider the analysis of call blocking at a single resource with differing capacity...
The problem of estimating call blocking probabilities in ATM networks is addressed in this thesis. W...
We study the limit behaviour of controlled loss networks as capacity and offered traffic are allowed...
The performance of networks and their ability to offer Quality of Service (QoS) depend on accurately...
A new approach to the analysis of Markovian queueing networks is developed and applied to traffic pr...
The authors propose two multirate teletraffic loss models in a two‐link system that accommodates Poi...
This paper deals with the transient behavior of the Erlang loss model. After scaling both arrival ra...
This paper proposes multirate teletraffic loss models of a link that accommodates different service-...
The primary objective in the present paper is to gain fundamental understanding of the performance a...
In this paper, a queueing system with multicast service, random resource requirements and general pr...
Call-blocking probabilities are among the key performance measures in mobile communications networks...
We study heavy traffic asymptotics of many Additive Increase Multi-plicative Decrease (AIMD) connect...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
This paper proposes multirate teletraffic loss models of a link that accommodates different service-...
Most of the real-time applications involve connection establishment in point-to-point (unicast) comm...
In this paper we consider the analysis of call blocking at a single resource with differing capacity...
The problem of estimating call blocking probabilities in ATM networks is addressed in this thesis. W...
We study the limit behaviour of controlled loss networks as capacity and offered traffic are allowed...
The performance of networks and their ability to offer Quality of Service (QoS) depend on accurately...
A new approach to the analysis of Markovian queueing networks is developed and applied to traffic pr...
The authors propose two multirate teletraffic loss models in a two‐link system that accommodates Poi...
This paper deals with the transient behavior of the Erlang loss model. After scaling both arrival ra...
This paper proposes multirate teletraffic loss models of a link that accommodates different service-...
The primary objective in the present paper is to gain fundamental understanding of the performance a...
In this paper, a queueing system with multicast service, random resource requirements and general pr...
Call-blocking probabilities are among the key performance measures in mobile communications networks...
We study heavy traffic asymptotics of many Additive Increase Multi-plicative Decrease (AIMD) connect...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
This paper proposes multirate teletraffic loss models of a link that accommodates different service-...
Most of the real-time applications involve connection establishment in point-to-point (unicast) comm...