On the Scalable Fairness and Efficient Active Queue Management of RED

Free registration required

Executive Summary

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, the authors 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, their proposed scheme jointly considers the identification and punish of the fast and unresponsive fast flows and the protection of slow flows. Its performance improvements are demonstrated with extensive simulations.

  • Format: PDF
  • Size: 819.03 KB