Solutions to Queueing Systems

Simple and computationally efficient 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 some 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 using a reduced-state description.


The G/G/c-like queue (Beta version)

The solution to this classical queue is found using the solutions of two simpler models, i.e. M/G/c-like and G/M/c-like queues.


We are working to include more models

Associated publications

Compatible browsers

This site is compatible with the following browsers:

  • Google Chrome
  • Internet Explorer 9.0
  • Safari 5
  • Firefox 3.x, 4.x and 7.x

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 for their help.

Authors

Thomas Begin and Alexandre Brandwajn.



Last update: January 2015