Abstract
This paper proposes the MUV (Misbehaving User Vanguard) algorithm for identification and discrimination of non TCP-friendly best-effort flows. The operational principle of MUV is to detect non TCP-friendly flows at the ingress router by comparing arrival rates to equivalent TCP-friendly rates, i.e. the arrival rate of a TCP flow having the same round-trip time and packet-loss probability. If a flow is identified as non TCP-friendly, its packets are marked as “unfriendly”. Core routers discriminate packets marked as unfriendly with RED-based drop-preference mechanisms. In order to measure the round-trip time and the packet-loss probability for the computation of a flow’s TCP-friendly rate, ingress router and egress router communicate via a simple protocol.
The MUV algorithm fits into the Differentiated Services Architecture of the Internet and can be considered scalable as it only requires per-flow state at ingress- and egress routers. We show by simulation that MUV is able to reliably identify and discriminate unresponsive flows and investigate its performance bounds regarding the identification of flows using non TCP-friendly congestion control algorithms.
This work is partly sponsored by TA and FFF Austria
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Braden, D. Clark et al., “Recommendations on Queue Management and Congestion Avoidance in the Internet”, RFC 2309, April 1998
S. Floyd, K. Fall, “Promoting the Use of End-to-End Congestion Control in the Internet”, Submitted to IEEE/ACM Transactions on Networking, February 1998
R.J. Gibbens, F.P. Kelly, “Resource Pricing and the Evolution of Congestion Control”, http://www.statslab.cam.ac.uk/~frank/evol.html
A. Demers, S. Keshav, S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm”, Proceedings of ACM SIGCOMM, 1989
I. Stoica, S. Shenker, H. Zhang, “Core-stateless Fair Queueing: achieving approximately fair Bandwidth-Allocations in High-Speed Networks”, Proceedings of ACM SigComm, 1998
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
S. Floyd, V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transaction on Networking, August 1993
Cisco Web-pages, http://www.cisco.com/warp/public/732/netflow/qos_ds.html
D. Clark, “Explicit Allocation of Best Effort Packet Delivery Service”, http://www.ietf.org/html.charters/diffserv-charter.html
S. Blake et al., “An Architecture for Differientiated Services”, RFC 2475, December 1998
K. Nichols et al., “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers”, Internet Draft, August 1998
V. Jacobson, “Congestion Avoidance and Control”, Proceedings of ACM SIGCOMM Conference, August 1988
V. Jacobson, “Modified TCP Congestion Avoidance Algorithm”, Message to end2end-interest mailing list, April 1990
S. Floyd, “Connections with multiple congested Gateways in Packet-Switched Networks”, Part one: One-way Traffic”, Computer Communications Review, Oct. 1991
T.V. Lakshman, U. Madhow, “The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss”, IFIP Transactions, High Performance Networking, 1994
T. Ott, J.H.B. Kempermann, M. Mathis, “The stationary Behavior of ideal TCP Congestion Avoidance”, Preprint, August 1996
M. Mathis, J. Semke, J. Mahdavi, “The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm”, Computer Communications Review, July 1997
W. R. Stevens, “TCP-IP Illustrated, Volume 1”, Addison Wesley, 1994
J. Padhye et al., “Modeling TCP Throughput: A simple Model and its empirical Validation”, Proceedings of ACM SIGCOMM, August 1998
S. Floyd, K. Fall, K. Tieu, “Estimating Arrival Rates from the RED Packet Drop History”, Draft, March 1998
D. Lin, R. Morris, “Dynamics of Random Early Detection”, Proceedings of ACM SIGCOMM, 1997
T. Ziegler, S. Fdida, U. Hofmann, “RED+ Gateways for Identification and Discrimination of unfriendly best-effort Flows in the Internet”, Proceedings of IFIP Broadband Communications 99, November 1999
T.J. Ott, T.V. Lakshman, L.H. Wong, “SRED: Stabilized RED”, Proceedings of IEEE Infocom, 1999
S. Deering, R. Hinden, “Internet Protocol, Version 6 (IPv6) Specification”, RFC 2460, December 1998
T. Ziegler, S. Fdida, “A distributed Mechanism fir Identification and Discrimination of non TCP-friendly Flows in the Internet”, extended version of this paper, unpublished, November 1999, http://www-rp.lip6.fr/~costa/production.html
NS Simulator Homepage, http://www-mash.cs.berkeley.edu/ns/
W. Feng et al., “Techniques for eliminating Packet Loss in congested TCP/IP Networks”, University of Michigan, CSE-TR-349-97, November 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ziegler, T., Fdida, S. (2000). A distributed Mechanism for Identification and Discrimination of non TCP-friendly Flows in the Internet. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_64
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive