Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
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
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Dynamic behavior of slowly-responsive congestion control algorithms
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
CYRF: a theory of window-based unicast congestion control
IEEE/ACM Transactions on Networking (TON)
Switched and Impulsive Systems: Analysis, Design and Applications (Lecture Notes in Control and Information Sciences)
Incentive-compatible adaptation of Internet real-time multimedia
IEEE Journal on Selected Areas in Communications
A unified architecture for real-time video-coding systems
IEEE Transactions on Circuits and Systems for Video Technology
Analysis of monotonic responsive functions for congestion control
MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
| Hi-index | 0.00 |
In this paper, we shall generalize the concepts of fairness, TCP-friendliness and TCP-compatibility such that more source adaptation schemes can be designed to support diverse applications over the Internet. A simple but efficient framework, in the form of a monotonic response function (MRF), is proposed for the analysis and the design of memoryless window-based source adaptation protocols by using these concepts. We first derive a necessary and sufficient condition for step-wise convergence to the weighted fairness. It is then used to construct increase-decrease policies. The requirements of our increase-decrease policy are less conservative than those of the CYRF (Choose Your Response Function) that was proposed in [1]. Our MRF is suitable for transmission control protocol (TCP) and user datagram protocol (UDP), and can be used to design TCP-friendly and multimedia-friendly source adaptation schemes. Meanwhile, our MRF can be applied to provide bandwidth differentiation service without any change to the router of the existing Internet.