Reducing the complexity of the performance analysis of a multi- server facilities - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2014

Reducing the complexity of the performance analysis of a multi- server facilities

Abstract

Systems with multiple servers are common in many areas and their correct dimensioning is in general a difficult problem under realistic assumptions on the pattern of user arrivals and service time distribution. We present an approximate solution for the underlying Ph/Ph/c/N queueing model. Our approximation decomposes the solution of the Ph/Ph/c/N queue into solutions of simpler M/Ph/c/N and Ph/M/c/N queues. It is conceptually simple, easy to implement and produces generally accurate results for the mean number in the system, as well as the loss probability. A significant speed advantage compared to the numerical solution of the full Ph/Ph/c/N queue can be gained as the number of phases representing the arrival process and/or the number of servers increases.
Fichier principal
Vignette du fichier
RR-8617.pdf (6.01 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01076366 , version 1 (21-10-2014)

Identifiers

  • HAL Id : hal-01076366 , version 1

Cite

Tulin Atmaca, Thomas Begin, Alexandre Brandwajn, Hind Castel-Taleb. Reducing the complexity of the performance analysis of a multi- server facilities. [Research Report] RR-8617, Institut Telecom, Telecom SudParis, Evry, France; Université Lyon 1 / LIP (UMR INRIA, ENS Lyon CNRS, UCBL), Lyon France; University of California Santa Cruz, Baskin School of Engineering, USA; INRIA. 2014. ⟨hal-01076366⟩
176 View
98 Download

Share

Gmail Facebook X LinkedIn More