IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v42y2011i12p2085-2096.html
   My bibliography  Save this article

A new LP formulation of the admission control problem modelled as an MDP under average reward criterion

Author

Listed:
  • Antonio Pietrabissa

Abstract

The admission control problem can be modelled as a Markov decision process (MDP) under the average cost criterion and formulated as a linear programming (LP) problem. The LP formulation is attractive in the present and future communication networks, which support an increasing number of classes of service, since it can be used to explicitly control class-level requirements, such as class blocking probabilities. On the other hand, the LP formulation suffers from scalability problems as the number C of classes increases. This article proposes a new LP formulation, which, even if it does not introduce any approximation, is much more scalable: the problem size reduction with respect to the standard LP formulation is O((C + 1)2/2C). Theoretical and numerical simulation results prove the effectiveness of the proposed approach.

Suggested Citation

  • Antonio Pietrabissa, 2011. "A new LP formulation of the admission control problem modelled as an MDP under average reward criterion," International Journal of Systems Science, Taylor & Francis Journals, vol. 42(12), pages 2085-2096.
    • Handle: RePEc:taf:tsysxx:v:42:y:2011:i:12:p:2085-2096
    DOI: 10.1080/00207721003717289
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721003717289
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721003717289?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tsysxx:v:42:y:2011:i:12:p:2085-2096. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.