IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v247y2016i1d10.1007_s10479-015-2005-3.html
   My bibliography  Save this article

Performance analysis of a multiprogramming–multiprocessor retrial queueing system with orderly reattempts

Author

Listed:
  • B. Krishna Kumar

    (Anna University)

  • A. Thanikachalam

    (Anna University)

  • V. Kanakasabapathi

    (Anna University)

  • R. Rukmani

    (Pachaiyappa’s College)

Abstract

This paper deals with retrial queueing models having an unlimited/a finite orbit capacity with control retrial policy of a multiprogramming–multiprocessor computer network system. Under the Markovian assumptions and light-traffic condition, the steady-state probabilities of the number of programs in the system and the mean number of programs in the orbit are studied using matrix geometric/analytic methods. The expressions for the Laplace-Stieglitz transforms of the busy period and the waiting time are obtained. The probability generating function for the number of retrials made by a tagged program is also derived. Some interesting performance measures of the system and the various moments of quantities of interest are discussed. Finally, extensive numerical results are illustrated to reveal the impact of the system parameters on the performance measures.

Suggested Citation

  • B. Krishna Kumar & A. Thanikachalam & V. Kanakasabapathi & R. Rukmani, 2016. "Performance analysis of a multiprogramming–multiprocessor retrial queueing system with orderly reattempts," Annals of Operations Research, Springer, vol. 247(1), pages 319-364, December.
    • Handle: RePEc:spr:annopr:v:247:y:2016:i:1:d:10.1007_s10479-015-2005-3
    DOI: 10.1007/s10479-015-2005-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-2005-3
    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-015-2005-3?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. Donald P. Gaver & Gerald S. Shedler, 1973. "Processor Utilization in Multiprogramming Systems via Diffusion Approximations," Operations Research, INFORMS, vol. 21(2), pages 569-576, April.
    2. Hans Daduna, 1986. "Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory," Operations Research, INFORMS, vol. 34(2), pages 281-288, April.
    3. B. Avi-Itzhak & D. P. Heyman, 1973. "Approximate Queuing Models for Multiprogramming Computer Systems," Operations Research, INFORMS, vol. 21(6), pages 1212-1230, December.
    4. Falin, G. I. & Artalejo, J. R., 1998. "A finite source retrial queue," European Journal of Operational Research, Elsevier, vol. 108(2), pages 409-424, July.
    5. B. Kumar & J Raja, 2006. "On multiserver feedback retrial queues with balking and control retrial rate," Annals of Operations Research, Springer, vol. 141(1), pages 211-232, January.
    6. Artalejo, J. R. & Gomez-Corral, A. & Neuts, M. F., 2001. "Analysis of multiserver queues with constant retrial rate," European Journal of Operational Research, Elsevier, vol. 135(3), pages 569-581, December.
    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. Anatoly Nazarov & János Sztrik & Anna Kvach & Tamás Bérczes, 2019. "Asymptotic analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs," Annals of Operations Research, Springer, vol. 277(2), pages 213-229, June.
    2. B. Krishna Kumar & R. Sankar & R. Navaneetha Krishnan & R. Rukmani, 2023. "Multiserver call center retrial queue under Bernoulli vacation schedule with two-way communication and orbital search," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 84(1), pages 23-51, September.

    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. Tuan Phung-Duc & Wouter Rogiest & Yutaka Takahashi & Herwig Bruneel, 2016. "Retrial queues with balanced call blending: analysis of single-server and multiserver model," Annals of Operations Research, Springer, vol. 239(2), pages 429-449, April.
    2. Konstantin Avrachenkov & Evsey Morozov, 2014. "Stability analysis of GI/GI/c/K retrial queue with constant retrial rate," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(3), pages 273-291, June.
    3. B. Krishna Kumar & R. Sankar & R. Navaneetha Krishnan & R. Rukmani, 2023. "Multiserver call center retrial queue under Bernoulli vacation schedule with two-way communication and orbital search," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 84(1), pages 23-51, September.
    4. Yacov Satin & Evsey Morozov & Ruslana Nekrasova & Alexander Zeifman & Ksenia Kiseleva & Anna Sinitcina & Alexander Sipin & Galina Shilova & Irina Gudkova, 2018. "Upper bounds on the rate of convergence for constant retrial rate queueing model with two servers," Statistical Papers, Springer, vol. 59(4), pages 1271-1282, December.
    5. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    6. Haque, Lani & Armstrong, Michael J., 2007. "A survey of the machine interference problem," European Journal of Operational Research, Elsevier, vol. 179(2), pages 469-482, June.
    7. Eugene Lebedev & Vadym Ponomarov, 2016. "Steady-state analysis of M/M/c/c-type retrial queueing systems with constant retrial rate," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(3), pages 693-704, October.
    8. Anatoly Nazarov & János Sztrik & Anna Kvach & Ádám Tóth, 2022. "Asymptotic Analysis of Finite-Source M/GI/1 Retrial Queueing Systems with Collisions and Server Subject to Breakdowns and Repairs," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1503-1518, September.
    9. Dhingra, Vibhuti & Kumawat, Govind Lal & Roy, Debjit & Koster, René de, 2018. "Solving semi-open queuing networks with time-varying arrivals: An application in container terminal landside operations," European Journal of Operational Research, Elsevier, vol. 267(3), pages 855-876.
    10. Efrosinin, Dmitry & Winkler, Anastasia, 2011. "Queueing system with a constant retrial rate, non-reliable server and threshold-based recovery," European Journal of Operational Research, Elsevier, vol. 210(3), pages 594-605, May.
    11. Seyed Khodadadi & Fariborz Jolai, 2012. "A fuzzy based threshold policy for a single server retrial queue with vacations," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(2), pages 281-297, June.
    12. Dmitry Efrosinin & Anastasia Winkler & Pinzger Martin, 2015. "Confidence Intervals for Performance Measures of M/M/1 Queue with Constant Retrial Policy," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-12, December.
    13. Sonja Otten & Ruslan Krenzler & Lin Xie & Hans Daduna & Karsten Kruse, 2022. "Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 603-648, June.
    14. Mridula Jain & Anamika Jain, 2022. "Genetic algorithm in retrial queueing system with server breakdown and caller intolerance with voluntary service," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(2), pages 582-598, April.
    15. Velika I. Dragieva & Tuan Phung-Duc, 2020. "A finite-source M/G/1 retrial queue with outgoing calls," Annals of Operations Research, Springer, vol. 293(1), pages 101-121, October.
    16. Sofiane Ouazine & Karim Abbas, 2016. "A functional approximation for retrial queues with two way communication," Annals of Operations Research, Springer, vol. 247(1), pages 211-227, December.
    17. Anatoly Nazarov & János Sztrik & Anna Kvach & Ádám Tóth, 2020. "Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs," Annals of Operations Research, Springer, vol. 288(1), pages 417-434, May.
    18. I. Padmavathi & A. Shophia Lawrence & B. Sivakumar, 2016. "A finite-source inventory system with postponed demands and modified M vacation policy," OPSEARCH, Springer;Operational Research Society of India, vol. 53(1), pages 41-62, March.
    19. Jing Jia & Sunderesh S. Heragu, 2009. "Solving Semi-Open Queuing Networks," Operations Research, INFORMS, vol. 57(2), pages 391-401, April.
    20. Lyes Ikhlef & Ouiza Lekadir & Djamil Aïssani, 2016. "MRSPN analysis of Semi-Markovian finite source retrial queues," Annals of Operations Research, Springer, vol. 247(1), pages 141-167, December.

    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:247:y:2016:i:1:d:10.1007_s10479-015-2005-3. 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.