Performance analysis of a single-server queue with repeated attempts

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.