IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v61y2024i4d10.1007_s12597-024-00742-8.html
   My bibliography  Save this article

Cost scrutiny of discrete-time priority queue with cluster arrival and Bernoulli feedback

Author

Listed:
  • Vaishnawi Shree

    (Amity University)

  • Shweta Upadhyaya

    (Amity University)

  • Rakhee Kulshrestha

    (BITS Pilani)

Abstract

This work describes the economic feasibility of a single server discrete-time queueing model, (Geo/G/1) where interarrival times have a geometric distribution, and service times have a general distribution. This work is motivated by the case of discrete-time queueing models under priority scheme for solving many congestion issues of the telecommunication system wherein few calls are treated as prioritized calls and system manager may handle it properly. Herein a state-dependent arrival policy is used. It is assumed that the clients arrive in groups of varying sizes, and incorporates only one server queueing system with unlimited capacity. Under a discrete-time system with Markovian service practice, clients are serviced one at a time. If a client is dissatisfied with his service, he will most likely be directed back to the front of the queue. This concept is commonly referred to as Bernoulli feedback (BF) in queueing scenario. Just after every service, it is presumed that the server either starts to identify the next client to be serviced with some probability, or the server starts a solo vacation procedure with its complementary probability and this process is referred as Bernoulli vacation (BV). In addition, preferred and impatient clients are examined too. We investigate the Markov chain that underpins the queueing system in question, and its normalizing condition. The average number of consumers in the queue and the system are found using a generating function method. The numeral expositions are ascertained to delve the impact of different parameters on various performance metrics which can give information to system management in order to monitor the system's functioning condition and decrease congestion. We then used direct search method (DSM) and Particle Swarm Optimization (PSO) approaches to present a comparative study to assist system administrators or decision-makers by economically regulating the system. Furthermore, the results of the provided model are contrasted to those of a soft computing approach termed as ANFIS (Adaptive Neuro-Fuzzy Inference System).

Suggested Citation

  • Vaishnawi Shree & Shweta Upadhyaya & Rakhee Kulshrestha, 2024. "Cost scrutiny of discrete-time priority queue with cluster arrival and Bernoulli feedback," OPSEARCH, Springer;Operational Research Society of India, vol. 61(4), pages 2312-2345, December.
    • Handle: RePEc:spr:opsear:v:61:y:2024:i:4:d:10.1007_s12597-024-00742-8
    DOI: 10.1007/s12597-024-00742-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00742-8
    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-024-00742-8?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. Shan Gao & Xianchao Wang, 2019. "Analysis of a Single Server Retrial Queue with Server Vacation and Two Waiting Buffers Based on ATM Networks," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-14, November.
    2. Jeongsim Kim & Bara Kim, 2016. "A survey of retrial queueing systems," Annals of Operations Research, Springer, vol. 247(1), pages 3-36, December.
    3. Shweta Upadhyaya & Geetika Malik & Richa Sharma, 2022. "Neuro-fuzzy computing and optimisation results for batch discrete time retrial queue," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 23(1), pages 119-146.
    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. KM Rashmi & S. K. Samanta, 2024. "Analysis of Two-Way Communication in $$M_1^X, M_2/G_1,G_2/1$$ M 1 X , M 2 / G 1 , G 2 / 1 Retrial Queue Under the Constant Retrial Policy," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-32, December.
    2. Se Won Lee & Bara Kim & Jeongsim Kim, 2022. "Analysis of the waiting time distribution in M/G/1 retrial queues with two way communication," Annals of Operations Research, Springer, vol. 310(2), pages 505-518, March.
    3. 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.
    4. Bin Liu & Jie Min & Yiqiang Q. Zhao, 2023. "Refined tail asymptotic properties for the $$M^X/G/1$$ M X / G / 1 retrial queue," Queueing Systems: Theory and Applications, Springer, vol. 104(1), pages 65-105, June.
    5. Lamia Lakaour & Djamil Aïssani & Karima Adel-Aissanou & Kamel Barkaoui, 2019. "M/M/1 Retrial Queue with Collisions and Transmission Errors," Methodology and Computing in Applied Probability, Springer, vol. 21(4), pages 1395-1406, December.
    6. Yang, Dong-Yuh & Tsao, Chih-Lung, 2019. "Reliability and availability analysis of standby systems with working vacations and retrial of failed components," Reliability Engineering and System Safety, Elsevier, vol. 182(C), pages 46-55.
    7. 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.
    8. Wang, Kuo-Hsiung & Wu, Chia-Huang & Yen, Tseng-Chang, 2022. "Comparative cost-benefit analysis of four retrial systems with preventive maintenance and unreliable service station," Reliability Engineering and System Safety, Elsevier, vol. 221(C).
    9. Alexandra Borodina & Vladimir Mazalov, 2023. "On the Equilibrium in a Queuing System with Retrials and Strategic Arrivals," Mathematics, MDPI, vol. 11(16), pages 1-15, August.
    10. Julia Chirkova & Vladimir Mazalov & Evsey Morozov, 2022. "Equilibrium in a Queueing System with Retrials," Mathematics, MDPI, vol. 10(3), pages 1-15, January.
    11. 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.
    12. Bin Liu & Yiqiang Q. Zhao, 2022. "Tail Asymptotics for a Retrial Queue with Bernoulli Schedule," Mathematics, MDPI, vol. 10(15), pages 1-13, August.
    13. Dieter Fiems, 2023. "Retrial queues with constant retrial times," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 347-365, April.
    14. Faruk Akın & E. Lerzan Örmeci, 2022. "Optimal control of a loss system with feedback," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 381-383, April.
    15. Bin Liu & Yiqiang Q. Zhao, 2020. "Tail asymptotics for the $$M_1,M_2/G_1,G_2/1$$ M 1 , M 2 / G 1 , G 2 / 1 retrial queue with non-preemptive priority," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 169-199, October.
    16. V., Saravanan & V., Poongothai & P., Godhandaraman, 2023. "Performance analysis of a multi server retrial queueing system with unreliable server, discouragement and vacation model," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 214(C), pages 204-226.
    17. Tzu-Hsin Liu & Kuo-Ching Chiou & Chih-Ming Chen & Fu-Min Chang, 2024. "Multiserver Retrial Queue with Two-Way Communication and Synchronous Working Vacation," Mathematics, MDPI, vol. 12(8), pages 1-14, April.
    18. Bara Kim & Jeongsim Kim, 2020. "Stability of a multi-class multi-server retrial queueing system with service times depending on classes and servers," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 129-146, February.
    19. Wu, Chia-Huang & Yen, Tseng-Chang & Wang, Kuo-Hsiung, 2021. "Availability and Comparison of Four Retrial Systems with Imperfect Coverage and General Repair Times," Reliability Engineering and System Safety, Elsevier, vol. 212(C).
    20. 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.

    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:61:y:2024:i:4:d:10.1007_s12597-024-00742-8. 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.