IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v24y1977i2p281-291.html
   My bibliography  Save this article

An M/M/1 queue with delayed feedback

Author

Listed:
  • Ingjaldur Hannibalsson
  • Ralph L. Disney

Abstract

We present some results for M/M/1 queues with finite capacities with delayed feedback. The delay in the feedback to an M/M/1 queue is modelled as another M‐server queue with a finite capacity. The steady state probabilities for the two dimensional Markov process {N(t), M(t)} are solved when N(t) = queue length at server 1 at t and M(t) = queue length at server 2 at t. It is shown that a matrix operation can be performed to obtain the steady state probabilities. The eigenvalues of the operator and its eigenvectors are found. The problem is solved by fitting boundary conditions to the general solution and by normalizing. A sample problem is run to show that the solution methods can be programmed and meaningful results obtained numerically.

Suggested Citation

  • Ingjaldur Hannibalsson & Ralph L. Disney, 1977. "An M/M/1 queue with delayed feedback," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(2), pages 281-291, June.
    • Handle: RePEc:wly:navlog:v:24:y:1977:i:2:p:281-291
    DOI: 10.1002/nav.3800240207
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800240207
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800240207?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
    ---><---

    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:wly:navlog:v:24:y:1977:i:2:p:281-291. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.