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
Randomized algorithms
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
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
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
End-to-end congestion control for the internet: delays and stability
IEEE/ACM Transactions on Networking (TON)
Broadcast scheduling: when fairness is fine
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A randomized online algorithm for bandwidth utilization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computer Networking: A Top-Down Approach Featuring the Internet Package
Computer Networking: A Top-Down Approach Featuring the Internet Package
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Non-clairvoyant scheduling with precedence constraints
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Scalably scheduling processes with arbitrary speedup curves
ACM Transactions on Algorithms (TALG)
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
Hi-index | 0.00 |
While the well-known Transport Control Protocol (TCP) is a de facto standard for reliable communication on the Internet, and performs well in practice, the question "how good is the TCP/IP congestion control algorithm?" is not completely resolved. In this paper, we provide some answers to this question using the competitive analysis framework. First, we prove that for networks with a single bottleneck (or point of congestion), TCP is competitive to the optimal global algorithm in minimizing the user-perceived latency or flow time of the sessions. Specifically, we show that with O(1) times as much bandwidth and O(1) extra time per job, TCP is O(1)-competitive against an optimal global algorithm. We motivate the need for allowing TCP to have extra resources by observing that existing lower bounds for non-clairvoyant scheduling algorithms imply that no online, distributed, non-clairvoyant algorithm can be competitive with an optimal offline algorithm if both algorithms were given the same resources. Second, we show that TCP is fair by proving that it converges quickly to allocations where every session gets its fair share of network bandwidth.