SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
Work
Year: 2006
Type: article
Abstract: We consider the sojourn time V in the M / D /1 processor sharing (PS) queue and show that P ( V > x ) is of the form Ce −γ x as x becomes large. The proof involves a geometric random sum representa... more
Authors Regina Egorova, Bert Zwart, Onno Boxma
Institution Eindhoven University of Technology
Cites: 30
Cited by: 26
Related to: 10
FWCI: 6.669
Citation percentile (by year/subfield): 82.78
Subfield: Management Information Systems
Domain: Social Sciences
Open Access status: green