Artalejo Rodríguez, Jesús ManuelGómez-Corral, Antonio2023-06-202023-06-201999-04-030895-717710.1016/S0895-7177(99)00133-8https://hdl.handle.net/20.500.14352/57425This 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.engjournal articlehttp://www.sciencedirect.com/science/article/pii/S0895717799001338http://www.sciencedirect.comrestricted access519.216Queueing theory computer systemsrepeated attemptsdisasterssteady-state distributionbusy periodProcesos estocásticos1208.08 Procesos Estocásticos