Bottleneck routing games in communication networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Banner, Ron ^a   Orda, Ariel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK ROUTING; OPTIMIZATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

BOTTLENECK GAMES; NASH EQUILIBRIUM; ROUTING SCENARIOS;

GAME THEORY;

EID: 39049093132     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.226     Document Type: Conference Paper

References (35)

1. E. Altman, Flow Control using the theory of zero-sum Markov games, IEEE Transactions on Automatic Control 39(4), pp. 814-818, April 1994.
2. E. Altman and L. Wynter, Equilibrium, games, and pricing in transportation and telecommunication networks, Networks and Spatial Economics, vol.4, no. 1, 2003.
3. E. Altman, T. Basar, T. Jimenez and N. Shimkin, Competitive routing in networks with polynomial cost, IEEE Transactions on Automatic Control, Vol 47, pp. 92-96, Jan. 2002.
4. th Annual IEEE Symposium on Foundations of Computer Science, October 2004.
5. D. Awduche and J. Malcolm, J. Agogbua, M. O'Dell and J. McManus, Requirements for Traffic Engineering Over MPLS, IETF RFC 2702, September 1999.
6. R. Banner and A. Orda, Bottleneck Games in Noncooperative Networks, CCIT Report No. 538, Department of Electrical Engineering, Technion, Haifa, Israel, 2005. Available from: http://www.ee.technion.ac.il/ people/ron/Bottleneck.pdf
7. D. Bertsekas and R. Gallager, Data networks, Prentice-Hall, 1992.
8. S. Boyd and L. Vandenberghe, Convex Optimization, available from http://www.stanford.edu/~boyd/bv_cvxbook.pdf.
9. D. Braess, Uber ein paradoxon der Verkehrsplanung, Unternehmensforschung, 12:258-268, 1968.
10. J. H. Chang and L. Tassiulas, Energy Conserving Routing in Wireless Ad-Hoc Networks, In proceedings of IEEE Infocom, Tel-Aviv, Israel, March 2000.
11. H. S. Chang, B. W. Kim, C. G. Lee, S. L. Min, Y. Choi, H. S. Yang, D. N. Kim and C. S. Kim., FSA-Based Link-Assignment and Routing in Low-Earth Orbit Satellite Networks IEEE Transactions on Vehicular Technology, 1997.
12. A. Czumaj and B. Vocking, Tight bounds for worst-case equilibria, In proceedings of the 13th Annual Symposium on Discrete Algorithms, San Francisco CA, January 2002.
13. G. Debreu, A Social Equilibrium Existence Theorem, In Proceedings of the National Academy of Sciences, 38, 886-893, 1952.
14. E. Even-Dar and Y. Mansour, Fast Convergence of Selfish Rerouting, In Proceedings of Sixteenth ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
15. M. R. Garey and D. S. Johnson, Computers and Intractability, W.H. Freeman and Co., 1979.
16. I., L., Glicksberg, A further Generalization of the Kakutani Fixed Point Theorem, Proceedings of the American Mathematical Society, 3, 170-174, 1952.
17. H. Kameda, How harmful the paradox can be in Braess/Cohen- KellyJeffries networks, In Proceedings of IEEE INFOCOM 2002, New York, pp. 437-445, June 2002.
18. Y. A. Korilis and A. A. Lazar, On the existence of equilibria in noncooperative optimal flow control, Journal of the ACM 42(3), May 1995.
19. S. Kakutani, A generalization of Brouwer's Fixed Point Theorem, Duke Mathematical Journal, 8: 457-458, 1941.
20. th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 1999.
21. R. La and V. Anantharam, Optimal Routing Control: Repeated Game Approach, IEEE Transactions on Automatic Control, Vol. 47, No. 3, pp. 437 -450, March 2002.
22. A. A. Lazar, A. Orda and D. E. pendarakis, Virtual path bandwidth allocation in multi-user networks, IEEE/ACM Transactions on Networking, vol. 5, No. 6 pages 861-871, December 1997.
23. Q. Ma and P. Steenkiste, On path selection for traffic with bandwidth guarantees, in IEEE International Conference on Network Protocols, 1997.
24. A. Orda, R. Rom and N. Shimkin, Competitive routing in multiuser communication networks, IEEE/ACM Transactions on Networking vol. 1, pages 510-521, October 1993.
25. G. Owen. Game Theory, Academic Press, Third Edition, 1995.
26. C. Papadimitriou, Algorithms, games and the Internet, In proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, Heraklion, Crete, Greece, July 2001.
27. K. Park, M. Sitharam and S. Chen, Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness, In proceedings of the first international conference on Information and computation economies, pp.111-127, October 1998, Charleston, South Carolina.
28. P. Reny, On the Existence of Pure and Mixed Strategy Nash Equilibrium in Discontinuous Games, Econometrica, Vol 67, pp. 1029-1056, September 1999.
29. J. B. Rosen, Existence and Uniqueness of Equilibrium Points for Concave N-Person Games, Econometria, Vol. 33, pp. 510-534, July 1965
30. nd Symposium on Foundations of Computer Science, Las Vegas, NV, October 2001.
31. T. Roughgarden and E. Tardos, How bad is selfish routing?, Journal of the ACM, vol. 49, no. 2, pp. 236-259, March 2002.
32. W. Rudin, Principles of mathematical analysis, Third Edition, McGraw Hill, 1976.
33. Y. Wang and Z. Wang, Explicit routing algorithms for Internet Traffic Engineering, In proceedings of ICCN'99, Boston, October 1999.
34. Z. Zhang and C. Douligeris, Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment, IEEE Transactions on Computers vol. 40, No.8, August 1992.
35. G. Zussman and A. Segall, Energy Efficient Routing in Ad Hoc Disaster Recovery Networks, Proc. IEEE Infocom 2003, San Francisco, April 2003