Queueing systems with general renovation

Abstract

Multi-server queueing systems with complete and general renovation are revised. Such models are often encountered in computer science applications. Methods of analysis for the queues with general(recurrent) input flow and exponential service time with different combinations of service and general renovation disciplines are discussed. Explicit solutions (the steady-state probabilitiy distribution , loss and service probabilities for arriving customers, waiting time for lost and serviced customers) are proposed.