z-logo
open-access-imgOpen Access
A Discrete-TimeGeo/G/1Retrial Queue withJVacations and Two Types of Breakdowns
Author(s) -
Feng Zhang,
Zhifeng Zhu
Publication year - 2013
Publication title -
journal of applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.307
H-Index - 43
eISSN - 1687-0042
pISSN - 1110-757X
DOI - 10.1155/2013/834731
Subject(s) - algorithm , computer science , database
This paper is concerned with a discrete-time Geo/G/1 retrial queueing model with J vacations and two types of breakdowns. If the orbit is empty, the server takes at most J vacations repeatedly until at least one customer appears in the orbit upon returning from a vacation. It is assumed that the server is subject to two types of different breakdowns and is sent immediately for repair. We analyze the Markov chain underlying the considered queueing system and derive the system state distribution as well as the orbit size and the system size distributions in terms of their generating functions. Then, we obtain some performance measures through the generating functions. Moreover, the stochastic decomposition property and the corresponding continuous-time queueing system are investigated. Finally, some numerical examples are provided to illustrate the effect of vacations and breakdowns on several performance measures of the system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom