Incentive compatibility and dynamics of congestion control

Performance Evaluation Review

Volumn 38, Issue 1 SPEC. ISSUE, 2010, Pages 95-106

  Godfrey, P Brighten ^a   Schapira, Michael ^b,c   Zohar, Aviv ^d,e   Shenker, Scott ^c,f  

^a University of Illinois at Urbana Champaign   (United States)

^b Yale University   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^e MICROSOFT RESEARCH   (United States)

^f INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Congestion control; Incentives; Queueing; TCP

Indexed keywords

COMPLEX DYNAMICS; CONGESTION CONTROL; FEEDBACK EFFECTS; FLOW PROCESSING; INCENTIVE COMPATIBILITY; INCENTIVE COMPATIBLE; PRIORITY QUEUEING; SIMPLE TOPOLOGY; UDP FLOWS; WEIGHTED FAIR QUEUEING;

QUEUEING THEORY; ROUTERS;

TRANSMISSION CONTROL PROTOCOL;

EID: 77954910715     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1811099.1811051     Document Type: Conference Paper

References (27)

1. A. Akella, S. Seshan, R. Karp, S. Shenker, and C. Papadimitriou. Selfish behavior and stability of the internet: a game-theoretic analysis of tcp. SIGCOMM Comput. Commun. Rev., 32(4):117-130, 2002.
2. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In SIGCOMM '89: Symposium proceedings on Communications architectures & protocols, pages 1-12, New York, NY, USA, 1989. ACM.
3. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Journal of Internetworking Research and Experience, pages 3-26, October 1990.
4. J. Feigenbaum, C. H. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. Distributed Computing, 18(1):61-72, 2005.
5. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer System Sciences, 63(1):21-41, 2001.
6. J. Feigenbaum, V. Ramachandran, and M. Schapira. Incentive-compatible interdomain routing. In EC '06: Proceedings of the 7th ACM conference on Electronic commerce, pages 130-139, New York, NY, USA, 2006. ACM.
7. J. Feigenbaum, M. Schapira, and S. Shenker. Distributed Algorithmic Mechanism Design. A chapter in ̀Algorithmic Game Theory". Cambridge University Press, 2007.
8. S. Floyd. Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic. Computer Communication Review (CCR), 21(5):30-47, October 1991.
9. S. Floyd. Connections with multiple congested gateways in packet-switched networks part 2: two-way traffic, 1991. Unpublished manuscript.
10. 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.
11. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397-413, August 1993.
12. R. J. Gibbens and F. P. Kelly. Resource pricing and the evolution of congestion control. Automatica, 35:1969-1985, 1999.
13. S. Goldberg, S. Halevi, A. D. Jaggard, V. Ramachandran, and R. N. Wright. Rationality and traffic attraction: incentives for honest path announcements in BGP. In SIGCOMM, pages 267-278, 2008.
14. V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM '88, pages 314-329, Stanford, CA, August 1988.
15. F. Kelly. Mathematical modelling of the internet. In B. Engquist and W. Schmid, editors, Mathematics Unlimited - 2001 and Beyond, pages 685-702. Springer-Verlag, 2001.
16. F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommuncations, 8:33-37, 1997.
17. T. Kelly, S. Floyd, and S. Shenker. Patterns of congestion collapse, 2003. Unpublished manuscript.
18. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 404-413, 1999.
19. H. Levin, M. Schapira, and A. Zohar. Interdomain routing and games. In STOC 08: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 57-66, Victoria, British Columbia, Canada, May 2008.
20. D. Lin and R. Morris. Dynamics of random early detection. SIGCOMM Comput. Commun. Rev., 27(4):127-137, 1997.
21. S. H. Low, F. Paganini, J. Wang, S. Adlakha, and J. C. Doyle. Dynamics of tcp/red and a scalable control. In In Proceedings of IEEE INFOCOM 2002, pages 239-248, 2002.
22. N. Nisan and A. Ronen. Algorithmic mechanism design. Games and Economic Behavior, 35(1):166-196, 2001.
23. R. Oliveira, B. Zhang, D. Pei, R. Izhak-Ratzin, and L. Zhang. Quantifying path exploration in the Internet. In Proc. Internet Measurement Conference, October 2006.
24. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw., 1(3):344-357, 1993.
25. B. Raghavan and A. Snoeren. Decongestion control. In Proceedings of the Fifth Workshop on Hot Topics in Networks (HotNets-V), pages 61-66. ACM Press, November 2006.
26. I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. In Proc. SIGCOMM, 1998.
27. K. Varadhan, R. Govindan, and D. Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 32(1):1-16, March 2000.