QoS Support in Wireless/Wired Networks Using the TCP-Friendly AIMD Protocol

IEEE Transactions on Wireless Communications

Volumn 5, Issue 2, 2006, Pages 469-480

  Pan, Jianping ^c   Mark, Jon W ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Department of Computer Science ^*  (Canada)

Author keywords

congestion control; Protocols; quality of services; simulation; wireless networks

Indexed keywords

EID: 85008060383     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2006.1611070     Document Type: Article

References (30)

1. E. Blanton, M. Allman, K. Fall, and L. Wang, “A conservative selective acknowledgment (SACK)-based loss recovery algorithm for TCP,” IETF RFC 3517, 2003.
2. W. Tan and A. Zakhor, “Real-time Internet video using error resilient scalable compression and TCP-friendly transport protocol,” IEEE Trans. Multimedia, vol. 1, no. 2, pp. 172–186, 1999.
3. R. Rejaie, M. Handley, and D. Estrin, “RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet,” in Proc. IEEE INFOCOM’99, March 1999, pp. 1337–1345.
4. S. Floyd, M. Handle, J. Padhye, and J. Widmer, “Equation-based congestion control for unicast applications,” in Proc. ACM SIGCOMM’2000, 2000, pp. 43–56.
5. D. Bansal and H. Balakrishnan, “TCP-friendly congestion control for real-time streaming applications,” MIT, Tech. Rep. MIT-LCS-TR-806, May 2000.
6. Y. R. Yang and S. S. Lam, “General AIMD congestion control,” University of Texas, Tech. Rep. TR-2000-09, May 2000, available http://www.cs.utexas.edu/users/lam/NRL/TechReports/. A shorter version appeared in Proceedings of ICNP'00, Osaka, Japan, November 2000.
7. L. Cai, X. Shen, J. Pan, and J. W. Mark, “Performance analysis of TCP-friendly AIMD algorithms for multimedia applications,” IEEE Trans. Multimedia, vol. 7, no. 2, pp. 339–355, Apr. 2005.
8. S. Floyd, M. Handley, and J. Padhye, “A comparison of equation-based and AIMD congestion control,” May 2000, available http://www.adri.org/tfrc/tcp-friendly.TR.ps.
9. E. Kohler, M. Handley, and S. Floyd, “Datagram Congestion Control Protocol (DCCP),” November 2004, work in progress. Available http://www.icir.org/kohler/dcp/draft-ietf-deep-spec-09.txt.
10. S. Floyd and E. Kohler, “Profile for DCCP congestion control ID 2: TCP-like congestion control,” November 2004, work in progress. Available http://www.icir.org/kohler/dcp/draft-ietf-dccp-ccid2-08.txt.
11. S. Floyd and S. McCanne, “Network Simulator,” LBNL public domain software. Available via ftp from ftp.ee.lbl.gov. NS-2 is available in http://www.isi.edu/nsnam/ns/.
12. A. Evlogimenos, K. H. Lim, and K. Lai, “On the implementation of Datagram Congestion Control Protocol,” 2002, available http://www.es.berkeley.edu/~laik/projects/dccp/index.html.
13. S. Karandikar, S. Kalyanaraman, P. Bagal, and B. Packer, “TCP rate control,” ACM Computer Communications Review, vol. 30, no. 1, pp. 45–58, 2000.
14. F. P. Kelly, “Stochastic models of computer communication systems,” Journal of the Royal Statistical Society, vol. B47, no. 3, pp. 379–395, 1985.
15. D. Loguinov and H. Radha, “End-to-end rate-based congestion control: convergence properties and scalability analysis,” IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 564–577, 2003.
16. W. Li, “Overview of fine granularity scalability in MPEG-4 standard,” IEEE Trans. Circuits and Syst. Video Technol., vol. 11, no. 3, pp. 301—317, March 2001.
17. V. K. Goyal, “Multiple description coding: compression meets the network,” IEEE Signal Processing Mag., vol. 18, pp. 74–93, 2001.
18. G. Fairhurst and L. Wood, “Advice to link designers on link Automatic Repeat reQuest (ARQ),” IETF RFC 3366, 2002.
19. D. Zhang and K. M. Wasserman, “Transmission schemes for time-varying wireless channels with partial state observations,” in Proc. IEEE INFOCOM'02, vol. 2, 2002, pp. 467–476.
20. P. Bhagwat, P. P. Bhattacharya, A. Krishna, and S. K. Tripathi, “En-hancing throughput over wireless LANs using channel state dependent packet scheduling,” in Proc. IEEEINFOCOM’96, 1996, pp. 1133–1140.
21. H. S. Wang and N. Moayeri, “Finite-state Markov channel-a useful model for radio communication channels,” IEEE Trans. Veh. Technol., vol. 44, no. 1, pp. 163–171, 1995.
22. L. Cai, X. Shen, J. W. Mark, and J. Pan, “Performance modeling and analysis of window-controlled multimedia flows in wireless/wired networks,” May 2004, technical report, Department of Electrical and Computer Engineering, University of Waterloo, Canada, available at http://bbcr.uwaterloo.ca/~cai/tech-04-1.pdf.
23. S. Floyd and K. Fall, “Promoting the use of end-to-end congestion control in the Internet,” IEEE/ACM Trans. Networking, vol. 7, no. 4, pp. 458–472, August 1999.
24. “The PingER project,” 2004, available http://www-iepm.slac.Stanford.edu/pinger/.
25. V. Jacobson and M. Karels, “Congestion avoidance and control,” in Proc. ACM SIGCOMM’88, 1988, pp. 314–329.
26. E. Ayanoglu, S. Paul, T. F. LaPorta, K. K. Sabnani, and R. D. Gitlin, “AIRMAIL: A link-layer protocol for wireless networks,” Wireless Networks, vol. 1, no. 1, pp. 47–69, 1995.
27. C. Parsa and J. J. Garcia-Luna-Aceves, “Improving TCP performance over wireless network at the link layer,” Mobile Networks & Applications, vol. 5, no. 1, pp. 57–71, 2000.
28. H. Shen, L. Cai, and X. Shen, “Performance analysis of equation based TFRC over wireless links with link level ARQ,” in Proc. IEEE Globecom'04, vol. 3, 2004, pp. 1681–1685.
29. L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, “Explicit window adaptation: a method to enhance TCP performance,” IEEE/ACM Trans. Networking, vol. 10, no. 3, pp. 338–350, 2002.
30. M. C. Chan and R. Ramjee, “Improving TCP/IP performance over third generation wireless networks,” in Proc. IEEE INFOCOM'04, 2004.