Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
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
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)
Improving the start-up behavior of a congestion control scheme for TCP
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
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)
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
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
| Hi-index | 0.00 |
Many bandwidth estimation techniques, somehow related to the TCP world, have been proposed in the literature and adopted to solve several problems. In this paper we discuss their impact on the congestion control of TCP and we propose an algorithm which performs an explicit and effective estimate of the used bandwidth. We show by simulation that it efficiently copes with the packet clustering and ACK compression effects without leading to the biased estimate problem of existing algorithms.We present numerical results proving that TCP sources implementing the proposed scheme with an unbiased used-bandwidth estimate fairly share the bottleneck bandwidth with classical TCP Reno sources. Finally, we point out the benefits of using the proposed scheme compared to TCP Reno in networks with wireless links.