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 solution to this queue with multiple servers is fast, based on a simple recurrence and numerically stable.

- Solve it !
- For more information: [1]
- Download the source code (in C).

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

- Solve it !
- For more information: [3]
- Download the source code (in C).

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

- Solve it !
- For more information: [4]

- [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
*Ph/M/c*and*Ph/M/c/N*queues. T. Begin, A. Brandwajn, – Proceedings of the 9th ACM International Conference on Quantitative Evaluation of SysTems, QEST12. - [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. - [4] Reduced complexity in
*M/Ph/c/N*queues. A. Brandwajn, T. Begin – Technical Report, 2013 (to be published in Performance Evaluation).

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.

Many thanks to Dominique Ponsard and Lucas Delobelle.

Thomas Begin and Alexandre Brandwajn.

* Last update: June 2014 *