RED-DTB: A dual token bucket based queue management algorithm

  • Yin Jian-hua
  • Cao Yang
  • Ling Jun
  • Huang Tian-xi


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 words

congestion control active queue management Dual Token Bucket fair bandwidth allocation network simulation 

CLC number

TP 393 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Allman M, Paxson V, Stevens W.RFC 2581 TCP Congestion Control. Http://www. ietf. org/rfc/rfc2581. txt, 2002-06-05.Google Scholar
  2. [2]
    Stevens W.TCP/IP Illustrated Vol. 1: The Protocols. New York: Addison-Wesley Press, 1994.MATHGoogle Scholar
  3. [3]
    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
  4. [4]
    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
  5. [5]
    Floyd S, Jacobson V. Random Early Detection Gateways for Congestion Avoidance.IEEE/ACM Transactions on Networking, 1993,1(4): 397–413.CrossRefGoogle Scholar
  6. [6]
    Lin D, Morris R. Dynamics of Random Early Detection.Proc of ACM SIGCOMM’97. New York: IEEE Press, 1997. 127–137.Google Scholar
  7. [7]
    Floyd S, Fall K. Promoting the Use of End-to-End Congestion Control in the Internet.IEEE/ACM Transactions on Networking, 1999,7(4): 458–473.CrossRefGoogle Scholar
  8. [8]
    Stevens W. RFC 2001 TCPSlow Start, Congestion Avoidance, Fast Retransmit and Fast Recovery Algorithms. Http:// txt, 2002-05-28.Google Scholar
  9. [9]
    Tyan H Y, Hou J.The JavaSim Tutorial. Http://, 2002-06-13.Google Scholar
  10. [10]
    Handley M, Padhye J, Floyd S.RFC 2861TCP Congestion Window Validation. Http:// fxt, 2002-05-21.Google Scholar

Copyright information

© Springer 2003

Authors and Affiliations

  • Yin Jian-hua
    • 1
  • Cao Yang
    • 1
    • 2
  • Ling Jun
    • 1
  • Huang Tian-xi
    • 1
  1. 1.School of Electronic InformationWuhan UniversityWuhan, HubeiChina
  2. 2.State Key Laboratory of Software EngineeringWuhan UniversityWuhan, HubeiChina

Personalised recommendations