IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v79y1998i0p27-4410.1023-a1018974722301.html
   My bibliography  Save this article

Spectral expansion solution for some finite capacity queues

Author

Listed:
  • Ram Chakka

Abstract

The spectral expansion method is successfully extended for the steady-state solution of a class of Markov processes of finite state space. These processes are of QBD structure, with boundary. The solution is exact and efficient. Some qualitative comparisons are made with some of the existing methods. In this framework, a finite capacity multiserver system, alternating in a Markovian environment, serving a Poisson stream of jobs, is analysed. Another system considered is a two-stage queueing network with feedback and a finite intermediate waiting room. This system is modelled and solved by spectral expansion. Typical numerical results are presented. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Ram Chakka, 1998. "Spectral expansion solution for some finite capacity queues," Annals of Operations Research, Springer, vol. 79(0), pages 27-44, January.
    • Handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:27-44:10.1023/a:1018974722301
    DOI: 10.1023/A:1018974722301
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018974722301
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018974722301?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. Eser Gemikonakli & Enver Ever & Glenford Mapp & Orhan Gemikonakli, 2017. "Admission control and buffer management of wireless communication systems with mobile stations and integrated voice and data services," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 65(4), pages 663-675, August.
    2. Hu, Lu & Jiang, Yangsheng & Zhu, Juanxiu & Chen, Yanru, 2015. "A PH/PH(n)/C/C state-dependent queuing model for metro station corridor width design," European Journal of Operational Research, Elsevier, vol. 240(1), pages 109-126.
    3. A. D. Banik & M. L. Chaudhry, 2017. "Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP / G /1/ N With or Without Vacation(s)," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 140-151, February.

    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:27-44:10.1023/a:1018974722301. 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.