Mathematical Modeling of Multi-Server Queueing Model for Vacations and Impatient Customer

Main Article Content

Kanta Malik


The combination of excursions and the powerful treatment of fretful clients are at the focal point of this review, which digs into the streamlining of multi-server queueing frameworks. Modified Priority Queue Algorithm (MPQA), Vacation Scheduling Algorithm (VSA), Impatience Handling Algorithm (IHA), and Server Utilization Balancing Algorithm (SUBA) are the four calculations that have been proposed and thoroughly assessed through recreations to decide their viability in decreasing line length, holding up time, and improving framework throughput and server usage. The MPQA shines on clients considering anxiety cutoff points and organization times, showing suitability in decreasing holding-up times. Then again, VSA continuously changes server get-away, yielding lower holding-up times during fame periods. IHA progressively oversees eagerness, diminishing takeoffs brought about by fretfulness and expanding framework throughput in general. SUBA in a perfect world adjusts server use, achieving additionally created throughput and system strength. The extraordinary commitments of each calculation are revealed in examinations with related work. VSA is in accordance with past examinations an extended get-away streamlining, while MPQA works on traditional ways to deal with prioritization. IHA presents dynamic energy dealing with, and SUBA lines up with liability careful server activation systems found in the composition. This assessment basically advances the appreciation of multi-server queueing systems, offering valuable solutions for organization arranged conditions. An establishment for future improvements in queueing hypothesis and genuine applications is given by the calculations, which were assessed with significant outcomes.

Article Details

How to Cite
Malik, K. . (2023). Mathematical Modeling of Multi-Server Queueing Model for Vacations and Impatient Customer. International Journal on Recent and Innovation Trends in Computing and Communication, 11(11), 223–230.