Displaying 161 – 180 of 286

Showing per page

On a non-Markovian queueing problem under a control operating policy and start-up times

Arun Borthakur, Ruby Gohain (1982)

Aplikace matematiky

A non-Markovian queueing system with Poisson input is studied under a modified operating rule called “control operating policy” in which the server begins “start-up” only when the queue length reaches a fixed number n ( 1 ) . By using the supplementary variable technique, the distribution of the queue length (excluding those being served) in the form of a generating function is obtained. As a special case, a Markovian queueing system with exponential start-up is discussed in detail to analyse the economic...

On main characteristics of the M / M / 1 / N queue with single and batch arrivals and the queue size controlled by AQM algorithms

Wojciech M. Kempa (2011)

Kybernetika

In the article finite-buffer queueing systems of the M / M / 1 / N type with queue size controlled by AQM algorithms are considered, separately for single and batch arrivals. In the latter case two different acceptance strategies: WBAS (Whole Batch Acceptance Strategy) and PBAS (Partial Batch Acceptance Strategy) are distinguished. Three essential characteristics of the system are investigated: the stationary queue-size distribution, the number of consecutively dropped packets (batches of packets) and the time...

On the M/G/1 retrial queue subjected to breakdowns

Natalia V. Djellab (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.

Currently displaying 161 – 180 of 286