Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

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.

REFERENCES

• 1: Nishanth R. Sastry , Simon S. Lam, CYRF: a theory of window-based unicast congestion control, IEEE/ACM Transactions on Networking (TON), v.13 n.2, p.330-342, April 2005 [doi>10.1109/TNET.2005.845545]
• 2: [2] Z. G. Li, C. Zhu, N. Ling, X. K. Yang, G. N. Feng, S. Wu, and F. Pan, "A unified architecture for real time video coding systems," IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 6, pp. 472-487, 2003.
• 3: [3] X. Wang and H. Schulxrinne, "Incentive-compatible adaptation of internet real-time multimedia," IEEE J. Sel. Areas Commun., vol. 23, no. 2, pp. 417-436, Feb. 2005.
• 4: [4] R. Jain, D.-M. Chiu, and W. Hawe, "A quantitative measure of fairness and discrimination for resource allocation in shared computer systems," Digital Equipment Corp., Tech. Rep. TR-301, Sep. 1984.
• 5: V. Jacobson, Congestion avoidance and control, ACM SIGCOMM Computer Communication Review, v.18 n.4, p.314-329, August 1988 [doi>10.1145/52325.52356]
• 6: Y. R. Yang , S. S. Lam, General AIMD congestion control, Proceedings of the 2000 International Conference on Network Protocols, p.187, November 14-17, 2000
• 7: [7] D. Bansal and H. Balakrishnan, "Binomial congestion control algorithms," in Proc. IEEE INFOCOM 2001, Anchorage, AK, Apr. 2001, pp. 631-640.
• 8: [8] S. Floyd, M. Handley, and J. Padhye, A comparison of equation-based and AIMD congestion control Mar. 2000 [Online]. Available: http:// www.aciri.org/trfc/
• 9: M. Handley , S. Floyd , J. Padhye , J. Widmer, TCP Friendly Rate Control (TFRC): Protocol Specification, RFC Editor, 2003
• 10: Sally Floyd , Mark Handley , Jitendra Padhye , Jörg Widmer, Equation-based congestion control for unicast applications, Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, p.43-56, August 28-September 01, 2000, Stockholm, Sweden [doi>10.1145/347059.347397]
• 11: Zhengguo Li , Yengchai Soh , Changyun Wen, Switched and Impulsive Systems: Analysis, Design and Applications (Lecture Notes in Control and Information Sciences), Springer-Verlag New York, Inc., Secaucus, NJ, 2005
• 12: Deepak Bansal , Hari Balakrishnan , Sally Floyd , Scott Shenker, Dynamic behavior of slowly-responsive congestion control algorithms, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.263-274, August 2001, San Diego, California, United States [doi>10.1145/383059.383080]
• 13: D.-M. Chiu , R. Jain, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks, Computer Networks and ISDN Systems, v.17 n.1, p.1-14, June 10, 1989 [doi>10.1016/0169-7552(89)90019-6]
• 14: Jeonghoon Mo , Jean Walrand, Fair end-to-end window-based congestion control, IEEE/ACM Transactions on Networking (TON), v.8 n.5, p.556-567, Oct. 2000 [doi>10.1109/90.879343]
• 15: K. Ramakrishnan , S. Floyd , D. Black, The Addition of Explicit Congestion Notification (ECN) to IP, RFC Editor, 2001
• 16: [16] R. Jain, K. Ramakrishnan, and D. Chiu, "Congestion avoidance in computer networks with a connectionless network layer," Digital Equipment Corp., Tech. Rep. DEC-TR-506 34, Aug. 1987.
• 17: [17] C. Chen, Z. G. Li, and Y. C. Soh, "TCP-Friendly source adaptation for multimedia applications over the internet," in Proc. 15th Int. Packet Video Workshop (PV2006), Hangzhou, China, Apr. 2006.
• 18: Steven H. Low , David E. Lapsley, Optimization flow control—I: basic algorithm and convergence, IEEE/ACM Transactions on Networking (TON), v.7 n.6, p.861-874, Dec. 1999 [doi>10.1109/90.811451]
• 19: [19] The Network Simulator--ns-2. 2005 [Online]. Available: http://www. isi.edu/nsnam/ns/
• 20: Sally Floyd , Van Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking (TON), v.1 n.4, p.397-413, Aug. 1993 [doi>10.1109/90.251892]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.5 Local and Wide-Area Networks
          Subjects: Access schemes

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

          Nouns: TCP/IP
      C.2.3 Network Operations
          Subjects: Network management

General Terms:
Design, Management

Keywords:
Lyapunov function, TCP-friendliness, bandwidth differentiation service, convergence, multimedia-friendliness, source adaptation, switched control, weighted fairness