IEICE TRANSACTIONS on Communications
Fair Bandwidth Allocation for Responsive and Unresponsive Flows Using Approximate Fairness Dropping Scheme
Summary :
In this paper, based on Equivalent Active Flow, we propose a novel technique called Approximate Fairness Dropping, which is able to approximate fairness by containing misbehaving flows' access queue opportunity with low time/space complexity. Unlike most of the existing Active Queue Management schemes (e.g., RED, BLUE, CHOKE), Approximate Fairness Dropping does not drop the packets whose arriving rate is within the maximum admitted rate, so it protects the well-behaving flows against misbehaving ones, moreover, improves the throughput and decreases the queuing delay. Our simulations and analyses demonstrate that this new technique outperforms the existing schemes and closely approximates the "ideal" case, where full state information is needed.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.4 pp.1263-1272
- Publication Date
- 2006/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.4.1263
- Type of Manuscript
- PAPER
- Category
- Network
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
Peng YUE, Zeng-Ji LIU, Bin ZHANG, "Fair Bandwidth Allocation for Responsive and Unresponsive Flows Using Approximate Fairness Dropping Scheme" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 4, pp. 1263-1272, April 2006, doi: 10.1093/ietcom/e89-b.4.1263.
Abstract: In this paper, based on Equivalent Active Flow, we propose a novel technique called Approximate Fairness Dropping, which is able to approximate fairness by containing misbehaving flows' access queue opportunity with low time/space complexity. Unlike most of the existing Active Queue Management schemes (e.g., RED, BLUE, CHOKE), Approximate Fairness Dropping does not drop the packets whose arriving rate is within the maximum admitted rate, so it protects the well-behaving flows against misbehaving ones, moreover, improves the throughput and decreases the queuing delay. Our simulations and analyses demonstrate that this new technique outperforms the existing schemes and closely approximates the "ideal" case, where full state information is needed.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.4.1263/_p
Copy
@ARTICLE{e89-b_4_1263,
author={Peng YUE, Zeng-Ji LIU, Bin ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Fair Bandwidth Allocation for Responsive and Unresponsive Flows Using Approximate Fairness Dropping Scheme},
year={2006},
volume={E89-B},
number={4},
pages={1263-1272},
abstract={In this paper, based on Equivalent Active Flow, we propose a novel technique called Approximate Fairness Dropping, which is able to approximate fairness by containing misbehaving flows' access queue opportunity with low time/space complexity. Unlike most of the existing Active Queue Management schemes (e.g., RED, BLUE, CHOKE), Approximate Fairness Dropping does not drop the packets whose arriving rate is within the maximum admitted rate, so it protects the well-behaving flows against misbehaving ones, moreover, improves the throughput and decreases the queuing delay. Our simulations and analyses demonstrate that this new technique outperforms the existing schemes and closely approximates the "ideal" case, where full state information is needed.},
keywords={},
doi={10.1093/ietcom/e89-b.4.1263},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Fair Bandwidth Allocation for Responsive and Unresponsive Flows Using Approximate Fairness Dropping Scheme
T2 - IEICE TRANSACTIONS on Communications
SP - 1263
EP - 1272
AU - Peng YUE
AU - Zeng-Ji LIU
AU - Bin ZHANG
PY - 2006
DO - 10.1093/ietcom/e89-b.4.1263
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2006
AB - In this paper, based on Equivalent Active Flow, we propose a novel technique called Approximate Fairness Dropping, which is able to approximate fairness by containing misbehaving flows' access queue opportunity with low time/space complexity. Unlike most of the existing Active Queue Management schemes (e.g., RED, BLUE, CHOKE), Approximate Fairness Dropping does not drop the packets whose arriving rate is within the maximum admitted rate, so it protects the well-behaving flows against misbehaving ones, moreover, improves the throughput and decreases the queuing delay. Our simulations and analyses demonstrate that this new technique outperforms the existing schemes and closely approximates the "ideal" case, where full state information is needed.
ER -
English
