On selfish routing in internet-like environments

IEEE/ACM Transactions on Networking

Volumn 14, Issue 4, 2006, Pages 725-738

  Qiu, Lui ^a   Yang, Richard ^b   Zhang, Yin ^a   Shenker, Scott ^c  

^a University of Texas at Austin   (United States)

^b Yale University   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Game theory; Optimization; Overlay; Relaxation; Selfish routing; Traffic engineering; Traffic equilibrium

Indexed keywords

COMPUTER SIMULATION; GAME THEORY; NETWORK ROUTING; OPTIMIZATION; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

SELFISH ROUTING; TRAFFIC ENGINEERING; TRAFFIC EQUILIBRIUM;

INTERNET;

EID: 33947096838     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2006.880179     Document Type: Article

References (44)

1. A. Akella, S. Seshan, R. Karp, and S. Shenker, "Selfish behavior and stability of the Internet: A game-theoretic analysis of TCP," presented at the ACM SIGCOMM'02 Pittsburgh, PA, Aug. 2002.
2. E. Altman, T. Boulogne, R. E. Azouzi, and T. Jimenez, "A survey on networking games," Telecomnum. Syst., Nov. 2000.
3. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "Resilient overlay networks," presented at the SOSP'01, Banff, Canada, Oct. 2001.
4. D. O. Awduche, "MPLS and traffic engineering in IP networks," IEEE Commun. Mag., vol. 37, no. 12, pp. 42-47, Dec. 1999.
5. I. Castineyra, N. Chiappa, and M. Steenstrup, "The Nimrod Routing Architecture," RFC 1992, 1996.
6. A. Chen, D.-H. Lee, and R. Javakrishnan, "Computational study of state-of-the-art path-based traffic assignment algorithms," Mathematics and Computers in Simulation, pp. 509-518, 2002.
7. R. Cole, Y. Dodis, and T. Roughgarden, "Pricing networks with selfish routing," presented at the 2nd Workshop on Economics of Peer-to-Peer Systems, Cambridge, MA, Jun. 2004.
8. P. Dubey, "Inefficiency of Nash equilibria," Math. Oper. Res., vol. 11, pp. 1-8, Feb. 1986.
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," presented at the ACM SIGCOMM, Cambridge, MA, Aug. 1999.
10. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford, "Deriving traffic demands for operational IP networks: Methodology and experience," IEEE/ACM Trans. Netw., vol. 9, no. 3, pp. 265-279, Jun. 2001.
11. L. Fleischer, K. Jain, and M. Mahdian, "Taxes for heterogeneous selfish users in a multicommodity network," presented at the Foundations of Computer Science (FOCS), Rome, Italy, Oct. 2004.
12. M. Florian and D. Hearn, "Network equilibrium models and algorithms," in Network Routing. New York: Elsevier Science, 1995.
13. B. Fortz, J. Rexford, and M. Thorup, "Traffic engineering with traditional IP routing protocols," IEEE Commun. Mag., vol. 40, no. 10, pp. 118-124, Oct. 2002.
14. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. IEEE INFOCOM, Mar. 2000, pp. 519-528.
15. E. Friedman, " Genericity and congestion control in selfish routing," in Proc. 43rd IEEE Conf. Decision and Control, 2004, pp. 4667-4672.
16. L. Gao, "On inferring autonomous system relationships in the Internet," IEEE/ACM Trans. Netw., vol. 9, no. 6, pp. 733-745, Dec. 2001.
17. D. Gross and C. Harris, Fundamentals of Queueing Theory, 3rd ed. New York: Wiley, 1998.
18. C. M. Harris, P. H. Brill, and M. J. Fischer, "Internet-type queues with power-tailed interarrival times and computational methods for their analysis," INFORMS J. Comput., pp. 261-271, 2000.
19. S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot, "An approach to alleviate link overload as observed on an IP backbone," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 2003, pp. 406-416.
20. G. Karakostas and S. G. Kolliopoulos, "Edge pricing of multicommodity networks for heterogeneous selfish users," presented at the 42nd Foundations of Computer Science (FOCS), Rome, Italy, Oct. 2004.
21. R. Keralapura, N. Taft, C. Chuah, and G. Iannaconne, "Can ISPs take the heat from overlay networks?" presented at the ACM HotNets-III Workshop, San Diego, CA, Nov. 2004.
22. Y. A. Korilis, A. A. Lazar, and A. Orda, "Architecting noncooperative networks," IEEE J. Sel. Areas Commun., vol. 13, no. 7, pp. 1241-1251, Sep. 1995.
23. _, "Achieving network optima using Stackelberg routing strategies," IEEE/ACM Trans. Netw., vol. 5, no. 1, pp. 161-173, Feb. 1997.
24. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," in Proc. 16th Annu. Symp. Theoretical Aspects of Computer Science, 1999, pp. 404-413.
25. J. B. Krawczyk and S. Berridge, "Relaxation algorithms in finding Nash equilibria," Computational Economics from Economics Working Paper Archive at WUSTL, Jul. 1997.
26. V. S. A. Kumar and M. V. Marathe, "Improved results for Stackelberg scheduling strategies," presented at the 29th Int. Colloq. Automata; Languages, and Programming, Malaga, Spain, Jul. 2002.
27. Y. Liu, H. Zhang, W. Gong, and D. Towsley, " On the interaction between overlay routing and underlay routing," in Proc. IEEE INFOCOM, Mar. 2005, pp. 2543-2553.
28. Z. M. Mao, L. Qiu, J. Wang, and Y. Zhang, "On AS-level path inference," presented at the ACM SIGMETRICS, Banff, Canada, Jun. 2005.
29. A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: Boston University Representative Internet Topology Generator. [Online]. Available: http://www.cs.bu.edu/brite
30. The Network Simulator: ns-2. [Online]. Available: http://www.isi.edu/ nsnam/ns/
31. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker, "On selfish routing in Internet-like environments," presented at the ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003.
32. Rocketfuel. Pop-Level ISP Maps. [Online]. Available: http://www.cs. washington.edu/research/networking/rocketfuel/maps/policy-dist.tar.gz
33. T. Roughgarden, "Stackelberg scheduling strategies," in Proc. 33rd Annu. Symp. Theory of Computing, 2001, pp. 104-113.
34. T. Roughgarden, "Selfish routing," Ph.D. dissertation, Cornell Univ., Ithaca, NY, 2002.
35. T. Roughgarden and E. Tardos, "How bad is selfish routing?," J. ACM, vol. 49, no. 2, pp. 236-259, 2002.
36. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson, "The end-to-end effects of Internet path selection," in Proc. ACM SIGCOMM, Cambridge, MA, Aug. 1999, pp. 289-299.
37. Y. Sheffi, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Englewood Cliffs, NJ: Prentice-Hall, 1985.
38. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," presented at the ACM SIGCOMM, Pittsburgh, PA, Aug. 2002.
39. L. Subrmanian, S. Agarwal, J. Rexford, and R. Katz, "Characterizing the Internet hierarchy from multiple vantage points," in Proc. IEEE INFOCOM, New York, NY, Jun. 2002, pp. 618-627.
40. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topology generators: Degree-based vs. structural," presented at the ACM SIGCOMM. Pittsburgh, PA, Aug. 2002.
41. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin, "The impact of routing policy on Internet paths," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, pp. 736-742.
42. S. Uryas'ev and R. Y. Rubinstein, "On relaxation algorithms in computation of noncooperative equilibria," IEEE Trans. Autom. Contr., vol. 39, no. 6, pp. 1263-1267, Jun. 1995.
43. X. Xiao, A. Hannan, B. Bailey, and L. Ni, "Traffic engineering with MPLS in the Internet," IEEE Network Mag., vol. 14, no. 2, pp. 28-33, Mar.-Apr. 2000.
44. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, "Fast accurate computation of large-scale IP traffic matrices from link loads," presented at the ACM SIGMETRICS, San Diego, CA, Jun. 2003.