TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
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
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Controlling High-Bandwidth Flows at the Congested Router
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Identifying elephant flows through periodically sampled packets
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Ethane: taking control of the enterprise
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A QoS architecture for quantitative service differentiation
IEEE Communications Magazine
Hi-index | 0.00 |
We propose a programmable and scalable traffic management scheme. Programmable traffic management at high-speed routers is difficult because programmability and high-speed packet processing have involved a serious tradeoff. To attain both, the new scheme combines control programs at a control server and simple packet handling functions, such as sampling packet headers and discarding packets, at routers. Therefore, by installing appropriate control programs into the server, a variety of active queue management schemes, per-flow bandwidth management schemes, DoS mitigation schemes, and so on, are achieved. One of the main contributions of this paper is its proposal of a statistical scheme for handling flows. As only a fraction of complete flow information stored at the conterol server is loaded into the router's flow table and it is replaced cyclically, the proposed scheme scales more than the routerfs flow table capacity. Our simulation results indicate that the scheme provides efficient traffic management, per-flow WFQ emulation in our example, even with very small flow tables compared to the number of concurrently active flows. Furthermore, we discuss implementation issues with the proposed scheme and reveal that the processing cost at the server and router is sufficiently small for use with 10 Gbps links.