Jörg Widmer
Martin Mauve
ABSTRACT
In this paper we present a TCP-friendly congestion control scheme for non-adaptable flows. The main characteristic of these flows is that their data rate is determined by an application and cannot be adapted to the current congestion situation of the network. Typical examples of non-adaptable flows are those produced by networked computer games or live audio and video transmissions where adaptation of the quality is not possible (e.g., since it is already at the lowest possible quality level). We propose to perform congestion control for non-adaptable flows by suspending them at appropriate times so that the aggregation of multiple non-adaptable flows behaves in a TCP-friendly manner. The decision whether or not a flow is to be suspended is based on random experiments. In order to allocate probabilities for these experiments, the data rate of the non-adaptable flow is compared to the rate that a TCP flow would achieve under the same conditions. We present a detailed discussion of the proposed scheme and evaluate it through extensive simulation with the network simulator ns-2.
- S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. RFC 2475, IETF Network Working Group, 1998. Google Scholar
Digital Library
- R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource reservation protocol (RSVP) -- version 1 functional specification. RFC 2205, IETF Network Working Group, 1997. Google ScholarDigital Library
- L. Breslau, D. Estrin, K. Fall, S. Floyd, J. Heidemann, A. Helmy, P. Huang, S. McCanne, K. Varadhan, Y. Xu, and H. Yu. Advances in network simulation. IEEE Computer, 33(5):59--67, May 2000. Google ScholarDigital Library
- J. Byers, M. Frumin, G. Horn, M. Luby, M. Mitzenmacher, A. Roetter, and W. Shaver. FLID-DL: Congestion control for layered multicast. In Proc. Second International Workshop on Networked Group Communication (NGC 2000), pages 71--81, Palo Alto, CA, USA, Nov. 2000. Google ScholarDigital Library
- J. P. Damm. Probabilistic congestion control for non-adaptable flows. Master's thesis, University of Mannheim, Apr. 2001.Google Scholar
- S. Floyd and K. Fall. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking, 7(4):458--472, Aug. 1999. Google ScholarDigital Library
- S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based congestion control for unicast applications. In Proc. ACM SIGCOMM, pages 43 -- 56, Stockholm, Sweden, Aug. 2000. Google ScholarDigital Library
- J. Padhye, V. Firoiu, D. F. Towsley, and J. F. Kurose. Modeling TCP Reno performance: a simple model and its empirical validation. IEEE/ACM Transactions on Networking, 8(2):133--145, Apr. 2000. Google ScholarDigital Library
- S. Ramesh and I. Rhee. Issues in TCP model-based flow control. Technical Report TR-99-15, Department of Computer Science, NCSU, 1999. Google ScholarDigital Library
- I. Rhee, V. Ozdemir, and Y. Yi. TEAR: TCP emulation at receivers - flow control for multimedia streaming. Technical report, Department of Computer Science, North Carolina State University, Apr. 2000.Google Scholar
- L. Rizzo. pgmcc: A TCP-friendly single-rate multicast congestion control scheme. In Proc. ACM SIGCOMM, pages 17 -- 28, Stockholm, Sweden, Aug. 2000. Google ScholarDigital Library
- J. Widmer, R. Denda, and M. Mauve. A survey on TCP-friendly congestion control. Special Issue of the IEEE Network Magazine "Control of Best Effort Traffic", 15(3):28--37, May/June 2001. Google ScholarDigital Library
Index Terms
- Probabilistic congestion control for non-adaptable flows
Recommendations
On the impact of delay on real-time multiplayer games
Multiplayer games, i.e., games where several persons interact simultaneously over networks like the Internet, receive much interest. One of the reasons is that competing with human counterparts is typically considered as much more interesting and ...
Comments