IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v57y2020i3d10.1007_s12597-020-00440-1.html
   My bibliography  Save this article

Investigating a general service retrial queue with damaging and licensed units: an application in local area networks

Author

Listed:
  • Shweta Upadhyaya

    (Amity University)

Abstract

The idea behind queueing modeling of the proposed work originates from its applicability in various real life service systems. The performance indices obtained for the proposed model can be used to enhance the quality-of-service of many computer networks (LANs, etc.), Internet mail servers and radio communication. In these systems, packets or emails or calls are transmitted from various sources to its respective destination. During this transmission, it may be possible that a packet or an email or a call may be lost due to the effect of an unwanted unit such as ‘virus’ in computer system or ‘collision of packets’ in LANs and others. These unwanted units which force the service provider to collapse immediately are referred as ‘damaging unit’ in terms of queueing theory. This collapsed service provider is then sent for becoming renewed again by the technician present in the system, who makes it perfect after renewed process and the service provider resumes its service. The positive units (which are normal units) and the damaging units arrive to the system in Poisson fashion. We consider that the service provider furnish initial stage of compulsory service referred as ‘first stage service’ to each incoming unit while it furnish non-compulsory services (up to the number l) referred as ‘second stage service’ to only those who urge for the same. On the finish of each service or renewed process, the service provider may abandon the service system and go for break referred as vacation with a random vacation time distribution. Moreover, stochastic decomposition laws have been demonstrated for this proposed model. In addition, numerical experiments and sensitivity analysis are also carried out.

Suggested Citation

  • Shweta Upadhyaya, 2020. "Investigating a general service retrial queue with damaging and licensed units: an application in local area networks," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 716-745, September.
    • Handle: RePEc:spr:opsear:v:57:y:2020:i:3:d:10.1007_s12597-020-00440-1
    DOI: 10.1007/s12597-020-00440-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-020-00440-1
    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/s12597-020-00440-1?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. Yonatan Levy & Uri Yechiali, 1975. "Utilization of Idle Time in an M/G/1 Queueing System," Management Science, INFORMS, vol. 22(2), pages 202-211, October.
    2. S. W. Fuhrmann & Robert B. Cooper, 1985. "Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations," Operations Research, INFORMS, vol. 33(5), pages 1117-1129, October.
    3. Gao, Shan & Wang, Jinting, 2014. "Performance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers," European Journal of Operational Research, Elsevier, vol. 236(2), pages 561-572.
    4. Shweta Upadhyaya, 2015. "Admission control of bulk retrial feedback queue with K-optional vacations," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 7(2), pages 215-239.
    5. A. G. Pakes, 1969. "Some Conditions for Ergodicity and Recurrence of Markov Chains," Operations Research, INFORMS, vol. 17(6), pages 1058-1061, December.
    6. Shin, Yang Woo & Moon, Dug Hee, 2011. "Approximation of M/M/c retrial queue with PH-retrial times," European Journal of Operational Research, Elsevier, vol. 213(1), pages 205-209, August.
    7. Jain, Madhu & Bhagat, Amita & Shekhar, Chandra, 2015. "Double orbit finite retrial queues with priority customers and service interruptions," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 324-344.
    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. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    2. P. Rajadurai & V. M. Chandrasekaran & M. C. Saravanarajan, 2016. "Analysis of an M[X]/G/1 unreliable retrial G-queue with orbital search and feedback under Bernoulli vacation schedule," OPSEARCH, Springer;Operational Research Society of India, vol. 53(1), pages 197-223, March.
    3. B. Krishna Kumar & S. Pavai Madheswari & S. Anantha Lakshmi, 2011. "Queuing system with state-dependent controlled batch arrivals and server under maintenance," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 351-379, December.
    4. Jau-Chuan Ke, 2006. "An M/G/1 queue under hysteretic vacation policy with an early startup and un-reliable server," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(2), pages 357-369, May.
    5. R. Harini & K. Indhira, 2024. "Meta heuristic optimization of a batch arrival retrial queue with optional re-service and M-optional vacations," 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. 15(9), pages 4252-4282, September.
    6. Ioannis Dimitriou, 2013. "A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 542-571, October.
    7. B. Kumar & D. Arivudainambi & A. Krishnamoorthy, 2006. "Some results on a generalized M/G/1 feedback queue with negative customers," Annals of Operations Research, Springer, vol. 143(1), pages 277-296, March.
    8. I. Atencia & G. Bouza & P. Moreno, 2008. "An M [X] /G/1 retrial queue with server breakdowns and constant rate of repeated attempts," Annals of Operations Research, Springer, vol. 157(1), pages 225-243, January.
    9. Jennifer Sommer & Joost Berkhout & Hans Daduna & Bernd Heidergott, 2017. "Analysis of Jackson networks with infinite supply and unreliable nodes," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 181-207, October.
    10. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case," Economics Working Papers 314, Department of Economics and Business, Universitat Pompeu Fabra, revised Aug 1998.
    11. Izak Duenyas & Diwakar Gupta & Tava Lennon Olsen, 1998. "Control of a Single-Server Tandem Queueing System with Setups," Operations Research, INFORMS, vol. 46(2), pages 218-230, April.
    12. Venugopal Karthick & Vaidhiyanathan Suvitha & Ramupillai Sudhesh, 2024. "Transient analysis of two heterogeneous servers queueing system with differentiated vacations subject to system disaster, server repair," Sankhya B: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 86(2), pages 751-776, November.
    13. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    14. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 306-330, May.
    15. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    16. George C. Mytalas & Michael A. Zazanis, 2022. "Service with a queue and a random capacity cart: random processing batches and E-limited policies," Annals of Operations Research, Springer, vol. 317(1), pages 147-178, October.
    17. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    18. Jeongsim Kim & Bara Kim, 2016. "A survey of retrial queueing systems," Annals of Operations Research, Springer, vol. 247(1), pages 3-36, December.
    19. Ioannis Dimitriou, 2016. "Queueing analysis of the DRX power saving mechanism in fault-tolerant 3GPP LTE wireless networks," Annals of Operations Research, Springer, vol. 239(2), pages 521-552, April.
    20. Yi Peng & Jinbiao Wu, 2020. "A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations," Mathematics, MDPI, vol. 8(8), pages 1-12, July.

    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:opsear:v:57:y:2020:i:3:d:10.1007_s12597-020-00440-1. 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.