Solutions to Queueing Systems

Simple and computationally efficient (semi-)numerical solutions for the evaluation of the steady-state queue length distribution.


How to use this tool? [2]

This site presents some of our work related to the numerical analysis of queueing systems. We provide the solution for 3 classical models of queues.

The G/M/c-like queue

The solution to this queue with multiple servers is fast, based on a simple recurrence and numerically stable.


The M/G/1-like queue

The solution to this classical queue is fast, based on a simple recurrence and numerically stable.


The M/G/c-like queue (New)

The solution to this classical queue is based on a simple yet accurate approximation.


We expect to include additional models

Associated publications

Compatible browsers

This site is compatible with the following browsers:

If you use IE 8.0, the steady-state distribution for the number of customers in the system will not be displayed as a plot, but instead as a table since svg format is not supported.

Acknowledgement

Many thanks to Dominique Ponsard and Lucas Delobelle.

Authors

Thomas Begin and Alexandre Brandwajn.



Last update: June 2014