A game-theoretic approach towards congestion control in communication networks

Computer Communication Review

Volumn 32, Issue 3, 2002, Pages 47-61

  Garg, Rahul ^a   Kamra, Abhinav ^b   Khurana, Varun ^c  

^a IBM INDIA RESEARCH LAB   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c Network Appliance Inc   (United States)

Author keywords

Congestion Control; DWS; Fairness; Game Theory; Generalized Processor Sharing; GPS; Nash Equilibrium; RIS; Scheduling; Stackelberg Equilibrium; TCP

Indexed keywords

BUFFER STORAGE; CONGESTION CONTROL (COMMUNICATION); GLOBAL POSITIONING SYSTEM; ROUTERS; SCHEDULING; TELECOMMUNICATION NETWORKS;

CONGESTION CONTROL; DWS; FAIRNESS; GENERALIZED PROCESSOR SHARING; NASH EQUILIBRIUM; RIS; STACKELBERG EQUILIBRIUM; TCP;

GAME THEORY;

EID: 10844270135     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/571697.571723     Document Type: Conference Paper

References (34)

1. Network simulator (NS), 2001. URL:http://www.isi.edu/nsnam/ns/.
2. A. Albanese, J. Blomer, J. Edmonds, M. Luby, and M. Sudan. Priority encoding transmission. In IEEE Symposium on Foundations of Computer Science, pages 604-612, 1994.
3. J. C. R. Bennett and H. Zhang. WF2Q: worst-case fair weighted fair queueing. In Proceedings of INFOCOM, pages 120-128, San Fransisco, California, Mar. 1996.
4. D. P. Bertsekas and R. G. Gallager. Data Networks. Prentice Hall, Englewood Cliffs, NJ, USA, 1992.
5. L. S. Brakmo and S. W. O'Malley. TCP Vegas: New techniques for congestion detection and avoidance. In Proceedings of SIGCOMM, pages 34-35, London, United Kingdom, Aug. 1994. ACM.
6. A. K. Choudhury and E. L. Hahne. Dynamic queue length thresholds in a shared memory ATM switch. In Proceedings of INFOCOM, San Fransisco, California, Mar. 1996.
7. S. Floyd. Congestion control principles. Request for Comments 2914, Internet Engineering Task Force, Sept. 2000.
8. 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, August 1999.
9. S. Floyd and T. Henderson. The NewReno modification to TCP's fast recovery algorithm. Request for Comments 2582, Internet Engineering Task Force, Apr. 1999.
10. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. ACM/IEEE Transactions on Networking, 1(4):397-413, Aug. 1993.
11. D. Fudenberg and J. Tirole. Game Theory. MIT Press, October 1991.
12. R. Garg, A. Kamra, and V. Khurana. Eliciting cooperation from selfish users: A game-theoretic approach towards congestion control in communication networks. Technical Report RI01001, IBM Research, April 2001. Available at http://www.research.ibm.com/resources/paper_search.html.
13. S. J. Golestani. A self-clocked fair queuing scheme for broadband applications. In Proceedings of INFOCOM, pages 636-646, April 1994.
14. V. Jacobson. Congestion avoidance and control. Computer Communications Review, 18(4):314-329, Aug. 1988.
15. J. M. Jaffe. Bottleneck flow control. IEEE Transactions on Communications, 29(7):954-962, 1981.
16. R. Jain, S. Kalyanaraman, R. Goyal, S. Fahmy, and R. Viswanathan. ERICA switch algorithm: A complete description. Technical report, ATM Forum/96-1172, August 1996.
17. H. T. Kung, T. Blackwell, and A. Chapman. Credit update protocol for flow-controlled ATM networks: Statistical multiplexing and adaptive credit allocation. In Proceedings of SIGCOMM, pages 101-114, London, UK, Sept. 1994.
18. D. Lin and R. Morris. Dynamics of random early detection. In Proceedings of the ACM SIGCOMM'97 Conference, pages 127-138, New York, September 1997.
19. M. Mathis and J. Mahdavi. Forward acknowledgement: Refining TCP congestion control. Computer Communications Review, 26(4):281-291, Oct. 1996.
20. M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP selective acknowledgement options. Request for Comments 2018, Internet Engineering Task Force, Oct. 1996.
21. J. Mo, R. La, V. Anantharam, and J. Walrand. Analysis and comparison of TCP Reno and Vegas. In Proceedings of INFOCOM, New York, Mar. 1999.
22. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control - the single node case. In Proceedings of INFOCOM, May 1992.
23. J. Postel. Transmission control protocol. Request for Comments 793, Internet Engineering Task Force, Sept. 1981.
24. W. Prue and J. Postel. Something a host could do with source quench: The source quench introduced delay (SQuID). Request for Comments 1016, Internet Engineering Task Force, July 1987.
25. K. Ramakrishnan and S. Floyd. A proposal to add explicit congestion notification (ECN) to IP. Request for Comments 2481, Internet Engineering Task Force, Jan. 1999.
26. K. Ramakrishnan and R. Jain. A binary feedback scheme for congestion avoidance in computer networks. ACM Trans. on Computer Systems, 8(2):158-181, May 1990.
27. S. Shenker. Making greed work in networks: A game-theoretic analysis of switch service disciplines. In Proceedings of SIGCOMM, pages 47-57, London, UK, Sept. 1994.
28. D. Stiliadis and A. Varma. Design and analysis of frame-based fair queuing: A new traffic scheduling algorithm for packet switched networks. In Proceedings of the ACM BIOMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 104-115, New York, May 1996.
29. I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. In ACM Sigcomm '98, Septermber 1998.
30. B. Suter, T. V. Lakshman, D. Stiliadis, and A. K. Choudhury. Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing. IEEE Journal on Selected Areas in Communications, 17(6):1159-1169, June 1999.
31. A. Varma and D. Stiliadis. Hardware implementation of fair queueing algorithms for asynchronous transfer mode networks. IEEE Communications Magzine, pages 54-68, December 1997.
32. C.-Q. Yang and A. V. S. Reddy. A taxonomy for congestion control algorithms in packet switching networks. IEEE Network Magazine, 9(5), July/August 1995.
33. H. Zhang and J. C. R. Bennett. Hierarchical packet fair queueing algorithms. In Proceedings of ACM SIGCOMM, pages 143-156. ACM, September 1997.
34. L. Zhang. Virtual clock: A new traffic control algorithm for packet switching networks. ACM Transactions on Computer Systems, 9:101-124, May 1991.