On the behavior of LIFO preemptive resume queues in heavy traffic.
Displaying 21 – 40 of 45
On the calculation of steady-state loss probabilities in the queue.
Kovalenko, Igor N., Atkinson, J.Ben (1994)
Journal of Applied Mathematics and Stochastic Analysis
On the convergence of truncated processes of multiserver retrial queues.
Domenech-Benlloch, M.Jose, Gimenez-Guzman, Jose Manuel, Pla, Vicent, Martinez-Bauset, Jorge, Casares-Giner, Vicente (2010)
Mathematical Problems in Engineering
On the ergodic distribution of oscillating queueing systems.
Bratiychuk, Mykola, Chydzinski, Andrzej (2003)
Journal of Applied Mathematics and Stochastic Analysis
On the level crossing of multi-dimensional delayed renewal processes.
Dshalalow, Jewgeni H. (1997)
Journal of Applied Mathematics and Stochastic Analysis
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.
On the M/G/1 retrial queue subjected to breakdowns
Natalia V. Djellab (2010)
RAIRO - Operations Research
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.
On the preemptive priority queues
Oldřich Vašíček (1967)
Kybernetika
On the queue-size distribution in the multi-server system with bounded capacity and packet dropping
Oleg Tikhonenko, Wojciech M. Kempa (2013)
Kybernetika
A multi-server -type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.
On the Single-Server Retrial Queue
Natalia V. Djellab (2006)
The Yugoslav Journal of Operations Research
On the virtual waiting time for an retrial queue with two types of calls.
Choi, Bong Dae, Han, Dong Hwan, Falin, Guennadi (1993)
Journal of Applied Mathematics and Stochastic Analysis
On transient queue-size distribution in the batch-arrivals system with a single vacation policy
Wojciech M. Kempa (2014)
Kybernetika
A queueing system with batch Poisson arrivals and single vacations with the exhaustive service discipline is investigated. As the main result the representation for the Laplace transform of the transient queue-size distribution in the system which is empty before the opening is obtained. The approach consists of few stages. Firstly, some results for a ``usual'' system without vacations corresponding to the original one are derived. Next, applying the formula of total probability, the analysis of...
Opérateurs positifs et probabilités stationnaires
R. Bellamine, J. Pellaumail (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Optimal and analytical results of queueing model
Rakesh Kumar Verma (1982)
Kybernetika
Optimal control and performance analysis of an queue with batches of negative customers
Jesus R. Artalejo, Antonis Economou (2004)
RAIRO - Operations Research - Recherche Opérationnelle
We consider a Markov decision process for an queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion or the average cost criterion. The performance analysis of the model when it operates under a given threshold-type policy is also studied. We prove a stability condition and a complete stochastic comparison characterization for models operating under different...
Optimal control and performance analysis of an MX/M/1 queue with batches of negative customers
Jesus R. Artalejo, Antonis Economou (2010)
RAIRO - Operations Research
We consider a Markov decision process for an MX/M/1 queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion or the average cost criterion. The performance analysis of the model when it operates under a given threshold-type policy is also studied. We prove a stability condition and a complete stochastic comparison characterization for models operating under different...
Optimal control characteristics of a queueing system with batch services
Viliam Makiš (1985)
Kybernetika
Optimal control for a BMAP/G/1 queue with two service modes.
Dudin, Alexander N., Nishimura, Shoichi (1999)
Mathematical Problems in Engineering
Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes
Olga V. Semenova (2004)
RAIRO - Operations Research - Recherche Opérationnelle
A single-server queueing system with a batch markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.
Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes
Olga V. Semenova (2010)
RAIRO - Operations Research
A single-server queueing system with a batch Markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.