Full Text Views
110
Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round-Robin (IWRR) is a variant that mitigates this effect. We are interested in finding bounds on worst-case delay obtained with IWRR. To this end, we use a network calculus approach and find a strict service curve for IWRR. The result is obtained using the pseudo-inverse of a function. We show that the strict service curve is the best obtainable one, and that delay bounds derived from it are tight (i.e., worst-case) for flows of packets of constant size. Furthermore, the IWRR strict service curve dominates the strict service curve for WRR that was previously published. We provide some numerical examples to illustrate the reduction in worst-case delays caused by IWRR compared to WRR.
Seyed Mohammadhossein TABATABAEE
EPFL
Jean-Yves LE BOUDEC
EPFL
Marc BOYER
Université de Toulouse
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Seyed Mohammadhossein TABATABAEE, Jean-Yves LE BOUDEC, Marc BOYER, "Interleaved Weighted Round-Robin: A Network Calculus Analysis" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 12, pp. 1479-1493, December 2021, doi: 10.1587/transcom.2021ITI0001.
Abstract: Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round-Robin (IWRR) is a variant that mitigates this effect. We are interested in finding bounds on worst-case delay obtained with IWRR. To this end, we use a network calculus approach and find a strict service curve for IWRR. The result is obtained using the pseudo-inverse of a function. We show that the strict service curve is the best obtainable one, and that delay bounds derived from it are tight (i.e., worst-case) for flows of packets of constant size. Furthermore, the IWRR strict service curve dominates the strict service curve for WRR that was previously published. We provide some numerical examples to illustrate the reduction in worst-case delays caused by IWRR compared to WRR.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2021ITI0001/_p
Copy
@ARTICLE{e104-b_12_1479,
author={Seyed Mohammadhossein TABATABAEE, Jean-Yves LE BOUDEC, Marc BOYER, },
journal={IEICE TRANSACTIONS on Communications},
title={Interleaved Weighted Round-Robin: A Network Calculus Analysis},
year={2021},
volume={E104-B},
number={12},
pages={1479-1493},
abstract={Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round-Robin (IWRR) is a variant that mitigates this effect. We are interested in finding bounds on worst-case delay obtained with IWRR. To this end, we use a network calculus approach and find a strict service curve for IWRR. The result is obtained using the pseudo-inverse of a function. We show that the strict service curve is the best obtainable one, and that delay bounds derived from it are tight (i.e., worst-case) for flows of packets of constant size. Furthermore, the IWRR strict service curve dominates the strict service curve for WRR that was previously published. We provide some numerical examples to illustrate the reduction in worst-case delays caused by IWRR compared to WRR.},
keywords={},
doi={10.1587/transcom.2021ITI0001},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Interleaved Weighted Round-Robin: A Network Calculus Analysis
T2 - IEICE TRANSACTIONS on Communications
SP - 1479
EP - 1493
AU - Seyed Mohammadhossein TABATABAEE
AU - Jean-Yves LE BOUDEC
AU - Marc BOYER
PY - 2021
DO - 10.1587/transcom.2021ITI0001
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2021
AB - Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round-Robin (IWRR) is a variant that mitigates this effect. We are interested in finding bounds on worst-case delay obtained with IWRR. To this end, we use a network calculus approach and find a strict service curve for IWRR. The result is obtained using the pseudo-inverse of a function. We show that the strict service curve is the best obtainable one, and that delay bounds derived from it are tight (i.e., worst-case) for flows of packets of constant size. Furthermore, the IWRR strict service curve dominates the strict service curve for WRR that was previously published. We provide some numerical examples to illustrate the reduction in worst-case delays caused by IWRR compared to WRR.
ER -