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
Kami mencadangkan mekanisme pengurusan penimbal, yang dipanggil V-WFQ (Virtual Weighted Fair Queueing), untuk mencapai peruntukan lebar jalur yang lebih kurang adil dengan sejumlah kecil perkakasan dalam rangkaian berkelajuan tinggi. Proses asas untuk peruntukan lebar jalur menggunakan penurunan paket terpilih yang membandingkan kadar input aliran yang diukur dengan anggaran bahagian lebar lebar yang saksama. Walaupun V-WFQ ialah algoritma berasaskan FIFO yang cekap perkakasan, ia mencapai keadilan yang hampir ideal dalam peruntukan lebar jalur. V-WFQ boleh dilaksanakan dalam penghala teras berkelajuan tinggi rangkaian tulang belakang IP hari ini untuk menyediakan pelbagai perkhidmatan berkualiti tinggi. Kami telah menyiasat prestasi V-WFQ dari segi keadilan dan penggunaan pautan melalui simulasi yang meluas. Keputusan simulasi menunjukkan bahawa V-WFQ mencapai keseimbangan yang baik antara keadilan dan penggunaan pautan di bawah pelbagai keadaan simulasi.
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
Takashi MIYAMURA, Takashi KURIMOTO, Kenji NAKAGAWA, Prasad DHANANJAYA, Michihiro AOKI, Naoaki YAMANAKA, "A Buffer Management Mechanism for Achieving Approximately Fair Bandwidth Allocation in High-Speed Networks" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 8, pp. 1434-1441, August 2002, doi: .
Abstract: We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving an approximately fair allocation of bandwidth with a small amount of hardware in a high-speed network. The basic process for the allocation of bandwidth uses selective packet dropping that compares the measured input rate of the flow with an estimated fair share of bandwidth. Although V-WFQ is a hardware-efficient FIFO-based algorithm, it achieves almost ideal fairness in bandwidth allocation. V-WFQ can be implemented in the high-speed core routers of today's IP backbone networks to provide various high-quality services. We have investigated V-WFQ's performance in terms of fairness and link utilization through extensive simulation. The results of simulation show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_8_1434/_p
Salinan
@ARTICLE{e85-b_8_1434,
author={Takashi MIYAMURA, Takashi KURIMOTO, Kenji NAKAGAWA, Prasad DHANANJAYA, Michihiro AOKI, Naoaki YAMANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Buffer Management Mechanism for Achieving Approximately Fair Bandwidth Allocation in High-Speed Networks},
year={2002},
volume={E85-B},
number={8},
pages={1434-1441},
abstract={We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving an approximately fair allocation of bandwidth with a small amount of hardware in a high-speed network. The basic process for the allocation of bandwidth uses selective packet dropping that compares the measured input rate of the flow with an estimated fair share of bandwidth. Although V-WFQ is a hardware-efficient FIFO-based algorithm, it achieves almost ideal fairness in bandwidth allocation. V-WFQ can be implemented in the high-speed core routers of today's IP backbone networks to provide various high-quality services. We have investigated V-WFQ's performance in terms of fairness and link utilization through extensive simulation. The results of simulation show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.},
keywords={},
doi={},
ISSN={},
month={August},}
Salinan
TY - JOUR
TI - A Buffer Management Mechanism for Achieving Approximately Fair Bandwidth Allocation in High-Speed Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1434
EP - 1441
AU - Takashi MIYAMURA
AU - Takashi KURIMOTO
AU - Kenji NAKAGAWA
AU - Prasad DHANANJAYA
AU - Michihiro AOKI
AU - Naoaki YAMANAKA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2002
AB - We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving an approximately fair allocation of bandwidth with a small amount of hardware in a high-speed network. The basic process for the allocation of bandwidth uses selective packet dropping that compares the measured input rate of the flow with an estimated fair share of bandwidth. Although V-WFQ is a hardware-efficient FIFO-based algorithm, it achieves almost ideal fairness in bandwidth allocation. V-WFQ can be implemented in the high-speed core routers of today's IP backbone networks to provide various high-quality services. We have investigated V-WFQ's performance in terms of fairness and link utilization through extensive simulation. The results of simulation show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.
ER -