On-line end-to-end congestion control

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 303-310

  Garg, Naveen ^a   Young, Neal E ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b AKAMAI TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; INTERNET; NETWORK PROTOCOLS; PACKET SWITCHING; ROUTERS; TELECOMMUNICATION TRAFFIC;

LINEAR MULTIPLICATIVE-INCREASE MULTIPLICATIVE DECREASE PROTOCOL; TRANSMISSION CONTROL PROTOCOL;

CONGESTION CONTROL (COMMUNICATION);

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

References (55)

1. Y. Afek, Y. Mansour, and Z. Ostfeld. On the convergence complexity of optimistic rate based flow control algorithms. In Symposium on Principles of Distributed Computing, page 212, 1996.
2. S. Athuraliya and S. H. Low. Optimization flow control with Newton-like algorithm. Journal of Telecommunication Systems, 2000.
3. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive on-line routing. In IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
4. B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In ACM-SIAM Symposium on Discrete Algorithms, pages 321-327, Jan. 1995.
5. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competive non-preemptive call control. In ACM-SIAM Symposium on Discrete Algorithms, pages 312-320, 1995.
6. B. Awerbuch and Y. Shavitt. Converging to approximated max-min flow fairness in logarithmic time. In INFOCOM (3), pages 1350-1357, 1998.
7. Y. Bartal, J. W. Byers, and D. Raz. Global optimization using local information with applications to flow control. In IEEE Symposium on Foundations of Computer Science, pages 303-312, 1997.
8. R. Carter and M. Crovella. Measuring bottleneck link speed in packet-switched networks. Performance Evaluation, 27(8):297-318, Oct. 1996.
9. D.-M. Chiu and R. Jain. Analysis of the increase/decrease algorithms for congestion avoidance in computer networks. Journal of Computer Networks and ISDN, 17(1):1-14, June 1989.
10. S. F. Deepak Bansal, Hari Balakrishnan and S. Shenker. Dynamic behavior of slowly-responsive congestion control algorithms. In SIGCOMM 2001, San Diego, CA, August 2001.
11. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker, Sharing the cost of multicast transmissions. In ACM Symposium on Theory of Computing, pages 218-227, 2000.
12. L. K. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics, 13(4):505-520, Nov. 2000.
13. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397-413, 1993.
14. Y. Freund and R. E. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29:79-103, 1999.
15. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In IEEE Symposium on Foundations of Computer Science, pages 300-309, 1998.
16. A. Goel, A. Meyerson, and S. A. Plotkin. Combining fairness with throughput: Online routing with multiple objectives. In ACM Symposium on Theory of Computing, pages 670-679, 2000.
17. S. J. Golestani and S. Bhattacharyya. A class of end-to-end congestion control algorithms for the Internet. In Proceedings of the International Conference on Network Protocols, 1998.
18. S. Gorinsky and H. Vin. Additive increase appears inferior. Technical Report TR2000-18, Department of Computer Sciences, University of Texas at Austin, May 2000.
19. -2knm) time. Math. Programming, 75:477-482, 1996.
20. M. D. Grigoriadis and L. G. Khachiyan. Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization, 4(1), 1994.
21. M. D. Grigoriadis and L. G. Khachiyan. Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research, 21:321-340, 1996.
22. H. Hochstadt. Differential Equations, A Modern Approach. Dover Publications, 1975.
23. K. Jain and V. V. Vazirani. Applications of approximation algorithms to cooperative games. In ACM Symposium on Theory of Computing, pages 364-372, 2001.
24. K. Jansen and H. Zhang. Approximation algorithms for general packing problems with modified logarithmic potential function. In Proceedings 2nd IFIP International Conference on Theoretical Computer Science, August 2002.
25. R. Johari. Mathematical modeling and control of Internet congestion. SIAM News, 33, 2000.
26. R. Johari and D. K. H. Tan. End-to-end congestion control for the Internet: Delays and stability. IEEE/ACM Transactions on Networking, 9:818-832, 2001.
27. D. Karger and S. A. Plotkin. Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. In ACM Symposium on Theory of Computing, pages 18-25, 1995.
28. R. Karp, E. Koutsoupias, C. Papadimitriou, and S. Shenker. Optimization problems in congestion control. In IEEE Symposium on Foundations of Computer Science, 2000.
29. F. P. Kelly. Mathematical modelling of the Internet. In Proc. of Fourth International Congress on Industrial and Applied Mathematics, 1999.
30. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control in communication networks: Shadow prices, proportional fairness, and stability. Journal of the Operational Research Society, 49(237-252), 1998.
31. S. Keshav. A control-theoretic approach to flow control. Proceedings of the Conference on Communications Architecture and Protocols, pages 3-15, 1993.
32. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM J. Comput., 23(3):466-487, June 1994.
33. P. Klein and N. E. Young. On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. In Lecture Notes in Computer Science, number 1610, pages 320-327, 1999. IPCO '99.
34. J. M. Kleinberg, Y. Rabani, and E. Tardos. Fairness in routing and load balancing. In IEEE Symposium on Foundations of Computer Science, pages 568-578, 1999.
35. Y. Korilis and A. Lazar. Why is flow control hard: Optimality, fairness, partial and delayed information. In Proc. 2nd ORSA Telecommunications Conference, March 1992.
36. K. Lai and M. Baker. Measuring bandwidth. In INFOCOM (1), pages 235-245, 1999.
37. K. Lai and M. Baker. Measuring link bandwidths using a deterministic model of packet delay. In SIGCOMM, pages 283-294, 2000.
38. K. Lai and M. Baker. Nettimer: A tool for measuring bottleneck link bandwidth. In Proceedings of USENIX Symposium on Internet Technologies and Systems., Mar. 2001.
39. T. Leighton, F. Makedon, S. Plotkin, C. Stein, É. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. J. Comput. Syst. Sci., 50(2):228-243, Apr. 1995.
40. S. H. Low and D. E. Lapsley. Optimization flow control I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6):861-874, December 1999.
41. S. H. Low, F. Paganini, and J. C. Doyle. Internet congestion control: An Analytical perspective. IEEE Control Systems Magazine, Jan. 2002.
42. S. H. Low, F. Paganini, J. Wang, S. Adlakha, and J. C. Doyle. Dynamics of tcp/red and a scalable control. IEEE Infocom, June 2002.
43. M. Luby and N. Nisan. A parallel approximation algorithm for positive linear programming. In ACM Symposium on Theory of Computing, pages 448-457, 1993.
44. L. Massoulie. Stability of distributed congestion control with heterogeneous feedback delays. Technical Report MSR-TR-2000-111, Microsoft Corporation, November 2000.
45. R. T. Morris. Scalable TCP Congestion Control. PhD thesis, Harvard University, 1999.
46. F. Paganini, J. Doyle, and S. Low. Scalable laws for stable network congestion control. In Proceedings of Conference on Decision and Control, December 2001.
47. C. H. Papadimitriou and M. Yannakakis. Linear programming without the matrix. In Proc. 25th Annual ACM Symp. on Theory of Computing, pages 121-129, 1993.
48. S. A. Plotkin, D. B. Shmoys, and É. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20(2):257-301, 1995.
49. T. Roughgarden and E. Tardos. How bad is selfish routing? In IEEE Symposium on Foundations of Computer Science, pages 93-102, 2000.
50. D. A. Sánchez. Ordinary Differential Equations and Stability Theory: An Introduction. W. H. Freeman and Company, San Francisco, 1968.
51. F. Shahroki and D. W. Matula. The maximum concurrent flow problem. J. ACM, 37:318-334, 1990.
52. S. Shenker. A theoretical analysis of feedback flow control. In ACM/SIGCOMM, 1990.
53. S. Shenker, D. Clark, D. Estrin, and S. Herzog. Pricing in computer networks: Reshaping the research agenda. Communications Policy, 20(1), 1996.
54. G. Vinnicombe. On the stability of end-to-end congestion control for the Internet. Technical Report CUED/F-INFENG/TR.398, University of Cambridge, December 2000.
55. N. Young. Sequential and parallel algorithms for mixed packing and covering. In IEEE Symposium on Foundations of Computer Science, 2001.