This site presents some of our work related to the numerical analysis of queueing systems.

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

- Try it Now!
- Associated publication:

[1] A Recurrent Solution of*Ph/M/c/N*-like and*Ph/M/c*-like Queues. A. Brandwajn, T. Begin – Journal of Applied Probability, Volume 49, Number 1, Pages 84-99.
[2] A tool for solving - Download the source code (in C).

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

- Try it Now!
- Associated publication:

[3] A conditional probability approach to*M/G/1*-like queues. A. Brandwajn, H. Wang – Performance Evaluation, Volume 65, Issue 5, 2008, Pages 386-405. - Download the source code (in C).

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

*G/G/1*-like queue, *G/G/c*-like queue,...
Under construction

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.

Thanks to Dominique Ponsard and Lucas Delobelle.

Alexandre Brandwajn and Thomas Begin.

* Last update: June 2012 *