IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v46y2021i3p869-894.html
   My bibliography  Save this article

Diffusion Approximation for Fair Resource Control—Interchange of Limits Under a Moment Condition

Author

Listed:
  • Heng-Qing Ye

    (Department of Logistics and Maritime Studies, Hong Kong Polytechnic University, Hong Kong)

  • David D. Yao

    (Department of Industrial Engineering and Operations Research, Columbia University, New York 10027)

Abstract

In a prior study [Ye HQ, Yao DD (2016) Diffusion limit of fair resource control–Stationary and interchange of limits. Math. Oper. Res . 41(4):1161–1207.] focusing on a class of stochastic processing network with fair resource control, we justified the diffusion approximation (in the context of the interchange of limits) provided that the p th moment of the workloads are bounded. To this end, we introduced the so-called bounded workload condition, which requires the workload process be bounded by a free process plus the initial workload. This condition is for a derived process, the workload, as opposed to primitives such as arrival processes and service requirements; as such, it could be difficult to verify. In this paper, we establish the interchange of limits under a moment condition of suitable order on the primitives directly: the required order is p ∗ > 2 ( p + 2 ) on the moments of the primitive processes so as to bound the p th moment of the workload. This moment condition is trivial to verify, and indeed automatically holds in networks where the primitives have moments of all orders, for instance, renewal arrivals with phase-type interarrival times and independent and identically distributed phase-type service times.

Suggested Citation

  • Heng-Qing Ye & David D. Yao, 2021. "Diffusion Approximation for Fair Resource Control—Interchange of Limits Under a Moment Condition," Mathematics of Operations Research, INFORMS, vol. 46(3), pages 869-894, August.
  • Handle: RePEc:inm:ormoor:v:46:y:2021:i:3:p:869-894
    DOI: 10.1287/moor.2020.1065
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2020.1065
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2020.1065?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:ormoor:v:46:y:2021:i:3:p:869-894. 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.