On the tail of the stationary waiting time distribution and limit theorems for the M/G/1 queue
J. W. Cohen (1972)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Displaying similar documents to “Distribution of crossings of level in a busy cycle of the M/G/1 queue”
On the tail of the stationary waiting time distribution and limit theorems for the M/G/1 queue
Identification of waiting time distribution of M/G/1, M x/G/1, GI r/M/1 queueing systems.
Ghosal, A., Madan, S. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the waiting time distribution of a cascade queueing process
R. G. Rani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Behaviour of passage time for a queueing network model with feedback: a simulation study.
Medya, Bidyut K. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A queuing model with feedback
Lajos Takács (1977)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Computation of the limiting distribution in queueing systems with repeated attempts and disasters
J. R. Artalejo, A. Gómez-Corral (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Analysis of an MMAP/PH₁,PH₂/N/∞ queueing system operating in a random environment
Chesoong Kim, Alexander Dudin, Sergey Dudin, Olga Dudina (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process. Type 1 customers have a non-preemptive priority over type 2 customers and can leave the buffer due to a lack of service. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the...
Joint distribution of the busy and idle periods of a discrete modified queue
Anatolij Dvurečenskij (1988)
Aplikace matematiky
Similarity:
For a discrete modified queue, , where the service times of all customers served during any busy period are independent random variables with not necessarily identical distribution functions, the joint distribution of the busy period, the subsequent idle period and the number of customers served during the busy period is derived. The formulae presented are in a convenient form for practical use. The paper is a continuation of [5], where the discrete modified queue has been studied. ...
Joint distribution of waiting time and queue size for single server queues
Władysław Szczotka
Similarity:
CONTENTS1. Introduction...................................................................52. Preliminaries................................................................113. Departure process......................................................194. Joint distribution of waiting time and queue size..........325. New forms of Little's formula.......................................38References.....................................................................53