Performance analysis of a single-server queue with repeated attempts

12Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Artalejo, J. R., & Gómez-Corral, A. (1999). Performance analysis of a single-server queue with repeated attempts. Mathematical and Computer Modelling, 30(3–4), 79–88. https://doi.org/10.1016/S0895-7177(99)00133-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free