|
|
||||||||

ilovi
Department of Electrical Engineering, Columbia University, New York, New York 10027
We investigate the distribution of the waiting time V in a stable M/G/1 processor-sharing queue with traffic intensity p < 1. When the distribution of a customer service request B belongs to a large class of subexponential distributions with tails heavier than e
Department of Electrical Engineering, Columbia University, New York, New York 10027
predrag{at}ee.columbia.edu
petar{at}ee.columbia.edu
x, it is shown that
Furthermore, we demonstrate that the preceding relationship does not hold if the service distribution has a lighter tail than e

x.
History: Received: September 29, 2001;
revision received: November 1, 2002;
This article has been cited by other articles:
![]() |
M. Nuyens, A. Wierman, and B. Zwart Preventing Large Sojourn Times Using SMART Scheduling Operations Research, January 1, 2008; 56(1): 88 - 101. [Abstract] [PDF] |
||||
![]() |
P. R. Jelenkovic and P. Momcilovic Large Deviations of Square Root Insensitive Random Sums Mathematics of Operations Research, May 1, 2004; 29(2): 398 - 406. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |