IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v331y2023i2d10.1007_s10479-023-05588-9.html
   My bibliography  Save this article

Resource optimization in $$\textit{MMAP[2]/PH[2]/S}$$ MMAP [ 2 ] / PH [ 2 ] / S priority queueing model with threshold $$\textit{PH}$$ PH retrial times and the preemptive resume policy

Author

Listed:
  • Raina Raj

    (Indian Institute of Technology)

  • Vidyottama Jain

    (Central University of Rajasthan)

Abstract

The findings of this article expounds a multi-server priority queueing model by taking into account the preemptive resume priority scheduling and threshold based phase-type distribution ( $$P\!H\!D$$ P H D ) for retrial process. On the basis of priority, the incoming heterogeneous traffic is categorized as high priority traffic ( $$H\!P\!T$$ H P T ) and low priority traffic ( $$L\!P\!T$$ L P T ). When all the channels are busy, an arriving $$L\!P\!T$$ L P T will be denied for the service, and it will enter the orbit (virtual space) to retry after some time. The retrial process will follow $$P\!H\!D$$ P H D when the number of $$L\!P\!T$$ L P T is less than some threshold value otherwise the retrial process will follow exponential distribution. One of the following two instances may occur when all of the channels are occupied and a $$H\!P\!T$$ H P T enters the system. In the first instance, the arriving $$H\!P\!T$$ H P T will be discarded from the system if all the channels are packed with $$H\!P\!T$$ H P T solely. On the contrary, in the second instance, the approaching $$H\!P\!T$$ H P T will be provided service by employing preemptive priority when at least one $$L\!P\!T$$ L P T is receiving service, and that preempted $$L\!P\!T$$ L P T will enter a buffer of finite capacity. Whenever an idle channel is found, the preempted $$L\!P\!T$$ L P T will begin its service from the termination phase. The level dependent quasi-birth-death process is used for the modeling and analysis of the proposed framework. By establishing that the proposed Markov chain satisfies the asymptotically quasi-Toeplitz Markov chain classification, the ergodicity conditions for the chain are demonstrated. For the numerical illustration, the expressions of several performance measures have been developed. The non-dominated sorting genetic algorithm-II approach has been used to address an optimization problem for resource optimization and traffic control.

Suggested Citation

  • Raina Raj & Vidyottama Jain, 2023. "Resource optimization in $$\textit{MMAP[2]/PH[2]/S}$$ MMAP [ 2 ] / PH [ 2 ] / S priority queueing model with threshold $$\textit{PH}$$ PH retrial times and the preemptive resume policy," Annals of Operations Research, Springer, vol. 331(2), pages 1119-1148, December.
  • Handle: RePEc:spr:annopr:v:331:y:2023:i:2:d:10.1007_s10479-023-05588-9
    DOI: 10.1007/s10479-023-05588-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05588-9
    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/s10479-023-05588-9?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.

    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:331:y:2023:i:2:d:10.1007_s10479-023-05588-9. 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.