IEICE TRANSACTIONS on Communications
Hierarchically Aggregated Fair Queueing (HAFQ) for Per-Flow Fair Bandwidth Allocation
Summary :
Because of the development of recent broadband access technologies, fair service among users is becoming more important goal. The most promising router mechanisms for providing fair service is per-flow traffic management. However, it is difficult to implement in high-speed core routers because per-flow state management is prohibitively expensive; thus, a large number of flows are aggregated into a small number of queues. This is not an acceptable situation because fairness degrades as the number of flows so aggregated increases. In this paper, we propose a new traffic management scheme called Hierarchically Aggregated Fair Queueing (HAFQ) to provide per-flow fair service. Our scheme can adjust flow aggregation levels according to the queue handling capability of various routers. This means the proposed scheme scales well in high-speed networks. HAFQ improves the fairness among aggregated flows by estimating the number of flows aggregated in a queue and allocating bandwidth to the queue proportionally. In addition, since HAFQ can identify flows having higher arrival rates simultaneously while estimating the number of flows, it enhances the fairness by preferentially dropping their packets. We show that our scheme can provide per-flow fair service through extensive simulation and experiments using a network processor. Since the currently available network processors (Intel IXP1200 in our case) are not high capacity, we also give extensive discussions on the applicability of our scheme to the high-speed core routers.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.2 pp.427-435
- Publication Date
- 2006/02/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.2.427
- Type of Manuscript
- PAPER
- Category
- Switching for Communications
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
Ichinoshin MAKI, Hideyuki SHIMONISHI, Tutomu MURASE, Masayuki MURATA, "Hierarchically Aggregated Fair Queueing (HAFQ) for Per-Flow Fair Bandwidth Allocation" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 2, pp. 427-435, February 2006, doi: 10.1093/ietcom/e89-b.2.427.
Abstract: Because of the development of recent broadband access technologies, fair service among users is becoming more important goal. The most promising router mechanisms for providing fair service is per-flow traffic management. However, it is difficult to implement in high-speed core routers because per-flow state management is prohibitively expensive; thus, a large number of flows are aggregated into a small number of queues. This is not an acceptable situation because fairness degrades as the number of flows so aggregated increases. In this paper, we propose a new traffic management scheme called Hierarchically Aggregated Fair Queueing (HAFQ) to provide per-flow fair service. Our scheme can adjust flow aggregation levels according to the queue handling capability of various routers. This means the proposed scheme scales well in high-speed networks. HAFQ improves the fairness among aggregated flows by estimating the number of flows aggregated in a queue and allocating bandwidth to the queue proportionally. In addition, since HAFQ can identify flows having higher arrival rates simultaneously while estimating the number of flows, it enhances the fairness by preferentially dropping their packets. We show that our scheme can provide per-flow fair service through extensive simulation and experiments using a network processor. Since the currently available network processors (Intel IXP1200 in our case) are not high capacity, we also give extensive discussions on the applicability of our scheme to the high-speed core routers.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.2.427/_p
Copy
@ARTICLE{e89-b_2_427,
author={Ichinoshin MAKI, Hideyuki SHIMONISHI, Tutomu MURASE, Masayuki MURATA, },
journal={IEICE TRANSACTIONS on Communications},
title={Hierarchically Aggregated Fair Queueing (HAFQ) for Per-Flow Fair Bandwidth Allocation},
year={2006},
volume={E89-B},
number={2},
pages={427-435},
abstract={Because of the development of recent broadband access technologies, fair service among users is becoming more important goal. The most promising router mechanisms for providing fair service is per-flow traffic management. However, it is difficult to implement in high-speed core routers because per-flow state management is prohibitively expensive; thus, a large number of flows are aggregated into a small number of queues. This is not an acceptable situation because fairness degrades as the number of flows so aggregated increases. In this paper, we propose a new traffic management scheme called Hierarchically Aggregated Fair Queueing (HAFQ) to provide per-flow fair service. Our scheme can adjust flow aggregation levels according to the queue handling capability of various routers. This means the proposed scheme scales well in high-speed networks. HAFQ improves the fairness among aggregated flows by estimating the number of flows aggregated in a queue and allocating bandwidth to the queue proportionally. In addition, since HAFQ can identify flows having higher arrival rates simultaneously while estimating the number of flows, it enhances the fairness by preferentially dropping their packets. We show that our scheme can provide per-flow fair service through extensive simulation and experiments using a network processor. Since the currently available network processors (Intel IXP1200 in our case) are not high capacity, we also give extensive discussions on the applicability of our scheme to the high-speed core routers.},
keywords={},
doi={10.1093/ietcom/e89-b.2.427},
ISSN={1745-1345},
month={February},}
Copy
TY - JOUR
TI - Hierarchically Aggregated Fair Queueing (HAFQ) for Per-Flow Fair Bandwidth Allocation
T2 - IEICE TRANSACTIONS on Communications
SP - 427
EP - 435
AU - Ichinoshin MAKI
AU - Hideyuki SHIMONISHI
AU - Tutomu MURASE
AU - Masayuki MURATA
PY - 2006
DO - 10.1093/ietcom/e89-b.2.427
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2006
AB - Because of the development of recent broadband access technologies, fair service among users is becoming more important goal. The most promising router mechanisms for providing fair service is per-flow traffic management. However, it is difficult to implement in high-speed core routers because per-flow state management is prohibitively expensive; thus, a large number of flows are aggregated into a small number of queues. This is not an acceptable situation because fairness degrades as the number of flows so aggregated increases. In this paper, we propose a new traffic management scheme called Hierarchically Aggregated Fair Queueing (HAFQ) to provide per-flow fair service. Our scheme can adjust flow aggregation levels according to the queue handling capability of various routers. This means the proposed scheme scales well in high-speed networks. HAFQ improves the fairness among aggregated flows by estimating the number of flows aggregated in a queue and allocating bandwidth to the queue proportionally. In addition, since HAFQ can identify flows having higher arrival rates simultaneously while estimating the number of flows, it enhances the fairness by preferentially dropping their packets. We show that our scheme can provide per-flow fair service through extensive simulation and experiments using a network processor. Since the currently available network processors (Intel IXP1200 in our case) are not high capacity, we also give extensive discussions on the applicability of our scheme to the high-speed core routers.
ER -
English
