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

Takashi KURIMOTO  Takashi SHIMIZU  Ryutaro KAWAMURA  

IEICE TRANSACTIONS on Communications   Vol.E84-B   No.5   pp.1413-1422
Publication Date: 2001/05/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Internet
best-effort service,  Internet,  fairness,  unresponsive flow,  

Full Text: PDF(190.7KB)>>
Buy this Article

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.