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

Technical Note—A Last Word on L = λ W

Author

Listed:
  • Shaler Stidham

    (Cornell University, Ithaca, New York)

Abstract

This note gives a rigorous proof of the queuing formula L = λ W , using as hypotheses only that the limiting averages, λ and W , exist and are finite. The proof is related to one given in a previous paper by the author that used a discounted analogue and Tauberian theorems. The proof in the present paper, however, is direct and avoids the use of transforms. Some comments are offered on the relation between the proof and the heuristic arguments for L = λ W commonly encountered in the literature.

Suggested Citation

  • Shaler Stidham, 1974. "Technical Note—A Last Word on L = λ W," Operations Research, INFORMS, vol. 22(2), pages 417-421, April.
    • Handle: RePEc:inm:oropre:v:22:y:1974:i:2:p:417-421
    DOI: 10.1287/opre.22.2.417
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.22.2.417
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.22.2.417?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. Jennifer Sommer & Joost Berkhout & Hans Daduna & Bernd Heidergott, 2017. "Analysis of Jackson networks with infinite supply and unreliable nodes," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 181-207, October.

    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:inm:oropre:v:22:y:1974:i:2:p:417-421. 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.