Abstract
Today TCP/IP congestion control implements the additive increase/multiplicative decrease (AIMD) paradigm to probe network capacity and obtain a “rough” but robust measurement of the best effort available bandwidth. Westwood TCP proposes an additive increase/adaptive decrease paradigm that adaptively sets the transmission rate at the end of the probing phase to match the bandwidth used at the time of congestion, which is the definition of best-effort available bandwidth in a connectionless packet network. This paper addresses the challenging issue of estimating the best-effort bandwidth available for a TCP/IP connection by properly counting and filtering the flow of acknowledgments packets using discrete-time filters. We show that in order to implement a low-pass filter in packet networks it is necessary to implement an anti ACK compression algorithm, which plays the role of a classic anti-aliasing filter. Moreover, a comparison of time-invariant and time- varying discrete filters to be used after the anti-aliasing algorithm is developed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jacobson, V.: Congestion avoidance and control, in Proceedings of ACM Sigcomm’ 88, Stanford CA, August (1988) 314–329.
Allman, M., Paxson, V. and Stevens W.R.: TCP congestion control, RFC 2581, April 1999.
Melander, B., Bjorkman, M. and Gunningberg, P.: A New End-to-End Probing and Analysis Method for Estimating Bandwidth Bottlenecks, in Proceedings of Global Internet Symposium, 2000.
Clark, D.: The design philosophy of the DARPA Internet protocols, in Proceedings of ACM Sigcomm’88, Stanford CA, August (1988) 106–114.
Floyd, S., Fall, K.: Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking, Vol. 7(4), (1999), 458–472.
Dah-Ming Chiu, Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN Systems, Vol. 17(1), (1989) 1–14.
Jain, M., Dovrolis, C.: End to End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput, in Proceedings of ACM Sigcomm 2002.
Stoica, I., Shenker, S. and Zhang, H.: Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks, in Proceedings of ACM Sigcomm’ 98, Vancouver, Canada, August (1998) 118–130.
Li, S. Q., and Hwang, C.: Link Capacity Allocation and Network Control by Filtered Input Rate in High speed Networks, IEEE/ACM Transaction on Networking, Vol. 3(1), (1995) 10–25.
Aström, K. J. and B. Wittenmark (1997). Computer controlled systems, Prentice Hall, Englewood Cliffs, N. J, 1995.
Brakmo, L. S., and Peterson, L.: TCP Vegas: End-to-end congestion avoidance on a global Internet. IEEE Journal on Selected Areas in Communications (JSAC), Vol. 13(8), (1995) 1465–1480.
Mascolo, S., Casetti, C., Gerla, M., Sanadidi, M., Wang, R.: TCP Westwood: End-to-End Bandwidth Estimation for Efficient Transport over Wired and Wireless Networks, in Proceedings of ACM Mobicom 2001, Rome, Italy, July (2001).
Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP Throughput: A Simple Model and its Empirical Validation, in Proceedings of ACM Sigcomm 1998, Vancouver BC, Canada, September (1998) 303–314.
Mogul, J. C.: Observing TCP dynamics in real networks, in Proceedings of ACM Sigcomm 1992, 305–317.
Lai, K. and Baker, M.: Measuring Link Bandwidths Using a Deterministic Model of Packet Delay, in Proceedings of ACM Sigcomm 2000, Stockholm, Sweden, August (2000) 283–294.
Floyd, S., Henderson, T.: NewReno Modification to TCP’s Fast Recovery, RFC 2582, April 1999.
Allman, M., Floyd, S., Partridge, C.: Increasing initial TCP’s initial window, RFC 2414, September 1998.
Grieco, L. A., and Mascolo, S.: Westwood TCP and easy RED to improve Fairness in High Speed Networks, in Proceedings of IFIP/IEEE Seventh International Workshop on Protocols For High-Speed Networks, PfHSN02, Berlin, Germany, April (2002) 130–146.
Chaskar, H.M., Lakshman, T.V. and Madhow, U.: TCP Over Wireless with Link Level Error Control: Analysis and Design Methodology, IEEE/ACM Transactions on Networking, Vol. 7(5), (1999) 605–615.
Keshav, S.: A Control-theoretic Approach to Flow Control, in Proceedings of ACM Sigcomm 1991, Zurich, Switzerland, September (1991) 3–6.
Hoe, J. C.: Improving the Start-up Behavior of a Congestion Control Scheme for TCP, in Proceedings of ACM Sigcomm’96, Palo Alto, CA, August (1996) 270–280.
Allman, M. and Paxson, V.: On Estimating End-to-End Network Path Properties, in Proceedings of ACM Sigcomm 1999, Cambridge, Massachusetts, August (1999) 263–276.
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
Alfredo Grieco, L., Mascolo, S. (2003). End-to-End Bandwidth Estimation for Congestion Control in Packet Networks. 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_47
Download citation
DOI: https://doi.org/10.1007/3-540-36480-3_47
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