Abstract
This paper analyzes the performance of discrete-time multiserver queues, subjected to random server interruptions. The arrival process is general independent. The numbers of available servers from slot to slot are modelled as a set of random variables. These are assumed to be i.i.d. Under these assumptions, an expression for the probability generating function of the delay is derived. From this function the first two moments of the delay are obtained. The result is shown to agree with Little's theorem. In addition, an analytic approximation for the tail probabilities of both delay and system contents is presented. A numerical example is included to illustrate the analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
