Knessl, C. & Tier, C. (1998). Asymptotic approximations and bottleneck analysis in product form queueing networks with large populations. Perform. Eval. 33(4), 219--248. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Filtered Gibbs Sampler for Estimating Blocking in.. - Andrew.. (2000) (Correct)
....realistic sized networks. Moreover, in many cases, it is not sufficient to know the blocking probability, and it is desirable to sample from the distribution itself (see for example [17] Monte Carlo techniques, such as the FGS, bridge the gap between exact algorithms [10 12] and approximations [8,19,20]. They allow a quantifiable tradeoff between computational time and accuracy, while being conceptually simple. This section presents the construction of a surrogate Markov chain k : k = 1, 2, with state space whose steady state probabilities are given exactly by # in (1) that ....
C. Knessl and C. Tier. Asymptotic approximations and bottleneck analysis in product form queueing networks with large populations. Perf. Eval., 33(4), 1998, 219--248.
Bottlenecks Identification in Multiclass Queueing Networks.. - Casale, Serazzi (2004) (Correct)
No context found.
Knessl, C. & Tier, C. (1998). Asymptotic approximations and bottleneck analysis in product form queueing networks with large populations. Perform. Eval. 33(4), 219--248.
Bottlenecks Identification in Multiclass Queueing Networks.. - Casale, Serazzi (2004) (Correct)
No context found.
Knessl, C. & Tier, C. (1998). Asymptotic approximations and bottleneck analysis in product form queueing networks with large populations. Perform. Eval. 33(4), 219--248.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC