IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i1p177-186.html
   My bibliography  Save this article

Polling, Greedy and Horizon Servers on a Circle

Author

Listed:
  • Arie Harel

    (Rutgers University, Newark, New Jersey)

  • Alan Stulman

    (St. John’s University, New York, New York)

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.

Suggested Citation

  • Arie Harel & Alan Stulman, 1995. "Polling, Greedy and Horizon Servers on a Circle," Operations Research, INFORMS, vol. 43(1), pages 177-186, February.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:177-186
    DOI: 10.1287/opre.43.1.177
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.1.177
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.1.177?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:177-186. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.