๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The M/G/1 retrial queue with Bernoulli schedules and general retrial times

โœ Scribed by B. Krishna Kumar; D. Arivudainambi

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
698 KB
Volume
43
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper is concerned with the analysis of a single-server queue with Bernoulli vacation schedules and general retrial times. We assume that the customers who find the server busy axe queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed access to the server. We first present the necessary and sufficient condition for the system to be stable and derive analytical results for the queue length distribution, as well as some performance measures of the system under steady-state condition. We show that the general stochastic decomposition law for M/G/1 vacation models holds for the present system also. Some special cases axe also studied. (~) 2001 Elsevier Science Ltd. All rights reserved.

๐Ÿ“œ SIMILAR VOLUMES

Geo/G/1 discrete time retrial queue with
Geo/G/1 discrete time retrial queue with Bernoulli schedule
โœ Hui Li; Tao Yang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 259 KB

This paper studies discrete time Geo/G/1 retrial queues with Bernoulli schedule in which the blocked customers either join the inยฎnite waiting space with probability a or leave the server and enter the retrial orbit with probability a 1 ร€ a). The customers in the retrial orbit will retry their servi

Stochastic analysis of a single server r
Stochastic analysis of a single server retrial queue with general retrial times
โœ A. Gรณmez-Corral ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB

Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with