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
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Time scale analysis scalability issues for explicit rate allocation in ATM networks
IEEE/ACM Transactions on Networking (TON)
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Online computation and competitive analysis
Online computation and competitive analysis
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
An efficient rate allocation algorithm for ATM networks providing max-min fairness
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
Round-robin scheduling for max-min fairness in data networks
IEEE Journal on Selected Areas in Communications
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Hi-index | 5.23 |
This paper studies the performance of AIMD (Additive Increase Multiplicative Decrease) TCP as an online distributed scheduling algorithm for allocating transmission rate to sessions/jobs running on a general network. The network consists of a set of routers which in this context act only as bottlenecks, i.e. when a router's capacity has been reached, it informs the jobs passing through it to multiplicatively back off transmission rates. The analysis is easier when this AIMD algorithm is modeled by a continuous algorithm. We improve on that presented by Kelly to better capture the interconnectedness of the network. Extending the paper by Edmonds, Datta, and Dymond that solves the single-bottleneck case, we prove that with extra resources, this algorithm AIMDEQUI is competitive against the optimal global algorithm in minimizing the average transmission time of the jobs. We also bound the fairness of this resource allocation according to three different definitions of fairness.