TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERS

Authors:
Evangelos Moutzoukis;Christos Langaris
Affiliations:
Department of Mathematics, University of Ioannina, Ioannina 45 110, Greece, E-mail: clagar@cc.uoi.gr;Department of Mathematics, University of Ioannina, Ioannina 45 110, Greece, E-mail: clagar@cc.uoi.gr
Venue:
Probability in the Engineering and Informational Sciences
Year:
2001

Citing 7
Cited 5

A survey on retrial queues

Queueing Systems: Theory and Applications
A bibliography of papers on queueing networks with finite capacity queues

Performance Evaluation - Queueing networks with finite capacity queues
Single line queue with repeated demands

Queueing Systems: Theory and Applications
Tandem behavior of a telecommunication system with finite buffers and repeated calls

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 with collision arising from unslotted CSMA/CD protocol

Queueing Systems: Theory and Applications
Retrial queues revisited

Frontiers in queueing

Analysis of a retrial queue with two-phase service and server vacations

Queueing Systems: Theory and Applications
Retrial networks with finite buffers and their application to internet data traffic

Probability in the Engineering and Informational Sciences
A tandem retrial queueing system with two Markovian flows and reservation of channels

Computers and Operations Research
Tandem service system with batch Markov flow and repeated calls

Automation and Remote Control
A matrix-geometric approximation for tandem queues with blocking and repeated attempts

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider two single-server queues in tandem. The customers receive service at the first station and then they proceed to the second. There are no intermediate waiting positions and, so, the blocking phenomenon is observed. The arriving customers who find the first station unavailable (busy or blocked) behave like retrial customers. We consider the case of “constant retrial policy.” For such a system, we obtain the system state probabilities in steady state in terms of generating functions. We present also some interesting measures of the system performance and directly deduce results for the corresponding ordinary (without retrials) model. We consider, finally, the special case of exponential service times as an example.