Abstract
In this paper, we propose a novel bandwidth estimation algorithm for TCP connections and its possible application to congestion control mechanism. The estimation algorithm relies upon an analytic relation which expresses the connections’ available bandwidth as a function of the inter-departure time of packets and of the inter-arrival time of ACKs. It is worth noticing that this approach can be extended to protocols other than TCP, as long as they support an acknowledgment mechanism. The bandwidth estimation performance is assessed through discrete event simulations under various network topologies, traffic scenarios and link error conditions. Bandwidth estimation is then applied to TCP congestion control to select the value of the congestion window after a packet loss episode. Performance of this modified version of TCP is validated by means of simulations and compared to the one achieved by TCP NewReno. Finally, the possible coexistence of the modified version of TCP and TCP NewReno is proved through a detailed analysis of fairness and friendliness of the new protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
V. Paxon, “On estimating End-to-End Network Path Properties”, in proceeding of ACM SIGCOMM, September 1999
R. Carter and M.E. Crovella, “Measuring Bottleneck Link Speed in Packet-.Switched Network”, in Performance Evaluation.vol. 27,28, pp. 297–318, 1996
K. Lai and M. Baker,“Measuring Bandwidth”, in proceeding IEEE INFOCOM, April 1999.
J. Hoe, “Improving the Start-up Behaviour of a Congestion Control Scheme for TCP”, in Proceedings ACMS/GCOMM, September 1996
C. Casetti, M. Gerla, S. Mascolo, M.Y. Sanadidi and R. Wang,“TCP Westwood: Bandwidth Estimation for Enhanced Transport over Wireless Links”, in proceedings ofMobicom 2001, Rome, Ital, July 2001
V. Jacobson, “pathchar: A tool to Infer Characteristic of Internet Paths.”, ftp://www.ftp.ee.lbl.gov/pathchar/, April 1997
K. Lai and M. Baker, “Measuring Link Bandwidths using a Deterministic Mode of Packet Delay”, in proceedings ACM SIGCOMM, September 2000.
E. Airman, K. Avrachenkov, C. Barakat, “A Stochastic Model of TCP/IP with Stationary Random Losses”, in Proc. of ACM SIGCOMM, September 2000
B. Melander, M. Bjorkman and B. Gunningberg, “Regression-Based Available Bandwidth Measurement”, in proceeding of SPECTS 2002, San Diego, California, July 2002.
J. Mogul, “Observing TCP Dynamics in Real Networks”, in proceedings SIGCOMM’92, in pag. 305–317, Aug. 1992.
Hari Balakrishnan, Mark Stemm, Srinivasan Seshan, and Randy H. Katz, “Analyzing stability in wide-area network performance”, in SIGMETRICS’97, June 1997
K. Claffy, Greg Miller, and Kevin Thompson, “The nature of the beast: Recent traffic measurement from an Internet backbone”, in proceedings ofINET’98, July 1998
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garroppo, R.G., Giordano, S., Pagano, M., Procissi, G., Secchi, R. (2003). Bandwidth Estimation for TCP Sources and Its Application. In: Marsan, M.A., Corazza, G., Listanti, M., Roveri, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2003. Lecture Notes in Computer Science, vol 2601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36480-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-36480-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00604-6
Online ISBN: 978-3-540-36480-1
eBook Packages: Springer Book Archive