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

On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

Author

Listed:
  • Alexander L. Stolyar

    (Bell Laboratories, Lucent Technologies, 600 Mountain Ave., 2C-322, Murray Hill, New Jersey 07974)

Abstract

We consider the model where N queues (users) are served in discrete time by a generalized switch. The switch state is random, and it determines the set of possible service rate choices (scheduling decisions) in each time slot. This model is primarily motivated by the problem of scheduling transmissions of N data users in a shared time-varying wireless environment, but also includes other applications such as input-queued cross-bar switches and parallel flexible server systems.The objective is to find a scheduling strategy maximizing a concave utility function H ( u 1 ,…, u N ), where u n s are long-term average service rates (data throughputs) of the users, assuming users always have data to be served.We prove asymptotic optimality of the gradient scheduling algorithm (which generalizes the well-known proportional fair algorithm) for our model, which, in particular, allows for simultaneous service of multiple users and for discrete sets of scheduling decisions. Analysis of the transient dynamics of user throughputs is the key part of this work.

Suggested Citation

  • Alexander L. Stolyar, 2005. "On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation," Operations Research, INFORMS, vol. 53(1), pages 12-25, February.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:1:p:12-25
    DOI: 10.1287/opre.1040.0156
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1040.0156
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1040.0156?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhou, Wenhui & Wan, Qiang & Zhang, Ren-Qian, 2017. "Choosing among hospitals in the subsidized health insurance system of China: A sequential game approach," European Journal of Operational Research, Elsevier, vol. 257(2), pages 568-585.
    2. Heng-Qing Ye & David D. Yao, 2008. "Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation," Operations Research, INFORMS, vol. 56(2), pages 453-470, April.

    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:53:y:2005:i:1:p:12-25. 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.