Results 21 to 30 of about 461 (78)
This study analyzes an M/M/1 retrial queue with impatient customers under a multi-level stochastic environment, utilizing a sensor as a notification mechanism for detecting random shocks.
C.T. Dora Pravina +3 more
doaj +1 more source
Multi‐threshold control of the BMAP/SM/1/K queue with group services
International Journal of Stochastic Analysis, Volume 16, Issue 4, Page 327-347, 2003.
Alexander N. Dudin +1 more
wiley +1 more source
The distribution of the queueing delay in the stationary G/G/s queue is given with an application to the GI/G/s queue and to the M/G/s queue.
Pierre Le Gall
wiley +1 more source
Optimization in HIV screening problems
International Journal of Stochastic Analysis, Volume 16, Issue 4, Page 361-374, 2003.
Lev Abolnikov, Alexander Dukhovny
wiley +1 more source
The stationary G/G/s queue with non‐identical servers
We extend a recently developed factorization method to the case of the G/G/s queue with non‐identical servers, by presenting three simple properties which lead to a simple numerical calculation method. We compare our results with those determined by classical Markovian (phase) methods in the case of the symmetrical M/G/s queue, and for the mean ...
Pierre Le Gall
wiley +1 more source
Transient handover blocking probabilities in road covering cellular mobile networks [PDF]
This paper investigates handover and fresh call blocking probabilities for subscribers moving along a road in a traffic jam passing through consecutive cells of a wireless network.
Boucherie, R.J., Wal, J. van der
core +4 more sources
A heavy‐traffic theorem for the GI/G/1 queue with a Pareto‐type service time distribution
For the GI/G/1 queueing model with traffic load a < 1, service time distribution B(t) and interarrival time distribution A(t), whenever for t → ∞ , and , converges in distribution for a↑1. Here w is distributed as the stationary waiting time distribution. The L.‐S.
J. W. Cohen
wiley +1 more source
Analysis of a multi‐server queueing model of ABR
In this paper we present a queueing model for the performance analysis of Available Bit Rate (ABR) traffic in Asynchronous Transfer Mode (ATM) networks. We consider a multi‐channel service station with two types of customers, denoted by high priority and low priority customers.
R. Núñez-Queija, O. J. Boxma
wiley +1 more source
Proofs for some conjectures of Rajaratnam and Takawira [PDF]
The purpose of this note is to supplement a recent paper by Rajaratnam and Takawira ({\it IEEE Trans. Vehicular Technol.} {\bf 49} (2000) 817-834), which deals with a model for the performance analysis of cellular mobile networks.
Doorn, E.A. van, Kieu, A.T.T.
core +1 more source
Some reflections on the Renewal‐theory paradox in queueing theory
The classical renewal‐theory (waiting time, or inspection) paradox states that the length of the renewal interval that covers a randomly‐selected time epoch tends to be longer than an ordinary renewal interval. This paradox manifests itself in numerous interesting ways in queueing theory, a prime example being the celebrated Pollaczek‐Khintchine ...
Robert B. Cooper +2 more
wiley +1 more source

