The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
WFQ (Weighted Fair Queueing) ialah algoritma penjadualan yang ideal dari segi kelewatan dan keadilan. Walau bagaimanapun, kerumitan pengiraan cap masa menjadikan pelaksanaan sukar. Dalam makalah ini, kami mencadangkan algoritma baris gilir saksama yang cekap dan mudah, yang dipanggil Emulated Weighted Fair Queuing (EWFQ), yang mempunyai O(1) kerumitan untuk pengiraan masa maya sementara ia hampir sempurna meniru sifat kelewatan dan keadilan WFQ. Idea utama EWFQ ialah ia menentukur masa maya sistem hanya pada penghujung setiap penghantaran paket, sementara ia mengira masa maya sistem untuk paket yang baru tiba dengan menggunakan anggaran linear. Dengan berbuat demikian, EWFQ mempunyai harta berkadar kadar. EWFQ boleh dilaksanakan dalam penghala untuk menyokong perkhidmatan pembezaan dan bersepadu.
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.
Salinan
Nam-Seok KO, Hong-Shik PARK, "Emulated Weighted Fair Queueing Algorithm for High-Speed Packet-Switched Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 10, pp. 2863-2870, October 2001, doi: .
Abstract: WFQ (Weighted Fair Queueing) is an ideal scheduling algorithm in terms of delay and fairness. However, timestamp computation complexity makes the implementation difficult. In this paper we propose an efficient and simple fair queueing algorithm, called Emulated Weighted Fair Queueing (EWFQ), which has O(1) complexity for the virtual time computation while it almost perfectly emulates the delay and fairness properties of WFQ. The key idea of EWFQ is that it calibrates the system virtual time only at the end of each packet transmission, while it calculates the system virtual time for a newly arrived packet by employing a linear approximation. By doing so, EWFQ has a rate-proportional property. EWFQ can be implemented in a router for supporting the differential and integrated services.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_10_2863/_p
Salinan
@ARTICLE{e84-b_10_2863,
author={Nam-Seok KO, Hong-Shik PARK, },
journal={IEICE TRANSACTIONS on Communications},
title={Emulated Weighted Fair Queueing Algorithm for High-Speed Packet-Switched Networks},
year={2001},
volume={E84-B},
number={10},
pages={2863-2870},
abstract={WFQ (Weighted Fair Queueing) is an ideal scheduling algorithm in terms of delay and fairness. However, timestamp computation complexity makes the implementation difficult. In this paper we propose an efficient and simple fair queueing algorithm, called Emulated Weighted Fair Queueing (EWFQ), which has O(1) complexity for the virtual time computation while it almost perfectly emulates the delay and fairness properties of WFQ. The key idea of EWFQ is that it calibrates the system virtual time only at the end of each packet transmission, while it calculates the system virtual time for a newly arrived packet by employing a linear approximation. By doing so, EWFQ has a rate-proportional property. EWFQ can be implemented in a router for supporting the differential and integrated services.},
keywords={},
doi={},
ISSN={},
month={October},}
Salinan
TY - JOUR
TI - Emulated Weighted Fair Queueing Algorithm for High-Speed Packet-Switched Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2863
EP - 2870
AU - Nam-Seok KO
AU - Hong-Shik PARK
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2001
AB - WFQ (Weighted Fair Queueing) is an ideal scheduling algorithm in terms of delay and fairness. However, timestamp computation complexity makes the implementation difficult. In this paper we propose an efficient and simple fair queueing algorithm, called Emulated Weighted Fair Queueing (EWFQ), which has O(1) complexity for the virtual time computation while it almost perfectly emulates the delay and fairness properties of WFQ. The key idea of EWFQ is that it calibrates the system virtual time only at the end of each packet transmission, while it calculates the system virtual time for a newly arrived packet by employing a linear approximation. By doing so, EWFQ has a rate-proportional property. EWFQ can be implemented in a router for supporting the differential and integrated services.
ER -