The design philosophy of the DARPA internet protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Observing TCP dynamics in real networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Link capacity allocation and network control by filtered input rate in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Improving the start-up behavior of a congestion control scheme for TCP
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
On estimating end-to-end network path properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Measuring link bandwidths using a deterministic model of packet delay
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A control theoretic approach to active queue management
Computer Networks: The International Journal of Computer and Telecommunications Networking
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Aggregate traffic performance with active queue management and drop from tail
ACM SIGCOMM Computer Communication Review
Bandwidth Estimates in the TCP Congestion Control Scheme
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
End-to-End Bandwidth Estimation for Congestion Control in Packet Networks
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Performance evaluation of Westwood+ TCP congestion control
Performance Evaluation - Internet performance symposium (IPS 2002)
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
ACM SIGCOMM Computer Communication Review
Fluid-flow analysis of TCP Westwood with RED
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fluid-flow analysis of TCP Westwood with RED
Computer Networks: The International Journal of Computer and Telecommunications Networking
TCP WELCOME TCP variant for wireless environment, link losses, and congestion packet loss modEls
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Performance of different TCP variants in IEEE 802.11 WLAN and the TCP-WOW algorithm
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On transport layer mechanisms for real-time QoS
Journal of Mobile Multimedia
Congestion control for sudden bandwidth changes in TCP
International Journal of Communication Systems
| Hi-index | 0.00 |
TCP Westwood (TCPW) is a sender-side only modification of TCP Reno congestion control, which exploits end-to-end bandwidth estimation to properly set the values of slow-start threshold and congestion window after a congestion episode. This paper aims at showing via both mathematical modeling and extensive simulations that TCPW significantly improves fair sharing of high-speed networks capacity and that TCPW is friendly to TCP Reno. Moreover, we propose EASY RED, which is a simple Active Queue management (AQM) scheme that improves fair sharing of network capacity especially over high-speed networks. Simulation results show that TCP Westwood provides a remarkable Jain's fairness index increment up to 200% with respect to TCP Reno and confirm that TCPW is friendly to TCP Reno. Finally, simulations show that Easy RED improves fairness of Reno connections more than RED, whereas the improvement in the case of Westwood connections is much smaller since Westwood already exhibits a fairer behavior by itself.