Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
The effects of asymmetry on TCP performance
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Beyond AIMD: Explicit Fair-share Calculation
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Energy/Throughput Tradeoffs of TCP Error Control Strategies
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.24 |
The work describes the performance of two congestion control algorithms: AIMD and @t-AIMD. The first is the default mechanism of TCP; the second is a proposed congestion control algorithm that improves fairness of AIMD. We consider asynchronous networks where TCP flows have different propagation delays, a portion of their link is wireless, and they compete for resources over a single bottleneck link. We show that @t-AIMD improves the performance of flows that have long propagation delay and the fairness of the network. In wireless links @t-AIMD outperforms AIMD and the cost of lost packets (or wasted energy) is the same as that of AIMD.