Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue

Share/Save/Bookmark

Cheung, Sing-Kong and Berg, Hans van den and Boucherie, Richard J. (2006) Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue. Queueing Systems, 53 (1-2). pp. 7-18. ISSN 0257-0130

[img] PDF
Restricted to UT campus only
: Request a copy
422kB
Abstract:This paper studies the M/G/1 processor-sharing (PS) queue, in particular the sojourn time distribution conditioned on the initial job size. Although several expressions for the Laplace-Stieltjes transform (LST) are known, these expressions are not suitable for computational purposes. This paper derives readily applicable insensitive bounds for all moments of the conditional sojourn time distribution. The instantaneous sojourn time, i.e., the sojourn time of an infinitesimally small job, leads to insensitive upper bounds requiring only knowledge of the traffic intensity and the initial job size. Interestingly, the upper bounds involve polynomials with so-called Eulerian numbers as coefficients. In addition, stochastic ordering and moment ordering results for the sojourn time distribution are obtained.

(Keywords: M/G/1 PS - Conditional sojourn time - Moments - Insensitive bounds - Instantaneous sojourn time - Euler's number triangle - Moment ordering - Permanent customers)

Item Type:Article
Additional information:This work has been partially funded by the Dutch Ministry of Economic Affairs under the program ‘Technologische Samenwerking ICT-doorbraakprojecten’, project TSIT1025 BEYOND 3G.
Copyright:© 2006 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62864
Official URL:http://dx.doi.org/10.1007/s11134-006-7583-y
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 237994