Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A repairable Geo X /G/1 retrial queue with Bernoulli feedback and impatient customers

A repairable Geo X /G/1 retrial queue with Bernoulli feedback and impatient customers This paper deals with a discrete-time batch arrival retrial queue with the server subject to starting failures. Different from standard batch arrival retrial queues with starting failures, we assume that each customer after service either immediately returns to the orbit for another service with probability θ or leaves the system forever with probability 1 − θ (0 ≤ θ < 1). On the other hand, if the server is started unsuccessfully by a customer (external or repeated), the server is sent to repair immediately and the customer either joins the orbit with probability q or leaves the system forever with probability 1 − q (0 ≤ q < 1). Firstly, we introduce an embedded Markov chain and obtain the necessary and sufficient condition for ergodicity of this embedded Markov chain. Secondly, we derive the steady-state joint distribution of the server state and the number of customers in the system/orbit at arbitrary time. We also derive a stochastic decomposition law. In the special case of individual arrivals, we develop recursive formulae for calculating the steady-state distribution of the orbit size. Besides, we investigate the relation between our discrete-time system and its continuous counterpart. Finally, some numerical examples show the influence of the parameters on the mean orbit size. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A repairable Geo X /G/1 retrial queue with Bernoulli feedback and impatient customers

Acta Mathematicae Applicatae Sinica , Volume 30 (1) – Apr 26, 2014

Loading next page...
 
/lp/springer-journals/a-repairable-geo-x-g-1-retrial-queue-with-bernoulli-feedback-and-lbGXhELRnC

References (36)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-014-0278-y
Publisher site
See Article on Publisher Site

Abstract

This paper deals with a discrete-time batch arrival retrial queue with the server subject to starting failures. Different from standard batch arrival retrial queues with starting failures, we assume that each customer after service either immediately returns to the orbit for another service with probability θ or leaves the system forever with probability 1 − θ (0 ≤ θ < 1). On the other hand, if the server is started unsuccessfully by a customer (external or repeated), the server is sent to repair immediately and the customer either joins the orbit with probability q or leaves the system forever with probability 1 − q (0 ≤ q < 1). Firstly, we introduce an embedded Markov chain and obtain the necessary and sufficient condition for ergodicity of this embedded Markov chain. Secondly, we derive the steady-state joint distribution of the server state and the number of customers in the system/orbit at arbitrary time. We also derive a stochastic decomposition law. In the special case of individual arrivals, we develop recursive formulae for calculating the steady-state distribution of the orbit size. Besides, we investigate the relation between our discrete-time system and its continuous counterpart. Finally, some numerical examples show the influence of the parameters on the mean orbit size.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Apr 26, 2014

There are no references for this article.