Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • search hit 19 of 38
Back to Result List

Insensitive bounds for the moments of the sojourn times in M/GI systems under state-dependent processor sharing

  • We consider a system with Poisson arrivals and i.i.d. service times and where the requests are served according to the state-dependent (Cohen's generalized) processor sharing discipline, where each request in the system receives a service capacity which depends on the actual number of requests in the system. For this system we derive asymptotically tight upper bounds for the moments of the conditional sojourn time of a request with given required service time. The bounds generalize corresponding results, recently given for the single-server processor sharing system by Cheung et al. and for the state-dependent processor sharing system with exponential service times by the authors. Analogous results hold for the waiting times.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Andreas Brandt, Manfred Brandt
Document Type:Article
Parent Title (English):Advances in Applied Probability
Volume:42
Issue:1
First Page:246
Last Page:267
Year of first publication:2010
Preprint:urn:nbn:de:0297-zib-11092
DOI:https://doi.org/10.1239/aap/1269611152
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.