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

Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue

Author

Listed:
  • Jerim Kim

    (University of Seoul)

  • Bara Kim

    (Korea University)

  • Hsing Luh

    (National Chengchi University)

Abstract

We consider an M/G/1 Markovian feedback queue with multi-class customers. We derive functional equations for the stationary distribution of the queue size and the total response time. A system of linear equations is also derived for the moments of the queue size and the total response time distributions. The mean and the variance of the queue size and the total response time can be computed by solving the system of linear equations. By using the Markovian feedback queue with multi-class customers, we also investigate the M/PH/1 weighted round-robin queue. Numerical examples are given to show that moments of the queue sizes and of the total response times can be easily computed for the weighted round-robin queue. As the service quantum shrinks to zero, the moments of the queue sizes and the total response times converge to some limits which should be the moments of the corresponding discriminatory processor sharing queue.

Suggested Citation

  • Jerim Kim & Bara Kim & Hsing Luh, 2019. "Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue," Annals of Operations Research, Springer, vol. 277(2), pages 137-159, June.
    • Handle: RePEc:spr:annopr:v:277:y:2019:i:2:d:10.1007_s10479-018-2917-9
    DOI: 10.1007/s10479-018-2917-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2917-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-018-2917-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.

    References listed on IDEAS

    as
    1. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    2. Tetsuji Hirayama, 2012. "Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms," Annals of Operations Research, Springer, vol. 198(1), pages 83-123, September.
    3. Kiran M. Rege & Bhaskar Sengupta, 1996. "Queue-Length Distribution for the Discriminatory Processor-Sharing Queue," Operations Research, INFORMS, vol. 44(4), pages 653-657, August.
    4. Ralph L. Disney, 1981. "A note on sojourn times in M/G/1 queues with instantaneous, bernoulli feedback," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(4), pages 679-684, December.
    5. Vikram S. Adve & Randolph Nelson, 1994. "The Relationship Between Bernoulli and Fixed Feedback Policies for the M/G/1 Queue," Operations Research, INFORMS, vol. 42(2), pages 380-385, April.
    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. Mark Fackrell & Peter Taylor & Jiesen Wang, 2021. "Strategic customer behavior in an M/M/1 feedback queue," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 223-259, April.
    2. Vladimir Vishnevsky & Olga Semenova, 2021. "Polling Systems and Their Application to Telecommunication Networks," Mathematics, MDPI, vol. 9(2), pages 1-30, January.
    3. H. Thorsdottir & I. M. Verloop, 2016. "Markov-modulated M/G/1-type queue in heavy traffic and its application to time-sharing disciplines," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 29-55, June.
    4. Florian Simatos & Alain Simonian, 2020. "Mobility can drastically improve the heavy traffic performance from $$\frac{1}{1-\varrho }$$11-ϱ to $$\log (1/(1-\varrho ))$$log(1/(1-ϱ))," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 1-28, June.
    5. I. M. Verloop & U. Ayesta & R. Núñez-Queija, 2011. "Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing," Operations Research, INFORMS, vol. 59(3), pages 648-660, June.
    6. Haviv, Moshe & van der Wal, Jan, 2008. "Mean sojourn times for phase-type discriminatory processor sharing systems," European Journal of Operational Research, Elsevier, vol. 189(2), pages 375-386, September.
    7. Tetsuji Hirayama, 2012. "Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms," Annals of Operations Research, Springer, vol. 198(1), pages 83-123, 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:annopr:v:277:y:2019:i:2:d:10.1007_s10479-018-2917-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.

    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.