INSTRUCTIONS

Queuing Theory Module finds basic calculations for Poisson queue with various scenarios

M/M/c/GD/N/∞

This tab of queuing theory solves Multiple Server Queues, where Arrival & Service follows exponential distribution, General Service discipline, Limited Queue Size [Upper limit on system capacity] and infinite calling population.

• Enter the Arrival Rate and choose the Unit of Measurement from the Unit option
• Enter the Service Rate and choose the Unit of Measurement from the Unit option
• Enter the Number of Servers
• Enter the Upper Limit on the System / Queue Capacity
• Press Submit Button
• Save option allows you to save the problem data to the local system storage as a ‘.txt’ file
• Solution page contains Problem Statement, Results, Probabilities and Graph of Decumulative Probability Distribution.
• Result includes Average Server Utilization, Length of Queue, and Length of System, Waiting time in the queue, waiting time in the system and Probability of zero customer in the system [Po], Steady State Probability [Pn], Effective Arrival and Effective Traffic Intensity.
• There is an option to save the solution as a PDF file