On the competitiveness of AIMD-TCP within a general network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 567-576

  Edmonds, Jeff ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

AIMD; Fairness; Flow time; Multi bottleneck; Online competitive ratio; TCP

Indexed keywords

CONGESTION CONTROL (COMMUNICATION);

AIMD; FAIRNESS; FLOW-TIME; MULTI BOTTLENECKS; ONLINE COMPETITIVE RATIOS;

SCHEDULING ALGORITHMS;

EID: 35048835683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (15)

1. F. Baccelli and D. Hong. AIMD, Fairness and Fractal Scaling of TCP Traffic RR-4155 INRIA Rocquencourt and Infocom, June 2002
2. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
3. D.M. 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. Jeff Edmonds. Scheduling in the dark. In Journal of Theoretic Computer Science, 1999
5. and ACM Symposium on Theory of Computing, pages 179-188, 1999.
6. Jeff Edmonds. Scheduling in the dark - improved results: manuscript, http://www.cs.yorku.ca/~jeff, 2001.
7. th Ann. ACM Symp. of Parallelism in Algorithms and Achitectures, pp. 174-183, 2003.
8. 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.
9. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as Clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
10. 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.
11. F. Kelly. Mathematical modelling of the internet. In Bjorn Engquist and Wilfried Schmid (Eds.), Mathematics Unlimited - 2001 and Beyond. Springer, 2001.
12. F. Kelly. Fairness and stability of end-to-end congestion control European Control Conference, Cambridge, 2003
13. 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.
14. J. Kurose, and K. Ross, "Computer networking: A top-down approach featuring the Internet", Addison-Wesley, 2002.
15. 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.