The sojourn-time distribution in the M/G/1 queue by processor sharing

Abstract

This paper gives, in the form of Laplace–Stieltjes transforms and generating functions, the joint distribution of the sojourn time and the number of customers in the system at departure for customers in the general M/G/1 queue with processor sharing (M/G/1/PS). Explicit formulas are given for a number of conditional and unconditional moments, including the variance of the sojourn time of an ‘arbitrary' customer.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 115 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.