Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T22:33:13.470Z Has data issue: false hasContentIssue false

Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing

Published online by Cambridge University Press:  01 July 2016

Andreas Brandt*
Affiliation:
Humboldt-Universität zu Berlin
Manfred Brandt*
Affiliation:
Zuse Institute Berlin
*
∗ Postal address: Institut für Operations Research, Humboldt-Universität zu Berlin, Spandauer Strasse 1, D-10178 Berlin, Germany. Email address: brandt@wiwi.hu-berlin.de
∗∗ Postal address: Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Takustrasse 7, D-14195 Berlin, Germany. Email address: brandt@zib.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2010