IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v100y1999i3d10.1023_a1022638523391.html
   My bibliography  Save this article

New Linear Program Performance Bounds for Queueing Networks

Author

Listed:
  • J. R. Morrison

    (University of Illinois)

  • P. R. Kumar

    (University of Illinois)

Abstract

We obtain new linear programs for bounding the performance and proving the stability of queueing networks. They exploit the key facts that the transition probabilities of queueing networks are shift invariant on the relative interiors of faces and the cost functions of interest are linear in the state. A systematic procedure for choosing different quadratic functions on the relative interiors of faces to serve as surrogates of the differential costs in an inequality relaxation of the average cost function leads to linear program bounds. These bounds are probably better than earlier known bounds. It is also shown how to incorporate additional features, such as the presence of virtual multi-server stations to further improve the bounds. The approach also extends to provide functional bounds valid for all arrival rates.

Suggested Citation

  • J. R. Morrison & P. R. Kumar, 1999. "New Linear Program Performance Bounds for Queueing Networks," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 575-597, March.
    • Handle: RePEc:spr:joptap:v:100:y:1999:i:3:d:10.1023_a:1022638523391
    DOI: 10.1023/A:1022638523391
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022638523391
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022638523391?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.

    References listed on IDEAS

    as
    1. H. Jin & J. Ou & P. R. Kumar, 1997. "The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures," Mathematics of Operations Research, INFORMS, vol. 22(4), pages 886-920, November.
    2. C. Humes & J. Ou & P. R. Kumar, 1997. "The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability," Mathematics of Operations Research, INFORMS, vol. 22(4), pages 921-954, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Laumer, Simon & Barz, Christiane, 2023. "Reductions of non-separable approximate linear programs for network revenue management," European Journal of Operational Research, Elsevier, vol. 309(1), pages 252-270.
    2. Daniela Pucci de Farias & Benjamin Van Roy, 2006. "A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 597-620, August.
    3. Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.
    4. Selvaprabu Nadarajah & François Margot & Nicola Secomandi, 2015. "Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage," Management Science, INFORMS, vol. 61(12), pages 3054-3076, December.
    5. D. P. de Farias & B. Van Roy, 2003. "The Linear Programming Approach to Approximate Dynamic Programming," Operations Research, INFORMS, vol. 51(6), pages 850-865, December.
    6. Dimitris Bertsimas & David Gamarnik & Alexander Anatoliy Rikun, 2011. "Performance Analysis of Queueing Networks via Robust Optimization," Operations Research, INFORMS, vol. 59(2), pages 455-466, April.
    7. Daniela Pucci de Farias & Benjamin Van Roy, 2004. "On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 462-478, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bertsimas, Dimitris. & Gamarnik, David. & Tsitsiklis, John N., 1998. "Geometric bounds for stationary distributions of infinite Markov chains via Lyapunov functions," Working papers WP 4027-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Immanuel Bomze & Werner Schachinger & Gabriele Uchida, 2012. "Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization," Journal of Global Optimization, Springer, vol. 52(3), pages 423-445, March.
    3. Dimitris Bertsimas & David Gamarnik & Alexander Anatoliy Rikun, 2011. "Performance Analysis of Queueing Networks via Robust Optimization," Operations Research, INFORMS, vol. 59(2), pages 455-466, April.
    4. Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.

    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:spr:joptap:v:100:y:1999:i:3:d:10.1023_a:1022638523391. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.