𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing

✍ Scribed by Jeongsim Kim; Bara Kim

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
275 KB
Volume
58
Category
Article
ISSN
0166-5316

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The M/G/1 processor-sharing queue with d
The M/G/1 processor-sharing queue with disasters
✍ Quan-Lin Li; Chuang Lin πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 573 KB

In this paper, the M/G/1 processor-sharing queue with disasters is given a detailed analysis by means of extending the supplementary variable method. The transient and steady-state distributions of the queue length are expressed as a simple and computable form, the Laplace-Stieltjes transform of the

Evaluating mean sojourn time estimates f
Evaluating mean sojourn time estimates for the M/M/1 queue
✍ Hiroshi Toyoizumi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 446 KB

Mean sojourn time is one of the most important performance measures for queueing systems. It is difficult to obtain the real sojourn time of a customer directly~ so it is also difficult to estimate the mean sojourn time. In this paper, we propose a new and relatively simple estimate of the mean sojo

The uniform estimation of the M/G/1 proc
The uniform estimation of the M/G/1 processor sharing response time distribution
✍ Hartmann, Harro L. πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 502 KB

## Abstract This contribution avoids frequently used transform and inversion problems by a decomposition of the transition state model in the original domain. First, the relevant differential‐recurrence backward equation system valid for the M/M/1 processor sharing (PS) is converted to a sum of a s