Computation of the limiting distribution in queueing systems with repeated attempts and disasters

Abstract

Single server queues with repeated attempts are useful in the modeling of computer and telecommunication systems. In addition, we consider iii this paper the possibility of disasters. When a disaster occurs, all the customers present in the sq stein are destroyed immediately. Using a regenerative approach, we derive a numerically stable recursion scheme for the stare probabilities. This model can be employed to analyze the behaviour of a buffer in computers with virus infections.