Displaying similar documents to “The theory of networks of single server queues and the tandem queue model.”

Study of Queuing Systems with a Generalized Departure Process

Mirtchev, Seferin, Statev, Stanimir (2008)

Serdica Journal of Computing

Similarity:

This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005. This paper deals with a full accessibility loss system and a single server delay system with a Poisson arrival process and state dependent exponentially distributed service time. We use the generalized service flow with nonlinear state dependence mean service time. The idea is based on the analytical continuation of the Binomial distribution and the classic M/M/n/0 and M/M/1/k system....

A discrete-time queueing system with changes in the vacation times

Ivan Atencia (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability...

Analyzing discrete-time bulk-service queue

Veena Goswami, Umesh C. Gupta, Sujit K. Samanta (2006)

RAIRO - Operations Research

Similarity:

This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time...

Fluid limits for the queue length of jobs in multiserver open queueing networks

Saulius Minkevičius (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The object of this research in the queueing theory is a theorem about the Strong-Law-of-Large-Numbers (SLLN) under the conditions of heavy traffic in a multiserver open queueing network. SLLN is known as a fluid limit or fluid approximation. In this work, we prove that the long-term average rate of growth of the queue length process of a multiserver open queueing network under heavy traffic strongly converges to a particular vector of rates. SLLN is proved for the values of an important...