A Buffer Management Mechanism for Achieving Approximately Fair Bandwidth Allocation in High-Speed Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E85-B No.8 pp.1434-1441
- Publication Date
- 2002/08/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Outstanding Papers from APCC 2001)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
