In:
Advances in Applied Probability, Cambridge University Press (CUP), Vol. 42, No. 01 ( 2010-03), p. 246-267
Abstract:
We consider a system with Poisson arrivals and independent and identically distributed service times, where requests in the system are served according to the state-dependent (Cohen's generalized) processor-sharing discipline, where each request receives a service capacity that depends on the actual number of requests in the system. For this system, we derive expressions as well as tight insensitive upper bounds for the moments of the conditional sojourn time of a request with given required service time. The bounds generalize and extend corresponding results, recently given for the single-server processor-sharing system in Cheung et al. (2006) and for the state-dependent processor-sharing system with exponential service times by the authors (2008). Analogous results hold for the waiting times. Numerical examples for the M/M/m-PS and M/D/m-PS systems illustrate the given bounds.
Type of Medium:
Online Resource
ISSN:
0001-8678
,
1475-6064
DOI:
10.1017/S0001867800003992
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
2010
detail.hit.zdb_id:
1474602-5
