Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Digital Control of Dynamic Systems
Digital Control of Dynamic Systems
TCP Westwood and Easy RED to Improve Fairness in High-Speed Networks
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
Efficiency/Friendliness Tradeoffs in TCP Westwood
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Design of a robust active queue management algorithm based on feedback compensation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
ACM SIGCOMM Computer Communication Review
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
This paper concerns TCP Westwood (TCPW), a recently developed modification of TCP, in combination with RED queue management. We develop a fluid-flow model of TCPW with RED and use it to study both equilibrium and dynamic features. On the equilibrium side, we identify the scaling of window with loss-probability, and compare it to TCP NewReno. We also use the model to find the boundary of stability, beyond which we see large oscillations; we find that the stable region of TCPW is enhanced with respect to TCP NewReno. Furthermore we show preliminary evidence that oscillations, when they occur, have a limited impact on network throughput. Fairness and friendliness of TCPW is also analyzed and compared with NewReno. Our results show that TCPW is more fair than NewReno for flows with heterogenous round trip time. We also found that TCPW friendliness to NewReno is dependent on the difference between equilibrium queue size and the product of bandwidth and delay.