Computation of the limiting distribution in queueing systems with repeatedattempts and disasters

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