Bottleneck routing games in communication networks

IEEE Journal on Selected Areas in Communications

Volumn 25, Issue 6, 2007, Pages 1173-1179

  Banner, Ron ^a,b   Orda, Ariel ^a,c  

^a IEEE   (Israel)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bottleneck metrics; Noncooperative networks; Price of anarchy; Selfish routing

Indexed keywords

BOTTLENECK METRICS; NONCOOPERATIVE NETWORKS; PRICE OF ANARCHY; SELFISH ROUTING;

OPTIMIZATION; ROUTING ALGORITHMS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; USER INTERFACES;

GAME THEORY;

EID: 34547466608     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2007.070811     Document Type: Article

References (39)

1. E. Altman, "Flow control using the theory of zero-sum Markov games," IEEE Trans. Autom. Control, vol. 39, no. 4, pp. 814-818, Apr. 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 Trans. Autom. Control, vol. 47, pp. 92-96, Jan. 2002.
4. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden, "The price of stability for network design with, fair cost allocation," in Proc. 45th IEEE Symp. Foundations Computer Science, Oct. 2004.
5. D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus, "Requirements for traffic engineering over MPLS," IETF RFC 2702, Sep. 1999.
6. R. Banner and A. Orda, "Bottleneck games in noncooperative networks," CCIT Report No. 538, Dept. of Electrical Engineering, Technion, Haifa, Israel, 2005. [Online.] Available: http://www.ee.technion.ac.il/people/ ron/Bottleneck.pdf
7. T. Boulogne and E. Altman, "Competitive routing in multicast communications," Networks, vol. 46, no. 1, pp. 22-35, 2005.
8. D. Bertsekas and R. Gallager, Data Networks. Upper Saddle River, NJ: Prentice Hall, 1992.
9. S. Boyd and L. Vandenberghe, Convex Optimization. [Online.] Available: http://www.stanford.edu/~boyd/bv_cvxbook.pdf.
10. D. Braess, "Uber ein paradoxon der Verkehrsplanung," Unternehmensforschung, 12:258-268, 1968.
11. J. H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad-hoc networks," in. Proc. IEEE INFOCOM, Mar. 2000.
12. 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 Trans. Veh. Technol., 1997.
13. A. Czumaj and B. Vocking, "Tight bounds for worst-case equilibria," Proc. 13th Annual Symp. Discrete Algoritlims, Jan. 2002.
14. G. Debreu, "A social, equilibrium existence theorem," in Proc. National Academy of Sciences, vol. 38, pp. 886-893, 1952.
15. E. Even-Dar and Y. Mansour, "Fast convergence of selfish rerouting," in. Proc. 16th ACM-SIAM Symp. Discrete Algorithms, 2005.
16. M. R. Garey and D. S. Johnson, Computers and Intractability. W. H. Freeman and Co., 1979.
17. I. L. Glicksberg, "A further generalization, of the Kakutani fixed point theorem," Proc. American Mathematical Society, vol. 3, pp. 170-174, 1952.
18. C. Hopps, "Analysis of an equal-cost multi-path algorithm," RFC 2992, Nov. 2000.
19. H. Kameda, "How harmful the paradox can be in Braess/Cohen-Kelly- Jeffri.es networks," in Proc. IEEE INFOCOM, June 2002, pp. 437-445.
20. Y. A. Korilis and A. A. Lazar, "On. the existence of equilibria in. noncooperative optimal flow control," J. ACM, vol. 42, no. 3, May 1995.
21. S. Kakutani, "A generalization of Brouwer's fixed point theorem," Duke Mathematical J., vol. 8, pp. 457-458, 1941.
22. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," in Proc. 16th Annual Symp. Theoretical Aspects Computer Science, Mar. 1999.
23. R. La and V. Anantharam, "Optimal routing control: Repeated game approach," IEEE Trans. Autom. Control, vol. 47, no. 3, pp. 437-450, Mar. 2002.
24. A. A. Lazar, A. Orda, and D. E. Pendarakis, "Virtual path bandwidth allocation in multi-user networks," IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 861-871, Dec. 1997.
25. P. Lee, V. Misra, and D. Rubenstein, "Distributed algorithms for secure multiparth routing," in Proc. IEEE INFOCOM, Mar. 2005.
26. Q. Ma and P. Steenkiste, "On path selection for traffic with bandwidth guarantees," in Proc. IEEE International Conf. Network Protocols, 1997.
27. L. Libman and A. Orda, "The designer's perspective to atomic noncooperative networks," IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 875-884, Dec. 1999.
28. A. Orda, R. Rom, and N. Shimkin, "Competitive routing in multiuser communication networks," IEEE/ACM Trans. Networking, vol. 1, pp. 510-521, Oct. 1993.
29. G. Owen, Game Theory, 3rd ed. Academic Press, 1995.
30. C. Papadimitriou, "Algorithms, games and the Internet," in Proc. 33d ACM Symp. Theory Computing, July 2001.
31. K. Park, M. Sitharam, and S. Chen, "Quality of service provision in noncooperative networks: Heterogenous preferences, multi-dimensional QoS vectors, and burstiness,"in Proc. 1st International Conf Information Computation Economies, Oct. 1998, pp. 111-127.
32. P. Reny, "On the existence of pure and mixed strategy Nash equilibrium in discontinuous games," Econometrica, vol. 67, pp. 1029-1056, Sep. 1999.
33. J. B. Rosen, "Existence and uniqueness of equilibrium points for concave N-person games," Econometria, vol. 33, pp. 510-534, July 1965.
34. R. Rosenthal, "The network equilibrium problem in integers," Networks, vol. 3, pp. 53-59. 1973.
35. T. Roughgarden, "Designing networks for selfish users is hard," in Proc. 42nd Symp. Foundations Computer Science, Oct. 2001.
36. T. Roughgarden and E. Tardos, "How bad is selfish routing?," J. ACM, vol. 49, no. 2, pp. 236-259, Mar. 2002.
37. W. Rudin, Principles of Mathematical Analysis, 3rd ed. New York: McGraw Hill, 1976.
38. C. Villamizar, "OSPF optimised multiparth (OSPF-OMP)," Internet. Draft, 1998.
39. Y. Wang and Z. Wang, "Explicit routing algorithms for Internet traffic engineering," in Proc. ICCN, Oct. 1999.