Polling, Greedy and Horizon Servers on a Circle

@article{Harel1995PollingGA,
  title={Polling, Greedy and Horizon Servers on a Circle},
  author={Arie Harel and Alan Stulman},
  journal={Operations Research},
  year={1995},
  volume={43},
  pages={177-186}
}
Service in a loop-based polling system consists of a single server moving around a closed tour, stopping to perform services wherever requests are encountered. There are N stations unit buffer queues spaced one unit of distance apart, and the server moves at a unit speed. All queues are identical, and the service time is deterministic. We compare the two well known cyclic polling and greedy servers with a new control policy called the horizon server. The cyclic polling server moves in one… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Maximizing the throughput of a patrolling UAV by dynamic programming

  • 2011 IEEE International Conference on Control Applications (CCA)
  • 2011
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED