Polling, Greedy and Horizon Servers on a Circle

Arie Harel and Alan Stulman
Additional contact information
Arie Harel: Rutgers University, Newark, New Jersey
Alan Stulman: St. John’s University, New York, New York

Operations Research, 1995, vol. 43, issue 1, 177-186

Abstract: 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 direction, even if no requests are waiting, and stops whenever it encounters a request. The greedy server selects the nearest request for its next service. At any station the greedy server can reverse its direction if a new request arrives nearby, and if no requests are waiting the greedy server does not move. The horizon server, with parameter d , ignores all requests for service from a distance farther than d, . Within its horizon (≤ d) it acts like the greedy server. Analytical solutions for N = 2 and 3 and numerical results for N ≤ 6 show that the horizon server, with the optimum value of d , outperforms the polling and the greedy servers.

Keywords: queues; cyclic: dynamic scheduling of a server in a polling system (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.43.1.177 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:43:y:1995:i:1:p:177-186

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().