Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Enhancing TCP performance with a load-adaptive RED mechanism
International Journal of Network Management
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
A control theoretic approach to active queue management
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE/ACM Transactions on Networking (TON)
Oblivious AQM and nash equilibria
ACM SIGCOMM Computer Communication Review
IEEE Network: The Magazine of Global Internetworking
Effective RED: An algorithm to improve RED's performance by reducing packet loss rate
Journal of Network and Computer Applications
Lightweight fairness solutions for XCP and TCP cohabitation
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Hi-index | 0.00 |
We evaluate effects of parameters in queue management on performance using 2k factorial designs. Among these systematic and environmental parameters, number of flows and Pmax are two dominant factors affecting RED performance. Then, we propose a novel active queue management scheme, NRED, employing flow number estimation and queue length feedback control, which are motivated from Bloom filter and control theory, respectively. By estimation of number of active flows, NRED is more scalable than FRED which employs per-active-flow accounting. Furthermore, fluctuation of queue length under NRED is smaller than BLUE, REM, SRED and DRED. Especially, NRED can stabilize queue length very fast even when a lot of flows suddenly crowd into the network. NRED is suitable to be deployed in today's networks where hot spot frequently occurs.