A Tool for solving Ph/M/c and Ph/M/c/N queues

Thomas Begin 1 Alexandre Brandwajn 2
1 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
Abstract : We have developed a free online tool for solving the steady-state behavior of a Ph/M/c queue. The tool has a simple graphical interface, is freely accessible on the Internet and is compatible with most current browsers (queueing-systems.ens-lyon. fr). Based on a recently published simple recurrence method, it provides customary performance measures (i.e., mean number in system, mean waiting time, system utilization, probability of loss, probability of waiting), as well as the complete steady-state distribution for the number of customers in the system. As of the end of 2011, our tool for solving the steady-state behavior of a Ph/M/c queue had close to 15 new visits per day. We plan to add new queues to this tool in the near future (e.g., M/G/1 queue).
Document type :
Conference papers
Complete list of metadatas

Contributor : Thomas Begin <>
Submitted on : Monday, October 29, 2012 - 6:12:08 PM
Last modification on : Wednesday, January 23, 2019 - 7:48:12 PM


  • HAL Id : hal-00746841, version 1


Thomas Begin, Alexandre Brandwajn. A Tool for solving Ph/M/c and Ph/M/c/N queues. QEST, Sep 2012, London, United Kingdom. ⟨hal-00746841⟩



Record views