IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v13y2011i3d10.1007_s11009-010-9175-x.html
   My bibliography  Save this article

Approximation in the M 2/G 2/1 Queue with Preemptive Priority

Author

Listed:
  • Naima Hamadouche

    (University of Bejaïa)

  • Djamil Aïssani

    (University of Bejaïa)

Abstract

The main purpose of this paper is to use the strong stability method to approximate the characteristics of the M 2/G 2/1 queue with preemptive priority by those of the classical M/G/1 queue. The latter is simpler and more exploitable in practice. After perturbing the arrival intensity of the priority requests, we derive the stability conditions and next obtain the stability inequalities with an exact computation of constants. From those theoretical results, we elaborate an algorithm allowing us to verify the approximation conditions and to provide the made numerical error. In order to have an idea about the efficiency of this approach, we consider a concrete example whose results are compared with those obtained by simulation.

Suggested Citation

  • Naima Hamadouche & Djamil Aïssani, 2011. "Approximation in the M 2/G 2/1 Queue with Preemptive Priority," Methodology and Computing in Applied Probability, Springer, vol. 13(3), pages 563-581, September.
    • Handle: RePEc:spr:metcap:v:13:y:2011:i:3:d:10.1007_s11009-010-9175-x
    DOI: 10.1007/s11009-010-9175-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-010-9175-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-010-9175-x?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. N. K. Jaiswal, 1961. "Preemptive Resume Priority Queue," Operations Research, INFORMS, vol. 9(5), pages 732-742, October.
    Full references (including those not matched with items on IDEAS)

    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. Jori Selen & Brian Fralix, 2017. "Time-dependent analysis of an M / M / c preemptive priority system with two priority classes," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 379-415, December.
    2. Divya Velayudhan Nair & Achyutha Krishnamoorthy & Agassi Melikov & Sevinj Aliyeva, 2021. "MMAP/(PH,PH)/1 Queue with Priority Loss through Feedback," Mathematics, MDPI, vol. 9(15), pages 1-26, July.
    3. A. Krishnamoorthy & P. Pramod & S. Chakravarthy, 2014. "Queues with interruptions: a survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 290-320, April.
    4. Mingang Yin & Ming Yan & Yu Guo & Minghe Liu, 2023. "Analysis of a Pre-Emptive Two-Priority Queuing System with Impatient Customers and Heterogeneous Servers," Mathematics, MDPI, vol. 11(18), pages 1-16, September.

    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:metcap:v:13:y:2011:i:3:d:10.1007_s11009-010-9175-x. 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: 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.