The search functionality is under construction.

The search functionality is under construction.

A new algorithm called core-stateless random-early-detection (CS-RED) is described. This algorithm can improve the fairness characteristics under a wide range of network conditions and is robust in terms of the setting of its control parameters. It can be used in a distributed architecture, as can the core-stateless fair-queuing (CSFQ) algorithm, so it is applicable to large-capacity backbone routers. Through a detailed evaluation, we have identified and clarified the fairness degradation problem in the CSFQ algorithm. We solved this problem by incorporating the congestion notification proposed in the RED algorithm into CSFQ; we call this hybrid CS-RED. Comparison of the fairness characteristics in a computer-simulated network using either the CS-RED or CSFQ algorithm showed that a higher level of fairness is achieved with the CS-RED algorithm under a wide variety of network conditions without degrading link utilization. Furthermore, the CS-RED algorithm uses a treatment that is more general than the penalty box mechanism to penalize unresponsive flows in best-effort networks.

- Publication
- IEICE TRANSACTIONS on Communications Vol.E84-B No.5 pp.1413-1422

- Publication Date
- 2001/05/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Internet

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.

Copy

Takashi KURIMOTO, Takashi SHIMIZU, Ryutaro KAWAMURA, "Core-Stateless RED Algorithm for Improving Fairness in a Best-Effort Network" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 5, pp. 1413-1422, May 2001, doi: .

Abstract: A new algorithm called core-stateless random-early-detection (CS-RED) is described. This algorithm can improve the fairness characteristics under a wide range of network conditions and is robust in terms of the setting of its control parameters. It can be used in a distributed architecture, as can the core-stateless fair-queuing (CSFQ) algorithm, so it is applicable to large-capacity backbone routers. Through a detailed evaluation, we have identified and clarified the fairness degradation problem in the CSFQ algorithm. We solved this problem by incorporating the congestion notification proposed in the RED algorithm into CSFQ; we call this hybrid CS-RED. Comparison of the fairness characteristics in a computer-simulated network using either the CS-RED or CSFQ algorithm showed that a higher level of fairness is achieved with the CS-RED algorithm under a wide variety of network conditions without degrading link utilization. Furthermore, the CS-RED algorithm uses a treatment that is more general than the penalty box mechanism to penalize unresponsive flows in best-effort networks.

URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_5_1413/_p

Copy

@ARTICLE{e84-b_5_1413,

author={Takashi KURIMOTO, Takashi SHIMIZU, Ryutaro KAWAMURA, },

journal={IEICE TRANSACTIONS on Communications},

title={Core-Stateless RED Algorithm for Improving Fairness in a Best-Effort Network},

year={2001},

volume={E84-B},

number={5},

pages={1413-1422},

abstract={A new algorithm called core-stateless random-early-detection (CS-RED) is described. This algorithm can improve the fairness characteristics under a wide range of network conditions and is robust in terms of the setting of its control parameters. It can be used in a distributed architecture, as can the core-stateless fair-queuing (CSFQ) algorithm, so it is applicable to large-capacity backbone routers. Through a detailed evaluation, we have identified and clarified the fairness degradation problem in the CSFQ algorithm. We solved this problem by incorporating the congestion notification proposed in the RED algorithm into CSFQ; we call this hybrid CS-RED. Comparison of the fairness characteristics in a computer-simulated network using either the CS-RED or CSFQ algorithm showed that a higher level of fairness is achieved with the CS-RED algorithm under a wide variety of network conditions without degrading link utilization. Furthermore, the CS-RED algorithm uses a treatment that is more general than the penalty box mechanism to penalize unresponsive flows in best-effort networks.},

keywords={},

doi={},

ISSN={},

month={May},}

Copy

TY - JOUR

TI - Core-Stateless RED Algorithm for Improving Fairness in a Best-Effort Network

T2 - IEICE TRANSACTIONS on Communications

SP - 1413

EP - 1422

AU - Takashi KURIMOTO

AU - Takashi SHIMIZU

AU - Ryutaro KAWAMURA

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Communications

SN -

VL - E84-B

IS - 5

JA - IEICE TRANSACTIONS on Communications

Y1 - May 2001

AB - A new algorithm called core-stateless random-early-detection (CS-RED) is described. This algorithm can improve the fairness characteristics under a wide range of network conditions and is robust in terms of the setting of its control parameters. It can be used in a distributed architecture, as can the core-stateless fair-queuing (CSFQ) algorithm, so it is applicable to large-capacity backbone routers. Through a detailed evaluation, we have identified and clarified the fairness degradation problem in the CSFQ algorithm. We solved this problem by incorporating the congestion notification proposed in the RED algorithm into CSFQ; we call this hybrid CS-RED. Comparison of the fairness characteristics in a computer-simulated network using either the CS-RED or CSFQ algorithm showed that a higher level of fairness is achieved with the CS-RED algorithm under a wide variety of network conditions without degrading link utilization. Furthermore, the CS-RED algorithm uses a treatment that is more general than the penalty box mechanism to penalize unresponsive flows in best-effort networks.

ER -