TCP is competitive against a limited adversary

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 174-183

  Edmonds, Jeff ^a   Datta, Suprakash ^a   Dymond, Patrick ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

Competitive analysis; Congestion control; Performance evaluation; Scheduling; TCP IP

Indexed keywords

ALGORITHMS; BANDWIDTH; CODES (STANDARDS); CONGESTION CONTROL (COMMUNICATION); INTERNET; SCHEDULING;

CONGESTION CONTROL ALGORITHMS;

NETWORK PROTOCOLS;

EID: 0038717557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777440     Document Type: Conference Paper

References (27)

1. S. Arora and W. Brinkman. An optimal online algorithm for a bandwidth utilization problem. In Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms, pages 535-539, 2002.
2. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
3. D. Chiu and R. Jain. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer networks and ISDN systems, 17(1):1-14, 1989.
4. D. R. Dooly, S. A. Goldman, and S. D. Scott. TCP dynamic acknowledgement delay: theory and practice. In ACM Symposium on Theory of Computing, pages 23-26, 1998.
5. J. Edmonds. Scheduling in the dark. In ACM Symposium on Theory of Computing, pages 179-188, 1999.
6. J. Edmonds. On the competitiveness of TCP within a general network. Draft available at http://www.cs.yorku.ca/̃jeff/research/tcp, 2001.
7. J. Edmonds. Scheduling in the dark - improved results: manuscript. available at http://www.cs.yorku.ca/̃jeff/research, 2001.
8. J. Edmonds and K. Pruhs. Broadcast scheduling: When fairness is fine. In Accepted for publication in SODA 2002, 2001.
9. S. Floyd. Connections with multiple congested gateways in packet-switched networks, part I: One-way traffic. Computer communications review, 21(5):30-47, October 1991.
10. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397-413, 1993.
11. T. R. Henderson, E. Sahouria, S. McCanne, and R. H. Katz. On improving the fairness of TCP congestion avoidance. In Proceedings of IEEE Globecom '98, volume 1, pages 539-544, 1998.
12. R. Johari and D. Tan. End-to-end congestion control for the internet: delays and stability. IEEE/ACM Transactions on Networking, 9:818-832, 2001.
13. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as Clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
14. R. Karp, E. Koutsoupias, C. Papadimitriou, and S. Shenker. Optimization problems in congestion control. In IEEE Symposium on Foundations of Computer Science, pages 66-74, 2000.
15. F. Kelly. Mathematical modelling of the internet. In Bjorn Engquist and Wilfried Schmid (Eds.), Mathematics Unlimited - 2001 and Beyond. Springer, 2001.
16. F. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. In Journal of the Operational Research Society, volume 49, 1998.
17. J. Kurose and K. Ross. Computer Networking: A top-down approach featuring the internet. Addison-Wesley publishing company, 2000.
18. T. Lakshman and U. Madhow. The performance of networks with high bandwidth-delay products and random loss. IEEE/ACM transactions on networking, 5(3), 1997.
19. L. Massoulie. Stability of distributed congestion control with heterogeneous feedback delays. IEEE Transactions on Automatic Control, 47:895-902, 2002.
20. M. Mathis, J. Semke, J. Mahdavi, and T. Ott. The macroscopic behavior of the TCP congestion avoidance algorithm. Computer communications review, 27(3):67-82, July 1997.
21. A. Misra and T. Ott. The window distribution of idealized TCP congestion avoidance with variable packet loss. In Proceedings of INFOCOM, pages 1564-1572, March 1999.
22. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. Theoretical computer science (Special issue on dynamic and on-line algorithms), 130:17-47, 1994.
23. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
24. T. Ott, J. Kemperman, and M. Mathis. The stationary behavior of ideal TCP congestion avoidance, August 1996. ftp://ftp.bellcore.com/pub/tjo/TCPwindow.ps.
25. J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP throughput: a simple model and its empirical validation. In Proceedings of SIGCOMM, pages 303-314, 1988.
26. W. R. Stevens. TCP illustrated: volume I. Addison-Wesley publishing co., 1994.
27. K. Thompson, G. J. Miller, and R. Wilder. Wide-area internet traffic patterns and characteristics. IEEE Network, 11(6):10-23, November 1997.