ON TCP WESTWOOD BANDWIDTH ESTIMATION WITH REORDERED SEGMENTS

摘要

There are many approaches to better control congestion in modern networks. Many possibilities arises around available bandwidth estimation techniques. Such an estimation can be used for proper adjusting protocol parameters to the network state. TCP Westwood approaches use a procedure for counting combined delayed and cumulative acknowledgements to the estimated value. In this paper we propose modifications to this procedure and discuss their advantage in network scenario with reordered segments. We have observed examples of that critical events when Westwood segments counting algorithm may result in wrong bandwidth estimation. Applying proposed changes allows to eliminate problems and reduce new ones in future.