Mean Delay Analysis of Multi Level Processor Sharing Disciplines

2006 ◽  
Author(s):  
S. Aalto ◽  
U. Ayesta
Keyword(s):  
Delay Analysis ◽  
Processor Sharing ◽  
Mean Delay ◽  
Multi Level

scholarly journals On the nonoptimality of the foreground-background discipline for IMRL service times

2006 ◽  
Vol 43 (02) ◽  
pp. 523-534
Author(s):  
S. Aalto ◽  
U. Ayesta
Keyword(s):  
Hazard Rate ◽  
Residual Lifetime ◽  
Processor Sharing ◽  
Counter Example ◽  
Mean Delay ◽  
Mean Residual Lifetime ◽  
Service Disciplines ◽  
The Mean ◽  
Service Times ◽  
The One

It is known that for decreasing hazard rate (DHR) service times the foreground-background discipline (FB) minimizes the mean delay in the M/G/1 queue among all work-conserving and nonanticipating service disciplines. It is believed that a similar result is valid for increasing mean residual lifetime (IMRL) service times. However, on the one hand, we point out a flaw in an earlier proof of the latter result and construct a counter-example that demonstrates that FB is not necessarily optimal within class IMRL. On the other hand, we prove that the mean delay for FB is smaller than that of the processor-sharing discipline within class IMRL, giving a weaker version of an earlier hypothesis.

Expected delay analysis of polling systems in heavy traffic

1998 ◽  
Vol 30 (02) ◽  
pp. 586-602 ◽  
Author(s):  
R. D. van der Mei ◽  
H. Levy
Keyword(s):  
Heavy Traffic ◽  
Waiting Times ◽  
Delay Analysis ◽  
Polling Systems ◽  
Heavy Load ◽  
Polling Model ◽  
Mean Delay ◽  
Service Disciplines ◽  
The Mean ◽  
Cyclic Polling

We study the expected delay in a cyclic polling model with mixtures of exhaustive and gated service in heavy traffic. We obtain closed-form expressions for the mean delay under standard heavy-traffic scalings, providing new insights into the behaviour of polling systems in heavy traffic. The results lead to excellent approximations of the expected waiting times in practical heavy-load scenarios and moreover, lead to new results for optimizing the system performance with respect to the service disciplines.

scholarly journals On the nonoptimality of the foreground-background discipline for IMRL service times

2006 ◽  
Vol 43 (2) ◽  
pp. 523-534 ◽  
Author(s):  
S. Aalto ◽  
U. Ayesta
Keyword(s):  
Hazard Rate ◽  
Residual Lifetime ◽  
Processor Sharing ◽  
Counter Example ◽  
Mean Delay ◽  
Mean Residual Lifetime ◽  
Service Disciplines ◽  
The Mean ◽  
Service Times ◽  
The One

It is known that for decreasing hazard rate (DHR) service times the foreground-background discipline (FB) minimizes the mean delay in the M/G/1 queue among all work-conserving and nonanticipating service disciplines. It is believed that a similar result is valid for increasing mean residual lifetime (IMRL) service times. However, on the one hand, we point out a flaw in an earlier proof of the latter result and construct a counter-example that demonstrates that FB is not necessarily optimal within class IMRL. On the other hand, we prove that the mean delay for FB is smaller than that of the processor-sharing discipline within class IMRL, giving a weaker version of an earlier hypothesis.

Network Calculus for Mean Delay Analysis Through a Network

2018 ◽  
Author(s):  
Fabrice Guillemin ◽  
Ravi Mazumdar ◽  
Catherine Rosenberg ◽  
Yu Ying
Keyword(s):  
Delay Analysis ◽  
Network Calculus ◽  
Mean Delay

Expected delay analysis of polling systems in heavy traffic

1998 ◽  
Vol 30 (2) ◽  
pp. 586-602 ◽  
Author(s):  
R. D. van der Mei ◽  
H. Levy
Keyword(s):  
Heavy Traffic ◽  
Waiting Times ◽  
Delay Analysis ◽  
Polling Systems ◽  
Heavy Load ◽  
Polling Model ◽  
Mean Delay ◽  
Service Disciplines ◽  
The Mean ◽  
Cyclic Polling

We study the expected delay in a cyclic polling model with mixtures of exhaustive and gated service in heavy traffic. We obtain closed-form expressions for the mean delay under standard heavy-traffic scalings, providing new insights into the behaviour of polling systems in heavy traffic. The results lead to excellent approximations of the expected waiting times in practical heavy-load scenarios and moreover, lead to new results for optimizing the system performance with respect to the service disciplines.

Mean delay analysis for a message priority-based polling scheme

1992 ◽  
Vol 11 (3) ◽  
pp. 223-240 ◽  
Author(s):  
Zsehong Tsai ◽  
Izhak Rubin
Keyword(s):  
Delay Analysis ◽  
Mean Delay ◽  
Polling Scheme
Sign in / Sign up

Export Citation Format

Share Document