IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v57y2020i1d10.1007_s12597-019-00408-w.html
   My bibliography  Save this article

Unified killing mechanism in a single server queue with renewal input

Author

Listed:
  • Nitin Kumar

    (Indian Institute of Technology)

  • F. P. Barbhuiya

    (Indian Institute of Technology)

  • U. C. Gupta

    (Indian Institute of Technology)

Abstract

Queueing systems experienced in real-life situations are very often influenced by negative arrivals which are independent of service process and cause the elimination of jobs from the system. Such a scenario occurs in computer network and telecommunication systems where an attack by a malicious virus results in the removal of some or all data files from the system. Along this direction many authors have proposed various killing processes in the past. This paper unifies different killing mechanisms into the classical single server queue having infinite capacity, where arrival occurs as renewal process with exponential service time distribution. The system is assumed to be affected by negative customers as well as disasters. The model is investigated in steady-state in a very simple and elegant way by means of supplementary variable and difference equation technique. The distribution of system-content for the positive customers is derived in an explicit form at pre-arrival and random epochs. The influence of different parameters on the system performance are also examined.

Suggested Citation

  • Nitin Kumar & F. P. Barbhuiya & U. C. Gupta, 2020. "Unified killing mechanism in a single server queue with renewal input," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 246-259, March.
    • Handle: RePEc:spr:opsear:v:57:y:2020:i:1:d:10.1007_s12597-019-00408-w
    DOI: 10.1007/s12597-019-00408-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-019-00408-w
    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-019-00408-w?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. F. P. Barbhuiya & U. C. Gupta, 2019. "Discrete-time queue with batch renewal input and random serving capacity rule: $$GI^X/ Geo^Y/1$$ G I X / G e o Y / 1," Queueing Systems: Theory and Applications, Springer, vol. 91(3), pages 347-365, April.
    2. F. P. Barbhuiya & Nitin Kumar & U. C. Gupta, 2019. "Batch Renewal Arrival Process Subject to Geometric Catastrophes," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 69-83, March.
    3. Artalejo, J. R., 2000. "G-networks: A versatile approach for work removal in queueing networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 233-249, October.
    4. P., Vijaya Laxmi & M.L., Soujanya, 2015. "Perishable inventory system with service interruptions, retrial demands and negative customers," Applied Mathematics and Computation, Elsevier, vol. 262(C), pages 102-110.
    5. 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.
    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. V. Radhamani & B. Sivakumar & G. Arivarignan, 2022. "A Comparative Study on Replenishment Policies for Perishable Inventory System with Service Facility and Multiple Server Vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 229-265, March.
    2. F. Avram & A. Gómez-Corral, 2006. "On bulk-service MAP/PH L,N /1/N G-Queues with repeated attempts," Annals of Operations Research, Springer, vol. 141(1), pages 109-137, January.
    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. Junping Li, 2024. "Birth–Death Processes with Two-Type Catastrophes," Mathematics, MDPI, vol. 12(10), pages 1-17, May.
    5. Altay, Nezih & Green III, Walter G., 2006. "OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 175(1), pages 475-493, November.
    6. Wang, Jinting & Liu, Bin & Li, Jianghua, 2008. "Transient analysis of an M/G/1 retrial queue subject to disasters and server failures," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1118-1132, September.
    7. Chi, Hong & Li, Jialian & Shao, Xueyan & Gao, Mingang, 2017. "Timeliness evaluation of emergency resource scheduling," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1022-1032.
    8. Afshar-Nadjafi, Behrouz & Mashatzadeghan, Hamidreza & Khamseh, Alireza, 2016. "Time-dependent demand and utility-sensitive sale price in a retailing system," Journal of Retailing and Consumer Services, Elsevier, vol. 32(C), pages 171-174.
    9. Caunhye, Aakil M. & Nie, Xiaofeng & Pokharel, Shaligram, 2012. "Optimization models in emergency logistics: A literature review," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 4-13.
    10. Janssen, Larissa & Claus, Thorsten & Sauer, Jürgen, 2016. "Literature review of deteriorating inventory models by key topics from 2012 to 2015," International Journal of Production Economics, Elsevier, vol. 182(C), pages 86-112.
    11. Ivan Atencia & José Luis Galán-García, 2021. "Sojourn Times in a Queueing System with Breakdowns and General Retrial Times," Mathematics, MDPI, vol. 9(22), pages 1-25, November.
    12. Arnon Arazi & Eshel Ben-Jacob & Uri Yechiali, 2005. "Controlling an oscillating Jackson-type network having state-dependent service rates," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 453-466, December.
    13. Balsamo, Simonetta & Marin, Andrea, 2013. "Separable solutions for Markov processes in random environments," European Journal of Operational Research, Elsevier, vol. 229(2), pages 391-403.
    14. Leite, Saul C. & Fragoso, Marcelo D., 2013. "Diffusion approximation for signaling stochastic networks," Stochastic Processes and their Applications, Elsevier, vol. 123(8), pages 2957-2982.
    15. 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.
    16. A Rodrigo & M Vazquez & C Carrera, 2006. "Markovian networks in labour markets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 526-531, May.
    17. Nitin Kumar & Umesh Chandra Gupta, 2022. "Markovian Arrival Process Subject to Renewal Generated Binomial Catastrophes," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 2287-2312, December.
    18. Sayarshad, Hamid R. & Du, Xinpi & Gao, H. Oliver, 2020. "Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 352-372.
    19. Veena Goswami & Gopinath Panda, 2024. "Analysis of Renewal Batch Arrival Queues with Multiple Vacations and Geometric Abandonment," Methodology and Computing in Applied Probability, Springer, vol. 26(2), pages 1-27, June.
    20. Atencia, I., 2017. "A Geo/G/1 retrial queueing system with priority services," European Journal of Operational Research, Elsevier, vol. 256(1), pages 178-186.

    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:1:d:10.1007_s12597-019-00408-w. 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.