A randomized online algorithm for bandwidth utilization

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 535-539

  Arora, Sanjeev ^a   Brinkmann, Bo ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; TRANSMISSION CONTROL PROTOCOL;

ALTRUISTIC BEHAVIOR; BAND-WIDTH UTILIZATION; COMPETITIVE RATIO; END-TO-END CONGESTION CONTROL; MULTIPLICATIVE DECREASE; NET WORK UTILIZATION; ON-LINE ALGORITHMS; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 42549124706     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. D. Bansal and H. Balakrishnan. Binomial congestion control algorithms. In Proceedings of INFOCOM, 2001. Extended version available as MIT-LCS-TR-806 from http://nms.lcs.mit.edu/papers/cm-binomial.html.
2. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. Williamson. Adversarial queueing theory. In ACM Symposium on Theory of Computing, pages 376-385, 1996.
3. D. Chiu and R. Jain. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Journal of Computer Networks and ISDN Systems, 17:1-14, 1989.
4. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. Competitive paging algorithms. Journal of Algorithms, 12(4):685-699, 1991.
5. S. Floyd and K. Fall. Promoting the use of end-to-end congestion control in the internet. IEEE/ACM Transactions on Networking, 7(4):458-472, 1999.
6. V. Jacobson. Congestion avoidance and control. In Proceedings of ACM SIGCOMM, pages 314-329, 1988.
7. R. M. Karp, E. Koutsoupias, C. H. Papadimitriou, and S. Shenker. Algorithmic problems in congestion control. In 41st IEEE Symposium on Foundations of Computer Science, pages 66-74, 2000.
8. F. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: shadow prices. Journal of the Operational Research Society, 49:237-252, 1998.
9. L. Peterson and B. Davie. Computer Networks: A Systems Approach, pages 446-515. Morgan Kaufmann Publishers, 2000.
10. S. Savage, N. Cardwell, D. Wetherall, and T. Anderson. TCP congestion control with a misbehaving receiver. Computer Communication Review, 29(5), 1999.
11. S. Shenker. Making greed work in networks: A game-theoretic analysis of switch service disciplines. IEEET-NWKG: IEEE/ACM Transactions on Networking, 3, 1995.
12. A.C.C. Yao. Probabilistic computations: Towards a unified measure of complexity. In 18th Symposium on Foundations of Computer Science, pages 222-227, 1977.