IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v79y1998i0p63-8210.1023-a1018943310005.html
   My bibliography  Save this article

A finite capacity multi-server multi-queueing priority model with non-renewal input

Author

Listed:
  • Dietmar Wagner

Abstract

We consider a non-preemptive head-of-the-line multi-server multi-queueing priority model with finite buffer capacity for each priority class. As an arrival process, a generalized Markovian arrival process with marked transitions is used. The service-time distribution is of phase-type and identical for the different priority classes. The model is described by a homogeneous continuous-time Markov chain (CTMC). From the steady-state distribution of the CTMC, which is calculated by matrix-geometric methods, we derive the steady-state distributions immediately after arrival instants of the different priority classes. Applying matrix-analytic methods, we calculate the Laplace-Stieltjes Transform (LST) of the actual waiting times for the different priority classes. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Dietmar Wagner, 1998. "A finite capacity multi-server multi-queueing priority model with non-renewal input," Annals of Operations Research, Springer, vol. 79(0), pages 63-82, January.
    • Handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:63-82:10.1023/a:1018943310005
    DOI: 10.1023/A:1018943310005
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Andrei Sleptchenko & M. Eric Johnson, 2015. "Maintaining Secure and Reliable Distributed Control Systems," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 103-117, February.
    2. Feng, Wei & Umemura, Masataka, 2009. "Analysis of a finite buffer model with two servers and two nonpreemptive priority classes," European Journal of Operational Research, Elsevier, vol. 192(1), pages 151-172, January.

    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:annopr:v:79:y:1998:i:0:p:63-82:10.1023/a:1018943310005. 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: 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.