Multiserver multiqueue systems with limited service and zero walk time
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1178-1188 vol.3
- https://doi.org/10.1109/infcom.1991.147637
Abstract
A study of multiserver multiqueue systems, i.e., queuing systems comprising a set of waiting lines where customers arrive to be served by a pool of servers, is described. Servers cyclically move from one queue to another, and provide service to at most one waiting customer per visit to a queue. Such (1-limited) multiserver polling models are analyzed. Attention is restricted to the case where the movement of the servers from queue to queue takes place in zero time. Two different server utilization policies are considered, and exact results are presented for the average customer waiting time and delay in the simpler case, while simple upper and lower bounds and a very accurate approximation are proposed for the more complex policy. In both cases systems are assumed to be symmetrical, arrivals are taken to be Poisson, and service times exponential.Keywords
This publication has 10 references indexed in Scilit:
- Design and analysis of multiple token ring networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- GSPN models of Markovian multiserver multiqueue systemsPerformance Evaluation, 1990
- Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networksComputer Networks and ISDN Systems, 1989
- A GSMP formalism for discrete event systemsProceedings of the IEEE, 1989
- Product-form solution techniques for the performance analysis of multiple-bus multiprocessor systems with nonuniform memory referencesIEEE Transactions on Computers, 1988
- The MULTIBUS algorithmPerformance Evaluation, 1988
- A BCMP extension to multiserver stations with concurrent classes of customersPublished by Association for Computing Machinery (ACM) ,1986
- A Closed-Form Solution for the Perfornance Analysis of Multiple-Bus Multiprocessor SystemsIEEE Transactions on Computers, 1984
- Markov Models for Multiple Bus Multiprocessor SystemsIEEE Transactions on Computers, 1982
- A Proof for the Queuing Formula: L = λWOperations Research, 1961