skip to main content
article
Free Access

Dynamics of random early detection

Authors Info & Claims
Published:01 October 1997Publication History
Skip Abstract Section

Abstract

In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as non-adaptive, fragile and robust, according to their responses to congestion. We point out that RED allows unfair bandwidth sharing when a mixture of the three traffic types shares a link. This unfairness is caused by the fact that at any given time RED imposes the same loss rate on all flows, regardless of their bandwidths.We propose Fair Random Early Drop (FRED), a modified version of RED. FRED uses per-active-flow accounting to impose on each flow a loss rate that depends on the flow's buffer use.We show that FRED provides better protection than RED for adaptive (fragile and robust) flows. In addition, FRED is able to isolate non-adaptive greedy traffic more effectively. Finally, we present a "two-packet-buffer" gateway mechanism to support a large number of flows without incurring additional queueing delays inside the network. These improvements are demonstrated by simulations of TCP and UDP traffic.FRED does not make any assumptions about queueing architecture; it will work with a FIFO gateway. FRED's per-active-flow accounting uses memory in proportion to the total number of buffers used: a FRED gateway maintains state only for flows for which it has packets buffered, not for all flows that traverse the gateway.

References

  1. 1 Brakmo, L,, O'Malley, S., Peterson, L., '~TCP Vegas: New Techniques for Congestion Detection and Avoidance" SIG- COMM'94 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Claffy, K., Braun, H-W., Polyzos, G., "A Parameterizable Methodology for Internet Traffic Flow Profiling" IEEE Journal on Selected Areas in Communications, March 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Eldridge, C., "Rate Controls in Standard Transport Protocols;' ACM Computer Communication Review, July 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Fall, K., Floyd S., "Simulation-based Comparisons of Tahoe, Reno, and SACK TCP,' Computer Communication Review, July 1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Floyd, S,, Jacobson V., "Random Early Detection for Congestion Avoidance" IEEE/ACM Transactions on Networking. August 1993 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Floyd, S., Jacobson, V., "On Traffic Phase Effects in Packet- Switched Gateways,' Computer Communication Review, April 1991 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Floyd, S., "TCP and Explicit Congestion Notification" Computer Communication Review, October 1994 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Floyd, S., "Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1' One-way Traffic,' Computer Communications Review, October 1991 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Hahne, E,, Gallager, R., "Round Robin Scheduling for Fair Flow Control in Data Communications Networks" IEEE International Conference on Communications, June 1986Google ScholarGoogle Scholar
  10. 10 Hashem, E,, "Analysis of Random Drop for Gateway Congestion control;' MIT-LCS-TR-465Google ScholarGoogle Scholar
  11. 11 Hoe, J,, "Improving the Start-up Behavior of a Congestion Control Scheme for TCP,' SIGCOMM'96 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Jaeobson, V., "Congestion Avoidance and Control" SiG- COMM'88 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Jaeobson, V., "Modified TCP congestion avoidance algorithm;' April 30, 1990, end2end-interest mailing listGoogle ScholarGoogle Scholar
  14. 14 Jain, R,, Ramakrishnan, K.K., Chiu, D., "Congestion Avoidance in Computer Networks With a Connectionless Network Layer,' DEC-TR-506Google ScholarGoogle Scholar
  15. 15 Kung, H. T., Blackwell, T., Chapman, A., "Credit-Based Flow Control for ATM Networks: Credit Update Protocol, Adaptive Credit Allocation, and Statistical Multiplexing" SIGCOMM '94 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Kung, H.T., Chapman, A., The CreditNet Project, http:// www. eecs.harvard.edu/cn.htmlGoogle ScholarGoogle Scholar
  17. 17 Lin, D., "TCP Fast Retransmission and Fast Recovery Strategies: Analysis and Improvements;' work in progressGoogle ScholarGoogle Scholar
  18. 18 Mankin, A., Ramakrishnan, K., "Gateway Congestion Control Survey" RFC 1254 Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 Mankin, A., "Random Drop Congestion Control" SiG- COMM'90 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 Morris, R., "TCP Behavior with Many Flows;' work in progressGoogle ScholarGoogle Scholar
  21. 21 Nagle, J., "On Packet Switches with Infinite Storage" IEEE Transactions on Communications, Vol. 35, pp 435438, 1987Google ScholarGoogle ScholarCross RefCross Ref
  22. 22 Rizzo, L., "RED and non-responsive flows" end2end-interest mailing list, June, 1997Google ScholarGoogle Scholar
  23. 23 Tanenbaum, A., Computer Networks, Prentice Hall, 2nd Edition, 1989 Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 Turner, J.S,, "Maintaining High Throughput during overload in ATM Switches,' INFOCOM'96 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25 Villamizar, C., Song, C., "High Performance TCP in ANS- NET," Computer Communications Review, October 1994 Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 26 Zhang, L., "A New Architecture for Packet Switching Network Protocols" MIT-LCS-TR-455Google ScholarGoogle Scholar

Index Terms

  1. Dynamics of random early detection

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 27, Issue 4
        Oct. 1997
        291 pages
        ISSN:0146-4833
        DOI:10.1145/263109
        Issue’s Table of Contents
        • cover image ACM Conferences
          SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
          October 1997
          311 pages
          ISBN:089791905X
          DOI:10.1145/263105

        Copyright © 1997 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 October 1997

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader