Analysis of polling systems
The analysis of random polling systems
Operations Research
Computer Networks and ISDN Systems
GSPN models of Markovian multiserver multiqueue systems
Performance Evaluation
Nondeterministic polling systems
Management Science
Cycles and waiting times in symmetric exhaustive and gated multiserver multiqueue systems
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
A closed form solution for the asymmetric random polling system with correlated Levy input process
Mathematics of Operations Research
Customer Routing on Polling Systems
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Waiting Times in Polling Systems with Markovian Server Routing
Messung, Modellierung und Bewertung von Rechensystemen, 5. GI/ITG-Fachtagung
| Hi-index | 0.01 |
We introduce a simple approach for modeling and analyzing a random polling system with infinite servers. We assume that the infinite number of servers is coupled together and they visit the queues as one processing unit. It is assumed that the customer arrival processes at all queues are correlated. Two classes of service disciplines, exhaustive and gated, are considered. We will derive several performance measures of the system. These performance measures include the mean cycle time and the expected delay observed by a customer. For the special case of M/D/∞ vacation queue, we also provide a new proof of a known result. The numerical results indicate that when the expected number of busy servers is high gated service produces mean waiting times less than those given by exhaustive service discipline. This result differs significantly from the known result for single server polling system and it is due to the assumption of coupled servers.