The M/G/1 queue with processor sharing and its relation to a feedback queue
Queueing Systems: Theory and Applications
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic behavior of slowly-responsive congestion control algorithms
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Quantifying Skype user satisfaction
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Fairness of traffic controls for inelastic flows in the Internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reflections on the TCP macroscopic model
ACM SIGCOMM Computer Communication Review
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
A survey on TCP-friendly congestion control
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
While the current definition of TCP friendliness has enabled a wide variety of traffic control protocols other than TCP, it still considerably restricts the design space of TCP-friendly traffic control protocols. For example, some multimedia streaming applications prefer a smooth sending rate on a time scale of tens of seconds, however, a UDP flow maintaining such a long smoothness time scale is naturally not TCP friendly by the current definition. In this paper, we propose an innovative method to relatively compare the degrees of TCP friendliness of different traffic control protocols, and use it to define a new class of TCP friendliness definitions, called stochastic TCP friendliness (STF). STF greatly expands the design space of TCP-friendly traffic control protocols, while still effectively maintaining the desired fairness of the Internet. To demonstrate the expanded design space, we also develop a new congestion control protocol, called TCP-friendly CBR-Like Rate Control (TFCBR), for multimedia streaming applications which do not require a high sending rate but prefer a smooth sending rate on a time scale of tens of seconds. TFCBR is stochastically TCP friendly, however, it is not TCP friendly by the current definition.