Numerical Solutions for Queueing Systems (original) (raw)

Simple and computationally efficient semi-numerical solutions for the evaluation of the steady-state queue length distribution using conditional probabilities.

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

_G/M/c_-like queue

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

• Try it Now ! Solution to the steady-state behavior of this queue.
• Associated publication:
  [1] A Recurrent Solution of _Ph/M/c/N_-like and _Ph/M/c_-like Queues. A. Brandwajn, T. Begin – RR 7321 INRIA, 2010, 18 pages. Also to appear in Journal of Applied Probability.
• Download the source code (in C).

_M/G/1_-like queue

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

• Solution the steady-state behavior of this queue. (To be done)
• Associated publication:
  [1] 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).

More to come

_G/G/1_-like queue, _G/G/c_-like queue,...

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

Thanks to Dominique Ponsard and Lucas Delobelle.

Authors

Alexandre Brandwajn and Thomas Begin.

Last update: October 2011