IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v198y2012i1p83-12310.1007-s10479-011-0910-7.html
   My bibliography  Save this article

Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms

Author

Listed:
  • Tetsuji Hirayama

Abstract

We consider multiclass Markovian polling systems with feedback and analyze their average performance measures. Scheduling in polling systems has many applications in computer and communication systems. We utilize the framework that has been effectively used to analyze various composite scheduling algorithms in many types of multiclass queues systematically in conjunction with the functional computation method (Hirayama in Naval Research Logistics 50:719–741, 2003 ; Journal of the Operations Research Society of Japan 48:226–255, 2005 ; Advances in queueing theory and network applications, pp. 119–146, Springer, New York, 2009a ; Journal of Industrial and Management Optimization 6:541–568, 2010 ). We define the conditional expected values of the performance measures such as the sojourn times as functions of the system state and find their expressions by solving some equations. Then from these expressions, we derive the average numbers of customers and the average sojourn times for all service stages of customers circulating the system. We consider their application to a packet scheduling problem where multiple categories of packets share a resource. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:198:y:2012:i:1:p:83-123:10.1007/s10479-011-0910-7
    DOI: 10.1007/s10479-011-0910-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-0910-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-011-0910-7?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. Martin Eisenberg, 1972. "Queues with Periodic Service and Changeover Time," Operations Research, INFORMS, vol. 20(2), pages 440-451, April.
    2. D. Sarkar & W. I. Zangwill, 1989. "Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems---Exact Results and Applications," Management Science, INFORMS, vol. 35(12), pages 1463-1474, December.
    3. Mandyam M. Srinivasan, 1991. "Nondeterministic Polling Systems," Management Science, INFORMS, vol. 37(6), pages 667-681, June.
    4. 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.
    5. Leonard Kleinrock & Hanoch Levy, 1988. "The Analysis of Random Polling Systems," Operations Research, INFORMS, vol. 36(5), pages 716-732, October.
    6. R.D. van der Mei, 2002. "Waiting-Time Distributions in Polling Systems with Simultaneous Batch Arrivals," Annals of Operations Research, Springer, vol. 113(1), pages 155-173, July.
    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. Vladimir Vishnevsky & Olga Semenova, 2021. "Polling Systems and Their Application to Telecommunication Networks," Mathematics, MDPI, vol. 9(2), pages 1-30, January.
    2. 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.

    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. Jelmer P. Gaast & Ivo J. B. F. Adan & René B. M. Koster, 2017. "The analysis of batch sojourn-times in polling systems," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 313-335, April.
    2. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case," Economics Working Papers 302, Department of Economics and Business, Universitat Pompeu Fabra, revised Jul 1998.
    3. Dieter Fiems & Eitan Altman, 2012. "Gated polling with stationary ergodic walking times, Markovian routing and random feedback," Annals of Operations Research, Springer, vol. 198(1), pages 145-164, September.
    4. Mahender P. Singh & Mandyam M. Srinivasan, 2007. "Performance Bounds for Flexible Systems Requiring Setups," Management Science, INFORMS, vol. 53(6), pages 991-1004, June.
    5. Bertsimas, Dimitris., 1995. "The achievable region method in the optimal control of queueing systems : formulations, bounds and policies," Working papers 3837-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    6. Broersma, Andreas L. A. & Sierksma, Gerard & Wijngaard, Jacob, 2002. "Decomposed vs integrated control of a one-stage production system," European Journal of Operational Research, Elsevier, vol. 138(3), pages 569-577, May.
    7. Saffer, Zsolt & Telek, Miklós, 2009. "Stability of periodic polling system with BMAP arrivals," European Journal of Operational Research, Elsevier, vol. 197(1), pages 188-195, August.
    8. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    9. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    10. Subhashish Samaddar & Thomas Whalen, 2008. "Improving Performance in Cyclic Production Systems by Using Forced Variable Idle Setup Time," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 173-180, August.
    11. Jan-Kees Ommeren & Ahmad Al Hanbali & Richard J. Boucherie, 2020. "Analysis of polling models with a self-ruling server," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 77-107, February.
    12. Broersma, A.L.A. & Sierksma, G. & Wijngaard, J., 1999. "Decomposed versus integrated control of a one-stage production system," Research Report 99A18, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    13. Gupta, Diwakar & Gunalay, Yavuz & Srinivasan, Mandyam M., 2001. "The relationship between preventive maintenance and manufacturing system performance," European Journal of Operational Research, Elsevier, vol. 132(1), pages 146-162, July.
    14. 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.
    15. Marko A. A. Boon & Onno J. Boxma & Offer Kella & Masakiyo Miyazawa, 2017. "Queue-length balance equations in multiclass multiserver queues and their generalizations," Queueing Systems: Theory and Applications, Springer, vol. 86(3), pages 277-299, August.
    16. M. Boon, 2012. "A polling model with reneging at polling instants," Annals of Operations Research, Springer, vol. 198(1), pages 5-23, September.
    17. Christos Langaris, 1999. "Markovian polling systems with mixed service disciplines and retrial customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 305-322, December.
    18. Wu, Kan, 2014. "Taxonomy of batch queueing models in manufacturing systems," European Journal of Operational Research, Elsevier, vol. 237(1), pages 129-135.
    19. Lillo, Rosa E., 2005. "Ergodicity and analysis of the process describing the system state in polling systems with two queues," European Journal of Operational Research, Elsevier, vol. 167(1), pages 144-162, November.
    20. Kamath B, Narasimha & Bhattacharya, Subir, 2007. "Lead time minimization of a multi-product, single-processor system: A comparison of cyclic policies," International Journal of Production Economics, Elsevier, vol. 106(1), pages 28-40, March.

    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:198:y:2012:i:1:p:83-123:10.1007/s10479-011-0910-7. 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.