Analysis of polling systems
Polling and greedy servers on a line
Queueing Systems: Theory and Applications
Light-traffic analysis for queues with spatially distributed arrivals
Mathematics of Operations Research
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Polling on a space with general arrival and service time distribution
Operations Research Letters
Queueing Systems: Theory and Applications
Controlled mobility in stochastic and dynamic wireless networks
Queueing Systems: Theory and Applications
Proceedings of the Winter Simulation Conference
On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
Consider a queueing system in which arriving customers are placed on a circle and wait for service. A traveling server moves at constant speed on the circle, stopping at the location of the customers until service completion. The server is greedy: always moving in the direction of the nearest customer. Coffman and Gilbert conjectured that this system is stable if the traffic intensity is smaller than 1; however, a proof or counterexample remains unknown. In this review, we present a picture of the current state of this conjecture and suggest new related open problems.