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

Performance Bounds and Pathwise Stability for Generalized Vacation and Polling Systems

Author

Listed:
  • Eitan Altman

    (INRIA, Centre Sophia Antipolis, Sophia Antipolis Cedex, France)

  • Serguei Foss

    (Institute of Mathematics, Novosibirsk, Russia)

  • Eric Riehl

    (University of North Carolina, Chapel Hill, North Carolina)

  • Shaler Stidham

    (University of North Carolina, Chapel Hill, North Carolina)

Abstract

We consider a generalized vacation or polling system, modeled as an input-output process operating over successive “cycles,” in which the service mechanism can be in an “up” mode (processing) or “down” mode (e.g., vacation, walking). Our primary motivation is polling systems, in which there are several queues and the server moves cyclically between them providing some service in each. Our basic assumption is that the amount of work that leaves the system in a “cycle” is no less than the amount present at the beginning of the cycle. This includes the standard gated and exhaustive policies for polling systems in which a cycle begins whenever the server arrives at some prespecified queue. The input and output processes satisfy model-dependent conditions: pathwise bounds on the average rate and the burstiness (Cruz bounds); existence of long-run average rates; a pathwise generalized Law of the Iterated Logarithm; or exponentially or polynomially bounded tail probabilities of burstiness. In each model we show that these properties are inherited by performance measures such as the workload and output processes, and that the system is stable (in a model-dependent sense) if the input rate is smaller than the up-mode processing rate.

Suggested Citation

  • Eitan Altman & Serguei Foss & Eric Riehl & Shaler Stidham, 1998. "Performance Bounds and Pathwise Stability for Generalized Vacation and Polling Systems," Operations Research, INFORMS, vol. 46(1), pages 137-148, February.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:1:p:137-148
    DOI: 10.1287/opre.46.1.137
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.1.137
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.1.137?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:46:y:1998:i:1:p:137-148. 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.