Stochastic comparisons for fork-join queues with exponential processing times
Keyword(s):
Consider a fork-join queue, where each job upon arrival splits into k tasks and each joins a separate queue that is attended by a single server. Service times are independent, exponentially distributed random variables. Server i works at rate , where μ is constant. We prove that the departure process becomes stochastically faster as the service rates become more homogeneous in the sense of stochastic majorization. Consequently, when all k servers work with equal rates the departure process is stochastically maximized.
1997 ◽
Vol 34
(02)
◽
pp. 487-497
◽
1986 ◽
Vol 23
(01)
◽
pp. 115-129
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1990 ◽
Vol 27
(02)
◽
pp. 459-464
◽
Keyword(s):
1991 ◽
Vol 28
(01)
◽
pp. 245-250
◽
Keyword(s):
2017 ◽
Vol 2017
◽
pp. 1-10
◽
Keyword(s):