RED-DTB: A dual token bucket based queue management algorithm
- 26 Downloads
Improving the Quality of Service (QoS) of Internet traffic is widely recognized as a critical issue for the next-generation networks. In this paper, we present a new algorithm for the active queue management, namely RED-DTB. This buffer control technique is used to enforce approximate fairness among a large number of concurrent Internet flows. Like RED (Random Early Detection) algorithm, the RED-DTB mechanism can be deployed to actively respond to the gateway congestion, keep the gateway in a healthy state, and protect the fragile flows from being stolen bandwidth by greedy ones. The algorithm is based on the so-called Dual Token Bucket (DTB) pattern. That is, on the one hand, every flow is rate-limited by its own token bucket, to ensure that it can not consume more than its fair share of bandwidth; On the other hand, to make some compensations to less aggressive flows, such as connections with larger round trip time or smaller sending window, and to gain a relatively higher system utilization coefficient, all flows, depending on their individual behavior, may have a chance to fetch tokens from the public token bucket when they run out of their own share of tokens. The algorithm is analyzed and evaluated by simulations, and is proved to be effective in protecting the gateway buffer and controlling the fair allocation of bandwidth among flows.
Key wordscongestion control active queue management Dual Token Bucket fair bandwidth allocation network simulation
CLC numberTP 393
Unable to display preview. Download preview PDF.
- Allman M, Paxson V, Stevens W.RFC 2581 TCP Congestion Control. Http://www. ietf. org/rfc/rfc2581. txt, 2002-06-05.Google Scholar
- Ren J F, Mark J W, Wong J W. A Dynamic Priority Queuing Approach to Traffic Regulation and Scheduling in BTS-DN.Proc of IEEE GLOBECOM’94. San Francisco: IEEE Press, 1994. 612–618.Google Scholar
- Misra A, Ott T J. The Window Distribution of Idealized TCP Congestion Avoidance with Variable Packet Loss.Proc of IEEE INFOCOM’99. New York: IEEE Press, 1999. 1564–1572.Google Scholar
- Lin D, Morris R. Dynamics of Random Early Detection.Proc of ACM SIGCOMM’97. New York: IEEE Press, 1997. 127–137.Google Scholar
- Stevens W. RFC 2001 TCPSlow Start, Congestion Avoidance, Fast Retransmit and Fast Recovery Algorithms. Http://www.ietf.org/rfc/rfc2001. txt, 2002-05-28.Google Scholar
- Tyan H Y, Hou J.The JavaSim Tutorial. Http://www.javasim.org, 2002-06-13.Google Scholar
- Handley M, Padhye J, Floyd S.RFC 2861TCP Congestion Window Validation. Http://www.ietf.org/rfc/rfc2861. fxt, 2002-05-21.Google Scholar