2008Unpublished venueRequires access

An Algorithm of Enhancing RED Fairness

Xiaoping Yang, Hong Chen, Pingping Xiao

Open publisher page 4 citations

Abstract

Random Early Detection (RED) can effectively avoid transmiting congestion at routers, but RED can not provide bandwidth fairness. Different packet sizes are one of the reasons that damage fairness. RED routers provide little protection from some bulky data flows that use considerably more bandwidth than other flows in time of congestion. Modifying the formulas of calculating final packet-discard probability and packet count for RED algorithm based on the sending rate formula of TCP flows, a new algorithm named enhanced-fairness RED (EF-RED) is proposed. Simulation results show that the EF-RED algorithm can efficiently avoid the effect of different packet sizes on TCP bandwidth allocation when congestion takes place, and achieve better bandwidth fairness.

About this research paper

What this paper is about

Random Early Detection (RED) can effectively avoid transmiting congestion at routers, but RED can not provide bandwidth fairness. Different packet sizes are one of the reasons that damage fairness. RED routers provide little protection from some bulky data flows that use considerably more bandwidth than other flows in time of congestion. Modifying the formulas of calculating final packet-discard probability and packet count for RED algorithm based on the sending rate formula of TCP flows, a new algorithm named enhanced-fairness RED (EF-RED) is proposed. Simulation results show that the EF-RED algorithm can efficiently avoid the effect of different packet sizes on TCP bandwidth allocation when congestion takes place, and achieve better bandwidth fairness.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Random Early Detection (RED) can effectively avoid transmiting congestion at routers, but RED can not provide bandwidth fairness. Different packet sizes are one of the reasons that damage fairness. RED routers provide little protection from some bulky data flows that use considerably more bandwidth than other flows in time of congestion. Modifying the formulas of calculating final packet-discard probability and packet count for RED algorithm based on the sending rate formula of TCP flows, a new algorithm named enhanced-fairness RED (EF-RED) is proposed. Simulation results show that the EF-RED algorithm can efficiently avoid the effect of different packet sizes on TCP bandwidth allocation when congestion takes place, and achieve better bandwidth fairness.

Key concepts: Random early detection, Computer science, Bandwidth (computing), Network packet, Computer network, Algorithm, Fairness measure, Bandwidth allocation

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algorithm of Enhancing RED Fairness — Research Paper | ScholarLens