Abstract
This paper proposes an add-on to the well known RED (Random Early Detection) algorithm called RED+. RED+ adds the functionality of identifying and discriminating high-bandwidth, unfriendly best-effort flows to RED gateways. It is based on the observation that unfriendly flows have higher arrival rates in times of congestion than friendly flows. Hence unfriendly flows can be discriminated if packets arriving at a router output-port are dropped as a function of RED’s average queue size and the arrival rate of the packet’s flow. RED+ is scalable regarding the amount per flow information stored in routers as it only allocates per-flow state for the n highest bandwidth flows, where n is a configurable parameter. As shown by simulation, RED+ is able to identify and discriminate unresponsive flows avoiding problems of unfairness and congestion collapse.
Chapter PDF
Similar content being viewed by others
References
S. Blake et al., “An Architecture for Differentiated Services”, RFC 2475, December 1998
B. Braden, V. Jacobson et al., “Recommendations on Queue Management in the Internet”, Internet draft, March 1997
Cisco pages, http://www-rp.lip6.fr
D. Clark, “Explicit Allocation of Best Effort Packet Delivery Service”, http://www.ietf.org/html.charters/diffsery-charter.html
A. Demers, S. Keshav, S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm”, Proc. of ACM SIGCOMM, 1989
S. Floyd, K. Fall, “Promoting the Use of End-to-End Congestion Control”, Submitted to IEEE/ACM Transactions on Networking, February 1998, http://www.aciri.org /floyd
S. Floyd, V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transaction on Networking, August 1993
S. Floyd, V. Jacobson, “On Traffic Phase Effects in Packet Switched Gateways”, Computer Communications Review, 1991
NS simulator homepage, http://www-mash.cs.berkeley.edu/ns/
S. Floyd, “TCP and Explicit Congestion Notification”, http://wwwnrg.ee.lbl.gov
[11]V. Jacobson, “Congestion Avoidance and Control”, Proc. of ACM SIGCOMM, Aug.1988
[12]V. Jacobson, “Modified TCP Congestion Avoidance Algorithm”, Message to end2end -interest mailing list, April 1990
[13]D. Lin, R. Morris, “Dynamics of Random Early Detection”, Proc. of ACM SIGCOMM, 1997
[14]M. Mathis et al, “The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm”, Computer Communications Review, July 1997 [15]T.J. Ott, T.V. Lakshman, L.H. Wong, “SRED: Stabilized RED”, Proc. Of IEEE INFOCOM, 1999
[15]T.J. Ott, T.V. Lakshman, L.H. Wong, “SRED: Stabilized RED”, Proc. Of IEEE INFOCOM, 1999
[16]K. K. Ramakrishnan, D. Chiu, R. Jain, “Congestion Avoidance in Computer Networks with a connectionless Network Layer; Part 4, A selective binary feedback scheme for general topologies”, DEC-TR-510, 1987
K.K. Ramakrishnan, S. Floyd, “A Proposal to add Explicit Congestion Notification (ECN) to IP”, RFC2491, January 1999
[18]Stoica, S. Shenker, H. Zhang, “Core-stateless Fair Queueing: achieving approximately fair Bandwidth-Allocations in High-Speed Networks”, Proc. of ACM SIGCOMM, 1998
[19]T. Ziegler, U. Hofmann, S. Fdida, “RED+ Gateways for detection and discrimination of unresponsive flows”, Technical Report, December 1998 http://www-rp.lip6.fr/InfosTheme/Anglais/publicationsan.htm
[20]T. Ziegler, S. Fdida, U. Hofmann, “A distributed Mechanism for detection and discrimination of non-TCP-friendly Flows in the Internet”, February 1999, http://www-rp.lip6.fr/InfosTheme/Anglais/publicationsan.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ziegler, T., Fdida, S., Hofmann, U. (2000). RED+ Gateways for Identification and Discrimination of Unfriendly Best-Effort Flows in the Internet. In: Tsang, D.H.K., Kühn, P.J. (eds) Broadband Communications. BC 1999. IFIP — The International Federation for Information Processing, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35579-5_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-35579-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4685-3
Online ISBN: 978-0-387-35579-5
eBook Packages: Springer Book Archive