IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v44y1997i6p559-576.html
   My bibliography  Save this article

Algorithms for computing waiting time distributions under different queue disciplines for the D‐BMAP/PH/1

Author

Listed:
  • Imed Frigui
  • Attahiru Sule Alfa
  • Xiaoyi Xu

Abstract

A queueing system characterized by the discrete batch Markovian arrival process (D‐BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997

Suggested Citation

  • Imed Frigui & Attahiru Sule Alfa & Xiaoyi Xu, 1997. "Algorithms for computing waiting time distributions under different queue disciplines for the D‐BMAP/PH/1," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 559-576, September.
    • Handle: RePEc:wly:navres:v:44:y:1997:i:6:p:559-576
    DOI: 10.1002/(SICI)1520-6750(199709)44:63.0.CO;2-2
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199709)44:63.0.CO;2-2
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199709)44:63.0.CO;2-2?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
    ---><---

    References listed on IDEAS

    as
    1. Mary A. Johnson & Jennifer A. Luhman, 1994. "Behaviour of queueing approximations based on sample moments," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 10(4), pages 233-246.
    2. Alfa, Attahiru Sule & Frigui, Imed, 1996. "Discrete NT-policy single server queue with Markovian arrival process and phase type service," European Journal of Operational Research, Elsevier, vol. 88(3), pages 599-613, February.
    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. S. K. Samanta, 2020. "Waiting-time analysis of D-$${ BMAP}{/}G{/}1$$BMAP/G/1 queueing system," Annals of Operations Research, Springer, vol. 284(1), pages 401-413, January.

    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. Miaomiao Yu & Attahiru Sule Alfa, 2016. "Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue," Operational Research, Springer, vol. 16(2), pages 161-179, July.
    2. Nasr, Walid W. & Elshar, Ibrahim J., 2018. "Continuous inventory control with stochastic and non-stationary Markovian demand," European Journal of Operational Research, Elsevier, vol. 270(1), pages 198-217.
    3. Samanta, S.K. & Gupta, U.C. & Sharma, R.K., 2007. "Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations," European Journal of Operational Research, Elsevier, vol. 182(1), pages 321-339, October.
    4. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    5. Hanukov, Gabi, 2022. "Improving efficiency of service systems by performing a part of the service without the customer's presence," European Journal of Operational Research, Elsevier, vol. 302(2), pages 606-620.

    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:navres:v:44:y:1997:i:6:p:559-576. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.