This Article 
 Bibliographic References 
 Add to: 
Bandwidth Estimation Schemes for TCP over Wireless Networks
April 2004 (vol. 3 no. 2)
pp. 129-143

Abstract—The use of enhanced bandwidth estimation procedures within the congestion control scheme of TCP was proposed recently as a way of improving TCP performance over links affected by random loss. This paper first analyzes the problems faced by every bandwidth estimation algorithm implemented at the sender side of a TCP connection. Some proposed estimation algorithms are then reviewed, analyzing and comparing their estimation accuracy and performance. As existing algorithms are poor in bandwidth estimation, and in sharing network resources fairly, we propose TIBET (Time Intervals based Bandwidth Estimation Technique). This is a new bandwidth estimation scheme that can be implemented within the TCP congestion control procedure, modifying only the sender-side of a connection. The use of TIBET enhances TCP source performance over wireless links. The performance of TIBET is analyzed and compared with other schemes. Moreover, by studying TCP behavior with an ideal bandwidth estimation, we provide an upper bound to the performance of all possible schemes based on different bandwidth estimates.

[1] M. Mathis, J. Semke, and J. Mahdavi, The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm ACM Computer Comm. Rev., vol. 27, no. 3, 1997.
[2] T.V. Lakshman and U. Madhow, The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss IEEE/ACM Trans. Networking, vol. 5, no. 3, pp. 336-350, 1997.
[3] H. Balakrishnan, V.N. Padmanabhan, S. Seshan, and R.H. Katz, A Comparison of Mechanisms for Improving TCP Performance over Wireless Links CIEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 759-769, Dec. 1997.
[4] S. Mascolo, M.Y. Sanadidi, C. Casetti, M. Gerla, and R. Wang, TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks Wireless Networks J., vol. 8, pp. 467-479, 2002.
[5] A. Capone and F. Martignon, Bandwidth Estimates in the TCP Congestion Control Scheme Proc. Tyrrhenian Int'l Workshop Digital Comm., Sept. 2001.
[6] S. Keshav, A Control-Theoretic Approach to Flow Control Proc. ACM SIGCOMM, pp. 3-15, Sept. 1991.
[7] J.C. Hoe, Improving the Start-Up Behavior of a Congestion Control Scheme for TCP ACM SIGCOMM Computer Comm. Rev., vol. 26, no. 4, pp. 270-280, Oct. 1996.
[8] M. Allman and V. Paxson, On Estimating End-to-End Network Path Properties Proc. ACM SIGCOMM, 1999.
[9] L.S. Brakmo and L.L. Peterson, TCP Vegas: End-to-End Congestion Avoidance on a Global Internet IEEE J. Selected Areas in Comm., vol. 13, no. 8, pp. 1465-1480, Oct. 1995.
[10] R. Wang, M. Valla, M.Y. Sanadidi, and M. Gerla, Adaptive Bandwidth Share Estimation in TCP Westwood Proc. Globecom, 2002.
[11] J.C. Mogul, Observing TCP Dynamics in Real Networks Proc. ACM SIGCOMM Symp. Comm. Architectures and Protocols, pp. 305-317, 1992.
[12] L. Zhang, S. Shenker, and D. Clark, Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic Proc. SIGCOMM Symp. Comm. Architectures and Protocols, pp. 133-147, Sept. 1991.
[13] V. Paxson and M. Allman, Computing TCP's Retransmission Timer RFC 2988, Nov. 2000.
[14] J. Mo, V. Anantharam, R.J. La, and J. Walrand, Analysis and Comparison of TCP Reno and Vegas Proc. ACM GLOBECOM, 1999.
[15] C. Dovrolis, P. Ramanathan, and D. Moore, What do Packet Dispersion Techniques Measure? Proc. Infocom, vol. 2, pp. 905-914, 2001.
[16] C. Dovrolis and M. Jain, End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput Proc. ACM SIGCOMM, Aug. 2002.
[17] S. Mascolo, C. Casetti, M. Gerla, and S.S. Lee, M. Sanadidi, TCP Westwood: Congestion Control with Faster Recovery UCLA CS Technical Report #200017, 2000.
[18] R. Wang, M. Valla, M.Y. Sanadidi, B. Ng, and M. Gerla, Efficiency/Friendliness Tradeoffs in TCP Westwood Proc. IEEE Symp. Computers and Comm., July 2002.
[19] ns-2 network simulator (ver. 2), LBL,http://www.isi.edunsnam, 2004.
[20] M. Allman, V. Paxson, and W. Stevens, TCP Congestion Control RFC 2581, Apr. 1999.
[21] I. Stoica, S. Shenker, and H. Zhang, Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Proc. ACM SIGCOMM, Sept. 1998.
[22] L.A. Grieco, S. Mascolo, and R. Ferorelli, Additive-Increase/Adaptive-Decrease Congestion Control: A Mathematical Model and Its Experimental Validation Proc. IEEE Int'l Symp. Computer and Comm., July 2002.
[23] S. Floyd and T.R. Henderson, The NewReno Modifications to TCP's Fast Recovery Algorithm IETF RFC 2582, vol. 26, no. 4, Apr. 1999.
[24] S. Floyd, M. Mathis, J. Mahdavi, and A. Romanow, TCP Selective Acknowledgement Option RFC 2018, Apr. 1996.
[25] M. Zorzi, A. Chockalingam, and R.R. Rao, Throughput Analysis of TCP on Channels with Memory IEEE J. Selected Areas in Comm., vol. 18, pp. 1289-1300, July 2000.
[26] A. Chockalingam and M. Zorzi, Wireless TCP Performance with Link Layer FEC/ARQ Proc. IEEE Int'l Conf. Comm., vol. 2, pp. 1212-1216, June 1999.
[27] A.A. Abouzeid, S. Roy, and M. Azizoglu, Stochastic Modeling of TCP over Lossy Links Proc. INFOCOM, Mar. 2000.
[28] Monarch Project,http:/, 2004.
[29] N. Cardwell, S. Savage, and T. Anderson, Modeling TCP Latency Proc. INFOCOM, pp. 1742-1751, 2000.
[30] NIST Net Home Page,, 2004.

Index Terms:
TCP, bandwidth estimation, wireless.
Antonio Capone, Luigi Fratta, Fabio Martignon, "Bandwidth Estimation Schemes for TCP over Wireless Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 2, pp. 129-143, April 2004, doi:10.1109/TMC.2004.5
Usage of this product signifies your acceptance of the Terms of Use.