Abstract
In this paper, a discrete-time multiserver queueing system with infinite buffer size is studied. Packets arrive at the system according to a Bernoulli arrival process, and the service times of the packets are assumed to be constant equal to an integer multiple of slots. The number of active servers in the system is controlled by a so-called multi-threshold service policy with a set of thresholds predefined. For this multiserver system, we derive its stationary waiting time distribution by using the stochastic complement and Crommelin's techniques. We also present an algorithm for computing the stationary waiting time distribution.
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.
