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.
End-to-End Bandwidth Estimation for Congestion Control in Packet Networks / Grieco, Luigi Alfredo; Mascolo, Saverio. - STAMPA. - 2601:(2003), pp. 645-658. (Intervento presentato al convegno 2nd International Workshop on Quality of Service in Multiservice IP Networks, QoS-IP 2003 tenutosi a Milano, Italy nel February 24-26, 2003) [10.1007/3-540-36480-3_47].
End-to-End Bandwidth Estimation for Congestion Control in Packet Networks
Luigi Alfredo Grieco;Saverio Mascolo
2003-01-01
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
