BF-RED: A Novel Algorithm for Improving Bandwidth Fairness of RED
RED (random early detection) is widely used in network nodes to achieve congestion avoidance while keeping a high utilization of the underlying link. But it provides little protection from high throughput flows that consume much bandwidth. That is to say, it cannot guarantee the bandwidth fairness....
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | RED (random early detection) is widely used in network nodes to achieve congestion avoidance while keeping a high utilization of the underlying link. But it provides little protection from high throughput flows that consume much bandwidth. That is to say, it cannot guarantee the bandwidth fairness. In this paper, a new algorithm named bandwidth-fair RED (BF-RED) is proposed to improve the bandwidth fairness of RED. BF-RED identifies high throughput flows according to its "drop-weight", then raises the drop probability by increasing the value of max p parameter to control the high throughput flows. Through our simulations, we show that BF-RED is highly effective and efficient |
---|---|
DOI: | 10.1109/ICNSC.2006.1673287 |