A discrete-time retrial queueing system with recurrent customers

Authors:
I. Atencia;I. Fortes;S. Nishimura;S. Sánchez
Affiliations:
Department of Applied Mathematics, University of Málaga, Campus Teatinos, 29071 Málaga, Spain;Department of Applied Mathematics, University of Málaga, Campus Teatinos, 29071 Málaga, Spain;Department of Mathematical Information Science, Tokyo University of Science, Japan;Department of Applied Mathematics, University of Málaga, Campus Teatinos, 29071 Málaga, Spain
Venue:
Computers and Operations Research
Year:
2010

Citing 6
Cited 2

A survey on retrial queues

Queueing Systems: Theory and Applications
A survey of retrial queues

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Retrial queues revisited

Frontiers in queueing
Discrete-Time Models for Communication Systems Including ATM

Discrete-Time Models for Communication Systems Including ATM
Performance estimation of an email contact center by a finite source discrete time Geo/Geo/1 queue with disasters

Computers and Industrial Engineering
Accessible bibliography on retrial queues

Mathematical and Computer Modelling: An International Journal

A new computational algorithm for retrial queues to cellular mobile systems with guard channels

Computers and Industrial Engineering
A discrete-time Geo/G/1 retrial queue with starting failures and impatient customers

Transactions on computational science VII

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a discrete-time single-server retrial queue with general service times and two classes of customers: transit and a fixed number of recurrent customers. After service completion, recurrent customers always return to the orbit and transit customers leave the systems forever. In this work we study the influence of recurrent customers. This structure appears in many applications on computer and communication networks, but also has theoretical interest. The explicit expressions of generating functions of the stationary distribution of the Markov chain are given. We also provide the main reliability indexes and numerical examples with the use of discrete Fourier transform inversion.