A Non-Work-Conserving Scheduler to Provide Proportional Delay Differentiated Services and Best Effort Service

Yuan-Cheng LAI; Arthur CHANG

doi:10.1093/ietcom/e89-b.9.2493

A Non-Work-Conserving Scheduler to Provide Proportional Delay Differentiated Services and Best Effort Service

Yuan-Cheng LAI, Arthur CHANG

Full Text Views

0

Cite this

Summary :

The proportional delay differentiation (PDD) model provides consistent packet delay differentiation between classes of service. Currently, the present schedulers performing the PDD model cannot achieve desired delay proportion observed in short timescales under light/moderate load. Thus, we propose a Non-Work-Conserving (NWC) scheduler, which utilizes the pseudo-waiting time for an empty queue and forces each class to compare its priority with those of all other classes. Simulation results reveal that NWC outperforms all current schedulers in achieving the PDD model. However, NWC suspends the server from transmitting packets immediately if an empty class has the maximum priority, resulting in an idle server. Therefore, we further propose two approaches, which will serve a best-effort class during this idle time. Compared with other schedulers, the proposed approaches can provide more predictable and controllable delay proportion, accompanied with satisfactory throughput and average queuing delay.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.9 pp.2493-2502

Publication Date: 2006/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.9.2493

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Yuan-Cheng LAI, Arthur CHANG, "A Non-Work-Conserving Scheduler to Provide Proportional Delay Differentiated Services and Best Effort Service" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 9, pp. 2493-2502, September 2006, doi: 10.1093/ietcom/e89-b.9.2493.
Abstract: The proportional delay differentiation (PDD) model provides consistent packet delay differentiation between classes of service. Currently, the present schedulers performing the PDD model cannot achieve desired delay proportion observed in short timescales under light/moderate load. Thus, we propose a Non-Work-Conserving (NWC) scheduler, which utilizes the pseudo-waiting time for an empty queue and forces each class to compare its priority with those of all other classes. Simulation results reveal that NWC outperforms all current schedulers in achieving the PDD model. However, NWC suspends the server from transmitting packets immediately if an empty class has the maximum priority, resulting in an idle server. Therefore, we further propose two approaches, which will serve a best-effort class during this idle time. Compared with other schedulers, the proposed approaches can provide more predictable and controllable delay proportion, accompanied with satisfactory throughput and average queuing delay.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.9.2493/_p

Copy

@ARTICLE{e89-b_9_2493,
author={Yuan-Cheng LAI, Arthur CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Non-Work-Conserving Scheduler to Provide Proportional Delay Differentiated Services and Best Effort Service},
year={2006},
volume={E89-B},
number={9},
pages={2493-2502},
abstract={The proportional delay differentiation (PDD) model provides consistent packet delay differentiation between classes of service. Currently, the present schedulers performing the PDD model cannot achieve desired delay proportion observed in short timescales under light/moderate load. Thus, we propose a Non-Work-Conserving (NWC) scheduler, which utilizes the pseudo-waiting time for an empty queue and forces each class to compare its priority with those of all other classes. Simulation results reveal that NWC outperforms all current schedulers in achieving the PDD model. However, NWC suspends the server from transmitting packets immediately if an empty class has the maximum priority, resulting in an idle server. Therefore, we further propose two approaches, which will serve a best-effort class during this idle time. Compared with other schedulers, the proposed approaches can provide more predictable and controllable delay proportion, accompanied with satisfactory throughput and average queuing delay.},
keywords={},
doi={10.1093/ietcom/e89-b.9.2493},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - A Non-Work-Conserving Scheduler to Provide Proportional Delay Differentiated Services and Best Effort Service
T2 - IEICE TRANSACTIONS on Communications
SP - 2493
EP - 2502
AU - Yuan-Cheng LAI
AU - Arthur CHANG
PY - 2006
DO - 10.1093/ietcom/e89-b.9.2493
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2006
AB - The proportional delay differentiation (PDD) model provides consistent packet delay differentiation between classes of service. Currently, the present schedulers performing the PDD model cannot achieve desired delay proportion observed in short timescales under light/moderate load. Thus, we propose a Non-Work-Conserving (NWC) scheduler, which utilizes the pseudo-waiting time for an empty queue and forces each class to compare its priority with those of all other classes. Simulation results reveal that NWC outperforms all current schedulers in achieving the PDD model. However, NWC suspends the server from transmitting packets immediately if an empty class has the maximum priority, resulting in an idle server. Therefore, we further propose two approaches, which will serve a best-effort class during this idle time. Compared with other schedulers, the proposed approaches can provide more predictable and controllable delay proportion, accompanied with satisfactory throughput and average queuing delay.
ER -