Stochastic bounds for a single server queue with general retrial times
Authors
Abstract:
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
similar resources
stochastic bounds for a single server queue with general retrial times
we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds. the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques.
full textStochastic Bounds for a Single Server Queue with General Retrial Times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
full textOn the Single-server Retrial Queue
In this work, we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under exponential assumption for retrial times as an approximation in the non-exponential...
full textAn Unreliable Server Retrial Queue with Two Phases of Service and General Retrial Times Under Bernoulli Vacation Schedule
Abstract: This paper deals with the steady state behavior of an M/G/1 retrial queue with two successive phases of service and general retrial times under Bernoulli vacation schedule for an unreliable server. While the server is working with any phase of service, it may breakdown at any instant and the service channel will fail for a short interval of time. The primary customers finding the serv...
full textA Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
We consider a discrete-time Geo/G/1 retrial queue in which the retrial time has a general distribution and the server, after each service completion, begins a process of search in order to find the following customer to be served. We study the Markov chain underlying the considered queueing system and its ergodicity condition. We find the generating function of the number of customers in the or...
full textA Single Server Retrial Queue in Bernoulli Schedule With Feedback on Non-Retrial Customers
In this paper, we consider an M/G/1 retrial queue with Bernoulli feedback and general retrial times where the external arrivals blocked either with probability q join the infinite waiting room called non-retrial queue or with probability p, (p+q = 1) leave the service area and enter the retrial group called orbit in FIFO discipline. Also we assume that only the customer at the head of the orbit...
full textMy Resources
Journal title
volume 40 issue 1
pages 183- 198
publication date 2014-02-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023