A Many-server Queue with Service Interruption推荐.pdfVIP

A MANY-SERVER QUEUE WITH SERVICE INTERRUPTIONS I. L. Mitrany and B. Avi-Itzhak Technion,Israel Institute of Technology,Haifa, Israel (Received February 8, 1967) A steady-state MIMIN queuing system where each server is subject to random breakdowns of exponentially distributed duration is studied and analyzed. The moment generating function of the queue size is obtained in explicit form for N?2. For larger values of N a numerical method is suggested. A QUEUING system with service interruption was first introduced a AND CHRISTIE had studied decade ago by WHITE [1] who a single- server queue with preemptive resume discipline. The problem was recog- nized as both important and interesting and was extensively studied dur- ing the last decade by MILLER,[2] GAVER, (3] JAISWAL,[4] AVI-ITZHAK AND NAOR,15,6] THIRUVENGADAN,[71 WELCH,[8] and many others. However, all these authors deal with various aspects of the single-server queues, while very little is known about the many-server system with service in- terruptions. The importance of the study of such queuing systems derives from the real world, where service interruptions are met on many occasions. In this paper we study a steady-state queuing system with N identical servers giving service to a Poisson stream of incoming customers. The queue discipline is first-come-first-goes-into-service. Each server is subject to breakdowns occurring randomly in time. A broken down server is brought back to an operative state by a repair process that starts imm