Author:
Koutsoupias Elias,Papadimitriou Christos
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L. Peterson, K. Ramakrishnan, S. Shenker, J. Wroclawski, and L. Zhang. Recommendations on Queue Management and Congestion Avoidance in the Internet, April 1998. http://info.internet.isi.edu:80/in-notes/rfc/files/rfc2309.txt
2. Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1):91–103, 1980.
3. S. Floyd and K. Fall. Router Mechanisms to Support End-to-End Congestion Control. Technical report, Lawrence Berkeley National Laboratory, February 1997.
4. G. R. Grimmet and D. R. Stirzaker. Probability and Random Processes, 2nd ed.. Oxford University Press, 1992.
5. Y. Korilis and A. Lazar. On the existence of equilibria in noncooperative optimal flow control. Journal of the ACM 42(3):584–613, 1995.
Cited by
727 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献