{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:18:06Z","timestamp":1760426286379,"version":"3.41.0"},"reference-count":39,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T00:00:00Z","timestamp":1750377600000},"content-version":"vor","delay-in-days":50,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["201610199178"],"award-info":[{"award-number":["201610199178"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["221610069610"],"award-info":[{"award-number":["221610069610"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2025,5,8]]},"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:p>The wireless communication systems can be modeled using discrete-time multi-class priority queues. Also, it is desired to reduce energy consumption in these systems, which can be achieved by implementing a vacation policy with priority queues. This study investigates a <jats:italic>Geo\/Geo\/<\/jats:italic>1 multi-class priority G-queue system featuring a vacation policy and server breakdowns. In this model, customers arrive at discrete time intervals and are classified into three priority classes. Virus attacks (considered hostile customers) may disrupt the server\u2019s functionality during the service, leading to interruptions. If the server has completed serving all classes of customers and no customers are waiting in the queues, it will go on vacation. The entire system is represented as a three-dimensional Markov chain, and its transient behavior is analyzed using the recursive method. By utilizing transient probability distribution, we compute various performance metrics for the system, taking both reliability and queueing analyses into account. In conclusion, we develop a cost function based on successful customer transmissions, and then the quasi-Newton method and particle swarm optimization (PSO) algorithm are used to determine the optimal reward cost.<\/jats:p>","DOI":"10.1051\/ro\/2025060","type":"journal-article","created":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T18:45:12Z","timestamp":1747161912000},"page":"1645-1664","source":"Crossref","is-referenced-by-count":1,"title":["Reliability and transient analysis of discrete-time multi-class priority queue with energy saving vacation policy"],"prefix":"10.1051","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5278-0390","authenticated-orcid":false,"given":"Rakhee","family":"Kulshrestha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8089-5934","authenticated-orcid":false,"given":"Ajay","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6450-0018","authenticated-orcid":false,"given":"Pooja","family":"Yadav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"R1","unstructured":"Robertazzi T.G., Computer Networks and Systems: Queueing Theory and Performance Evaluation. Springer Science & Business Media (2000)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"3015","DOI":"10.1007\/s11277-022-09908-3","volume":"127","author":"Goel","year":"2022","journal-title":"Wireless Pers. Commun."},{"key":"R3","first-page":"1","volume":"12","author":"Miao","year":"2016","journal-title":"ACM Trans. Multimedia Comput. Commun. App. (TOMM)"},{"key":"R4","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.13.5.820","volume":"13","author":"Chang","year":"1965","journal-title":"Oper. Res."},{"key":"R5","first-page":"1","volume":"2016","author":"Jin","year":"2016","journal-title":"Mobile Inf. Syst."},{"key":"R6","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/B978-0-444-82031-0.50080-9","volume":"1","author":"Wagner","year":"1994","journal-title":"Teletraffic Sci. Eng."},{"key":"R7","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1016\/S0140-3664(02)00035-X","volume":"25","author":"Tham","year":"2002","journal-title":"Comput. Commun."},{"key":"R8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11134-005-0359-y","volume":"50","author":"Sleptchenko","year":"2005","journal-title":"Queue. Syst."},{"key":"R9","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1016\/j.comcom.2007.12.033","volume":"31","author":"Iftikhar","year":"2008","journal-title":"Comput. Commun."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Snipas M. and Valakevicius E., Numerical-analytic model of multi-class, multi-server queue with nonpreemptive priorities, in Innovations and Advances in Computer Sciences and Engineering. Springer, Dordrecht (2009) 413\u2013415.","DOI":"10.1007\/978-90-481-3658-2_72"},{"key":"R11","doi-asserted-by":"crossref","first-page":"1444","DOI":"10.1109\/TCOMM.2009.05.070376","volume":"57","author":"Jin","year":"2009","journal-title":"IEEE Trans. Commun."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy A., Narayanan V.C. and Chakravarthy S.R., The impact of priority generations in a multi-priority queueing system \u2013 a simulation approach, in Proceedings of the 2009 Winter Simulation Conference (WSC). IEEE (2009) 1622\u20131633.","DOI":"10.1109\/WSC.2009.5429269"},{"key":"R13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s11134-015-9460-z","volume":"81","author":"Sleptchenko","year":"2015","journal-title":"Queue. Syst."},{"key":"R14","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1080\/15326349.2016.1193753","volume":"32","author":"Fajardo","year":"2016","journal-title":"Stoch. Models"},{"key":"R15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/ACCESS.2019.2959351","volume":"8","author":"Kamath","year":"2019","journal-title":"IEEE Access"},{"key":"R16","first-page":"1","volume":"8","author":"Lee","year":"2020","journal-title":"Mathematics"},{"key":"R17","first-page":"1","volume":"9","author":"Dudin","year":"2021","journal-title":"Mathematics"},{"key":"R18","first-page":"1","volume":"10","author":"Alotaibi","year":"2021","journal-title":"Electronics"},{"key":"R19","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.2020.2075","volume":"70","author":"Liu","year":"2022","journal-title":"Oper. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"16361","DOI":"10.1007\/s12652-022-03857-2","volume":"14","author":"Chen","year":"2023","journal-title":"J. Amb. Intell. Human. Comput."},{"key":"R21","doi-asserted-by":"crossref","first-page":"3075","DOI":"10.1007\/s11276-024-03715-3","volume":"30","author":"Kulshrestha","year":"2024","journal-title":"Wireless Netw."},{"key":"R22","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.comcom.2024.01.007","volume":"216","author":"Kulshrestha","year":"2024","journal-title":"Comput. Commun."},{"key":"R23","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1109\/TNSM.2024.3354793","volume":"21","author":"Wu","year":"2024","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"R24","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11134-024-09903-4","volume":"106","author":"Hillas","year":"2024","journal-title":"Queue. Syst."},{"key":"R25","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1080\/24725854.2023.2261569","volume":"56","author":"Chen","year":"2024","journal-title":"IISE Trans."},{"key":"R26","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s12597-012-0097-y","volume":"50","author":"Sharma","year":"2013","journal-title":"Opsearch"},{"key":"R27","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/nav.21537","volume":"60","author":"Sahba","year":"2013","journal-title":"Nav. Res. Logistics (NRL)"},{"key":"R28","doi-asserted-by":"crossref","first-page":"1537","DOI":"10.1016\/S0305-0548(03)00107-2","volume":"31","author":"Atencia","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"R29","doi-asserted-by":"crossref","unstructured":"Rakhee and Shruti, Discrete-time analysis of communication networks with second optional service and negative user arrivals, in Communication and Intelligent Systems: Proceedings of ICCIS 2019. Springer Singapore, Singapore (2020) 243\u2013257.","DOI":"10.1007\/978-981-15-3325-9_19"},{"key":"R30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2023.115679","volume":"441","author":"Sanga","year":"2024","journal-title":"J. Comput. Appl. Math."},{"key":"R31","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1080\/15326349608807394","volume":"12","author":"Moutzoukis","year":"1996","journal-title":"Stoch. Models"},{"key":"R32","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/S0305-0548(96)00076-7","volume":"24","author":"Artalejo","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"R33","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1007\/s10479-023-05216-6","volume":"331","author":"Nekrasova","year":"2023","journal-title":"Ann. Oper. Res."},{"key":"R34","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s10255-013-0244-0","volume":"29","author":"Wang","year":"2013","journal-title":"Acta Math. App. Sin. English Ser."},{"key":"R35","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/s40819-022-01445-8","volume":"8","author":"Vaishnawi","year":"2022","journal-title":"Int. J. Appl. Comput. Math."},{"key":"R36","doi-asserted-by":"crossref","unstructured":"Nocedal J. and Wright S.J., Numerical Optimization. Springer (1999).","DOI":"10.1007\/b98874"},{"key":"R37","doi-asserted-by":"crossref","unstructured":"Kennedy J. and Eberhart R., Particle swarm optimization, in Proceedings of ICNN\u201995-International Conference on Neural Networks. Vol. 4. IEEE (1995) 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"R38","doi-asserted-by":"crossref","unstructured":"Shi Y. and Eberhart R.C., Parameter selection in particle swarm optimization, in Evolutionary Programming VII: 7th International Conference, EP98 San Diego, California, USA, March 25\u201327, 1998 Proceedings 7 (1998) 591\u2013600.","DOI":"10.1007\/BFb0040810"},{"key":"R39","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1007\/s00521-011-0786-0","volume":"22","author":"Sheikhan","year":"2013","journal-title":"Neural Comput. App."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025060\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T07:50:22Z","timestamp":1750405822000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":39,"journal-issue":{"issue":"3"},"alternative-id":["ro240443"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2025060","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}