Analysis of polling systems
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Optimizing a generalized polling protocol for resource finding over a multiple access channel
Computer Networks and ISDN Systems
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
SIAM Journal on Control and Optimization
Analysis and Control of Poling Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
DYNAMIC VISIT-ORDER RULES FOR BATCH-SERVICE POLLING
Probability in the Engineering and Informational Sciences
Probability in the Engineering and Informational Sciences
Load Sharing in Distributed Systems
IEEE Transactions on Computers
A novel MAC protocol for broadband communication over CATV-based MANs
Computer Communications
Polling systems with batch service
OR Spectrum
| Hi-index | 0.00 |
We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and the service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues comprising the system is, in isolation, an M/G/∞-type queue. A job that is not completed during a visit will have a new service-time requirement sampled from the service-time distribution of the corresponding queue. To the best of our knowledge, this article is the first in which an M/G/∞-type polling system is analyzed. For this polling model, we derive the probability generating function and expected value of the queue lengths and the Laplace–Stieltjes transform and expected value of the sojourn time of a customer. Moreover, we identify the policy that maximizes the throughput of the system per cycle and conclude that under the Hamiltonian-tour approach, the optimal visiting order is independent of the number of customers present at the various queues at the start of the cycle.