IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2022y2022i1n5834258.html

(N, n)‐Preemptive‐Priority M/G/1 Queues with Finite and Infinite Buffers

Author

Listed:
  • Kilhwan Kim

Abstract

In this paper, we analyze an M/G/1 priority queueing model with finite and infinite buffers under the (N, n)‐preemptive priority discipline, under which preemption decisions are made based on the number of high‐priority customers. This priority queueing model can be used for the performance analysis of communication systems accommodating delay‐ and loss‐sensitive packets simultaneously. To analyze the proposed model, we extend the method of delay cycle analysis and develop a queue length version of it for finite‐buffer queues. Throughout our analysis, we demonstrate that by the proposed method the analysis of the complex priority queueing model can be reduced to that of simple delay cycles, so two different preemption modes of the queueing model can be dealt with in a unified way. The numerical study reveals that adjusting the decision variables N and n allows us to fine‐tune system performance for different classes of customers, and N operates as a primary control variable, regardless of the preemption mode and service‐time distributions.

Suggested Citation

  • Kilhwan Kim, 2022. "(N, n)‐Preemptive‐Priority M/G/1 Queues with Finite and Infinite Buffers," Journal of Applied Mathematics, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:jnljam:v:2022:y:2022:i:1:n:5834258
    DOI: 10.1155/2022/5834258
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/5834258
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/5834258?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. Lizheng Guo & Tao Yan & Shuguang Zhao & Changyuan Jiang, 2014. "Dynamic Performance Optimization for Cloud Computing Using M/M/m Queueing System," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    2. Lizheng Guo & Tao Yan & Shuguang Zhao & Changyuan Jiang, 2014. "Dynamic Performance Optimization for Cloud Computing Using M/M/m Queueing System," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-8, March.
    3. Steve Drekic & David A. Stanford, 2001. "Reducing Delay in Preemptive Repeat Priority Queues," Operations Research, INFORMS, vol. 49(1), pages 145-156, February.
    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. Alaba Olu Akingbesote & Mathew Olusegun Adigun & Sibisuso Xulu & Edgar Jembere, 2014. "Performance Modeling of Proposed GUISET Middleware for Mobile Healthcare Services in E‐Marketplaces," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    2. Sunil K. Panigrahi & Veena Goswami & Hemant K. Apat & Ganga B. Mund & Himansu Das & Rabindra K. Barik, 2023. "PQ-Mist : Priority Queueing-Assisted Mist–Cloud–Fog System for Geospatial Web Services," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
    3. Corsaro, Stefania & Kyriakou, Ioannis & Marazzina, Daniele & Marino, Zelda, 2019. "A general framework for pricing Asian options under stochastic volatility on parallel architectures," European Journal of Operational Research, Elsevier, vol. 272(3), pages 1082-1095.
    4. Janani, B., 2022. "Transient Analysis of Differentiated Breakdown Model," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    5. Yingda Song & Ning Cai & Steven Kou, 2018. "Computable Error Bounds of Laplace Inversion for Pricing Asian Options," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 634-645, January.
    6. Steve Derkic & James E. Stafford, 2002. "Symbolic Computation of Moments in Priority Queues," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 261-277, August.

    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:jnljam:v:2022:y:2022:i:1:n:5834258. 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://onlinelibrary.wiley.com/journal/4185 .

    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.