IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v25y2025i3d10.1007_s12351-025-00963-9.html
   My bibliography  Save this article

Economic and reliability analysis of discrete-time G-queue with multi-optional services and Bernoulli feedback

Author

Listed:
  • Rakhee Kulshrestha

    (Birla Institute of Technology and Science)

  • Ajay Singh

    (Birla Institute of Technology and Science)

  • Shruti Goel

    (Netaji Subhas University of Technology)

Abstract

Cellular networks play a crucial role in modern telecommunications, supporting growing numbers of mobile users and various call types ranging from voice calls to multimedia data sessions. Efficient call handling is essential to ensure reliable and timely connections, optimal resource utilization, and a satisfactory Quality of Service (QoS). This study analyzes various call types in cellular networks using a discrete-time queueing model. Specifically, we investigate a discrete-time Geo/Geo/1 G-queue characterized by an unreliable server, k-optional services, and Bernoulli feedback mechanisms. Furthermore, within the framework of this queuing model, various call types are treated as positive customers, while virus attacks are considered negative customers. The arrival of a negative customer interrupts an ongoing service, leading to a server failure. Additionally, we assume that all arriving customers (positive) must undergo the First Essential Service (FES). After completing the FES, the server offers further services, allowing customers to either select one of the k-optional services, rejoin the queue for another FES, or leave the system if they do not wish to utilize additional services. Then, the entire system is modeled as a two-dimensional discrete-time Markov chain, and the matrix-geometric method is utilized to compute the steady-state probability vector, which is then employed to evaluate the numerical results of various performance metrics that depend on the queueing and reliability analysis. Finally, a cost model is established, and the Quasi-Newton method and Particle swarm optimization (PSO) technique are employed to achieve optimal operating conditions with minimal expected cost.

Suggested Citation

  • Rakhee Kulshrestha & Ajay Singh & Shruti Goel, 2025. "Economic and reliability analysis of discrete-time G-queue with multi-optional services and Bernoulli feedback," Operational Research, Springer, vol. 25(3), pages 1-32, September.
    • Handle: RePEc:spr:operea:v:25:y:2025:i:3:d:10.1007_s12351-025-00963-9
    DOI: 10.1007/s12351-025-00963-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-025-00963-9
    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/s12351-025-00963-9?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Guy Latouche & P. G. Taylor, 2003. "Drift Conditions for Matrix-Analytic Models," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 346-360, May.
    2. Upadhyaya, Shweta, 2016. "Performance prediction of a discrete-time batch arrival retrial queue with Bernoulli feedback," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 108-119.
    3. Mouloud Cherfaoui & Amina Angelika Bouchentouf & Mohamed Boualem, 2023. "Modelling and simulation of Bernoulli feedback queue with general customers' impatience under variant vacation policy," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 46(4), pages 451-480.
    4. R. Sudhesh & R. Sebasthi Priya, 2019. "An analysis of discrete-time Geo/Geo/1 queue with feedback, repair and disaster," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 35(1), pages 37-53.
    5. Torben Meisling, 1958. "Discrete-Time Queuing Theory," Operations Research, INFORMS, vol. 6(1), pages 96-105, February.
    6. Wei Xu & Liwei Liu & Linhong Li & Zhen Wang & Sabine Wittevrongel, 2023. "Analysis of a Collision-Affected M/GI/1/ /N Retrial Queuing System Considering Negative Customers and Transmission Errors," Mathematics, MDPI, vol. 11(16), pages 1-23, August.
    7. Shweta Upadhyaya, 2020. "Cost optimisation of a discrete-time retrial queue with Bernoulli feedback and starting failure," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 36(2), pages 165-196.
    8. Harrison, Peter G. & Patel, Naresh M. & Pitel, Edwige, 2000. "Reliability modelling using G-queues," European Journal of Operational Research, Elsevier, vol. 126(2), pages 273-287, October.
    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. Wang, Yong & Wei, Zikai & Luo, Siyu & Zhou, Jingxin & Zhen, Lu, 2024. "Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    2. Anis Chettouf & Amina Angelika Bouchentouf & Mohamed Boualem, 2024. "A Markovian Queueing Model for Telecommunications Support Center with Breakdowns and Vacation Periods," SN Operations Research Forum, Springer, vol. 5(1), pages 1-26, March.
    3. 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.
    4. I. Atencia & A. Pechinkin, 2013. "A discrete-time queueing system with optional LCFS discipline," Annals of Operations Research, Springer, vol. 202(1), pages 3-17, January.
    5. Hui-Yu Zhang & Qing-Xin Chen & James MacGregor Smith & Ning Mao & Ai-Lin Yu & Zhan-Tao Li, 2017. "Performance analysis of open general queuing networks with blocking and feedback," International Journal of Production Research, Taylor & Francis Journals, vol. 55(19), pages 5760-5781, October.
    6. 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.
    7. Sofian Clercq & Bart Steyaert & Sabine Wittevrongel & Herwig Bruneel, 2016. "Analysis of a discrete-time queue with time-limited overtake priority," Annals of Operations Research, Springer, vol. 238(1), pages 69-97, March.
    8. Nada Riheb Yatim & Amina Angelika Bouchentouf & Pikkala Vijaya Laxmi, 2024. "A queueing model for an automatic manufacturing system with disasters, breakdowns and vacations. Optimal design and analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(4), pages 231-250.
    9. R. Harini & K. Indhira, 2024. "Dynamical modelling and cost optimization of a 5G base station for energy conservation using feedback retrial queue with sleeping strategy," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 86(4), pages 661-690, August.
    10. Sofian Clercq & Bart Steyaert & Sabine Wittevrongel & Herwig Bruneel, 2016. "Analysis of a discrete-time queue with time-limited overtake priority," Annals of Operations Research, Springer, vol. 238(1), pages 69-97, March.
    11. Gabi Hanukov & Uri Yechiali, 2024. "Orbit while in service," Operational Research, Springer, vol. 24(2), pages 1-32, June.
    12. Upadhyaya, Shweta, 2016. "Performance prediction of a discrete-time batch arrival retrial queue with Bernoulli feedback," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 108-119.
    13. 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.
    14. Wu, Shipei & Lan, Shaojun, 2025. "Analysis of repairable discrete-time queueing systems with negative customers, disasters, balking customers and interruptible working vacations under Bernoulli schedule," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 232(C), pages 102-122.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:operea:v:25:y:2025:i:3:d:10.1007_s12351-025-00963-9. 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.