Performance analysis of a single-server queue with repeated attempts

Authors:
J. R. Artalejo;A. Gómez-Corral
Affiliations:
Departamento de Estadistica e I.O., Facultad de Matematicas Universidad Complutense de Madrid, 28040 Madrid, Spain;Departamento de Estadistica e I.O., Facultad de Matematicas Universidad Complutense de Madrid, 28040 Madrid, Spain
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1999

Citing 4
Cited 0

A simple telephone exchange with delayed feedbacks

Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
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
A queueing network model with catastrophes and product form solution

Operations Research Letters

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper is concerned with the performance evaluation of a single-server queue with repeated attempts and disasters. Our queueing system is characterized by the phenomenon that a customer who finds the server busy upon arrival joins a group of unfilled customers called 'orbit' and repeats his request after some random time. In addition, we consider in this paper the possibility of disasters. When a disaster occurs, all the work (and therefore customers) in the system is destroyed immediately. Our queueing system can be used to model the behaviour of a buffer in computers with virus infections.