On the Scalable Fairness and Efficient Active Queue Management of RED

On the Scalable Fairness and Efficient Active Queue Management of RED

Internet routers generally see packets from a fast flow more often than a slow flow. This suggests that network fairness may be improved without per-flow information. In this paper, we propose a scheme using Most Recently Used List (MRUL)-a list storing statistics of limited active flows that sorted in most recently seen first mode-to improve the fairness of RED. Based on the list, our proposed...

FQL-RED: an adaptive scalable schema for active queue management

In a potentially congested network, random early detection (RED) active queue management (AQM) proved effective in improving throughput and average queuing delay. The main disadvantage of RED is its sensitive parameters that are impossible to estimate perfectly and adjust manually because of the dynamic nature of the network. For this reason, RED performs differently during different phases of ...

Active queue management and global fairness objectives

We present an Active Queue Management policy and we study its ability to steer an entire TCP/IP network into global max–min fairness of its long–lived flows, in a totally distributed fashion. A previously proposed technique, initially applicable to circuit–switched networks and feedback–based flow control networks is adapted to the realities of packet–switching and TCP flow/congestion control, ...

RED-Worcester - Traffic Sensitve Active Queue Management

RED-Worcester - Traffic Sensitive Active Queue Management

The Internet today carries traffic for applications with a wide range of delay and throughput requirements. Traditional applications such as FTP and E-mail can tolerate high delays due to long router queues in exchange for high throughput. Emerging applications such as IP telephony, video conferencing and networked games, on the other hand, have have more stringent delay constraints than loss c...