IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v246y2015i1p128-139.html
   My bibliography  Save this article

Efficient analysis of the MMAP[K]/PH[K]/1 priority queue

Author

Listed:
  • Horváth, Gábor

Abstract

In this paper we consider the MMAP/PH/1 priority queue, both the case of preemptive resume and the case of non-preemptive service. The main idea of the presented analysis procedure is that the sojourn time of the low priority jobs in the preemptive case (and the waiting time distribution in the non-preemptive case) can be represented by the duration of the busy period of a special Markovian fluid model. By making use of the recent results on the busy period analysis of Markovian fluid models it is possible to calculate several queueing performance measures in an efficient way including the sojourn time distribution (both in the time domain and in the Laplace transform domain), the moments of the sojourn time, the generating function of the queue length, the queue length moments and the queue length probabilities.

Suggested Citation

  • Horváth, Gábor, 2015. "Efficient analysis of the MMAP[K]/PH[K]/1 priority queue," European Journal of Operational Research, Elsevier, vol. 246(1), pages 128-139.
    • Handle: RePEc:eee:ejores:v:246:y:2015:i:1:p:128-139
    DOI: 10.1016/j.ejor.2015.03.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715001976
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.03.004?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.

    References listed on IDEAS

    as
    1. Van Houdt, Benny, 2012. "Analysis of the adaptive MMAP[K]/PH[K]/1 queue: A multi-type queue with adaptive arrivals and general impatience," European Journal of Operational Research, Elsevier, vol. 220(3), pages 695-704.
    2. He, Qi-Ming & Neuts, Marcel F., 1998. "Markov chains with marked transitions," Stochastic Processes and their Applications, Elsevier, vol. 74(1), pages 37-52, May.
    3. de Souza, Regiane Máximo & Morabito, Reinaldo & Chiyoshi, Fernando Y. & Iannoni, Ana Paula, 2015. "Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil," European Journal of Operational Research, Elsevier, vol. 242(1), pages 274-285.
    4. V. Ramaswami & Douglas Woolford & David Stanford, 2008. "The erlangization method for Markovian fluid flows," Annals of Operations Research, Springer, vol. 160(1), pages 215-225, April.
    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. Sofian De Clercq & Joris Walraevens, 2020. "Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node," Annals of Operations Research, Springer, vol. 293(1), pages 57-72, October.

    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. Qi-Ming He & Jiandong Ren, 2016. "Analysis of a Multivariate Claim Process," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 257-273, March.
    2. Casale, Giuliano & Sansottera, Andrea & Cremonesi, Paolo, 2016. "Compact Markov-modulated models for multiclass trace fitting," European Journal of Operational Research, Elsevier, vol. 255(3), pages 822-833.
    3. Soovin Yoon & Laura A. Albert, 2018. "An expected coverage model with a cutoff priority queue," Health Care Management Science, Springer, vol. 21(4), pages 517-533, December.
    4. Ivo Adan & Brett Hathaway & Vidyadhar G. Kulkarni, 2019. "On first-come, first-served queues with two classes of impatient customers," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 113-142, February.
    5. Gábor Horváth, 2020. "Waiting time and queue length analysis of Markov-modulated fluid priority queues," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 69-95, June.
    6. Ansari, Sardar & Yoon, Soovin & Albert, Laura A., 2017. "An approximate hypercube model for public service systems with co-located servers and multiple response," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 143-157.
    7. Michel Mandjes & Birgit Sollie, 2022. "A Numerical Approach for Evaluating the Time-Dependent Distribution of a Quasi Birth-Death Process," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1693-1715, September.
    8. David Landriault & Jean-François Renaud & Xiaowen Zhou, 2014. "An Insurance Risk Model with Parisian Implementation Delays," Methodology and Computing in Applied Probability, Springer, vol. 16(3), pages 583-607, September.
    9. Peter Buchholz & Jan Kriege, 2017. "Fitting correlated arrival and service times and related queueing performance," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 337-359, April.
    10. Samuelson, Aviva & Haigh, Andrew & O'Reilly, Małgorzata M. & Bean, Nigel G., 2017. "Stochastic model for maintenance in continuously deteriorating systems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1169-1179.
    11. Cheung, Eric C.K. & Zhu, Wei, 2023. "Cumulative Parisian ruin in finite and infinite time horizons for a renewal risk process with exponential claims," Insurance: Mathematics and Economics, Elsevier, vol. 111(C), pages 84-101.
    12. Khayyati, Siamak & Tan, Barış, 2020. "Data-driven control of a production system by using marking-dependent threshold policy," International Journal of Production Economics, Elsevier, vol. 226(C).
    13. Rautenstrauss, Maximiliane & Martin, Layla & Minner, Stefan, 2023. "Ambulance dispatching during a pandemic: Tradeoffs of categorizing patients and allocating ambulances," European Journal of Operational Research, Elsevier, vol. 304(1), pages 239-254.
    14. Ni, Guanqun & Xu, Yinfeng & Dong, Yucheng, 2013. "Price and speed decisions in customer-intensive services with two classes of customers," European Journal of Operational Research, Elsevier, vol. 228(2), pages 427-436.
    15. Yutaka Sakuma & Onno Boxma & Tuan Phung-Duc, 2021. "An M/PH/1 queue with workload-dependent processing speed and vacations," Queueing Systems: Theory and Applications, Springer, vol. 98(3), pages 373-405, August.
    16. Akbar Karimi & Michel Gendreau & Vedat Verter, 2018. "Performance Approximation of Emergency Service Systems with Priorities and Partial Backups," Transportation Science, INFORMS, vol. 52(5), pages 1235-1252, October.
    17. Marcel F. Neuts & Jian-Min Li, 1999. "Point Processes Competing for Runs: A New Tool for their Investigation," Methodology and Computing in Applied Probability, Springer, vol. 1(1), pages 29-53, July.
    18. Cheung, Eric C.K. & Wong, Jeff T.Y., 2017. "On the dual risk model with Parisian implementation delays in dividend payments," European Journal of Operational Research, Elsevier, vol. 257(1), pages 159-173.
    19. Yoon, Soovin & Albert, Laura A., 2021. "Dynamic dispatch policies for emergency response with multiple types of vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    20. A. Gómez-Corral & M. E. Martos, 2009. "Marked Markovian Arrivals in a Tandem G-Network with Blocking," Methodology and Computing in Applied Probability, Springer, vol. 11(4), pages 621-649, December.

    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:eee:ejores:v:246:y:2015:i:1:p:128-139. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.