On Selfish Routing in Internet-Like Environments

Computer Communication Review

Volumn 33, Issue 4, 2003, Pages 151-162

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

^a MICROSOFT RESEARCH   (United States)

^b YALE UNIVERSITY   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d ICSI

Author keywords

Game Theory; Optimization; Overlay; Relaxation; Selfish Routing; Traffic Engineering; Traffic Equilibrium

Indexed keywords

COMPUTER SIMULATION; GAME THEORY; NETWORK PROTOCOLS; PACKET SWITCHING; TELECOMMUNICATION TRAFFIC;

OVERLAY; SELFISH ROUTING; TRAFFIC ENGINEERING; TRAFFIC EQUILIBRIUM;

INTERNET;

EID: 1242287707     PISSN: 01464833     EISSN: None     Source Type: Journal    
DOI: 10.1145/863973.863974     Document Type: Conference Paper

References (44)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, New Jersey, 1993.
2. A. Akella, S. Seshan, R. Karp, and S. Shenker. Selfish behavior and stability of the Internet: A game-theoretic analysis of TCP. In Proceedings of ACM SIGCOMM '02, Pittsburgh, PA, Aug. 2002.
3. E. Altman, R. E. Azouzi, and A. Vyacheslav. Non-cooperative routing in loss networks. In Proceedings of Performance '02, Rome, Italy, Sept. 2002.
4. E. Altman, T. Boulogne, R. E. Azouzi, and T. Jimenez. A survey on networking games. Telecommunication Systems, Nov. 2000.
5. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient overlay networks. In Proceedings of SOSP '01, Banff, Canada, Oct. 2001.
6. D. O. Awduche. MPLS and traffic engineering in IP networks. IEEE Communication Magazine, pages 42-47, Dec. 1999.
7. T. Boulogne, E. Altman, O. Pourtallier, and H. Kameda. Mixed equilibrium for multiclass routing games. IEEE Transactions on Automatic Control, 47(6):903-916, Jun. 2002.
8. I. Castineyra, N. Chiappa, and M. Steenstrup. The Nimrod Routing Architecture, RFC 1992, Aug. 1996.
9. 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, pages 509-518, 2002.
10. A. Collins. The Detour framework for packet rerouting. PhD Qualifying Examination, Nov. 1998.
11. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In Proceedings of ACM SIGCOMM '99, Cambridge, MA, Aug. 1999.
12. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford. Deriving traffic demands for operational IP networks: Methodology and experience. IEEE/ACM Transactions on Networking, Jun. 2001.
13. M. Florian and D. Hearn. Network Routing, chapter 6, Network equilibrium models and algorithms. Elsevier Science, 1995.
14. B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Comm. Magazine, Oct. 2002.
15. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of IEEE INFOCOM '00, Tel Aviv, Israel, Mar. 2000.
16. E. Friedman. Selfish routing on data networks isn't too bad: Genericity, TCP, and OSPF. Working paper. Available from http://www.orie.cornell.edu//̃friedman/papers.html, Oct. 2002.
17. L. Gao. On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6), Dec. 2001.
18. D. Gross and C. Harris. Fundamentals of Queueing Theory. John Wiley, 3rd edition, 1998.
19. 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 Journal on Computing, pages 261-271, 2000.
20. S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot. An approach to alleviate link overload as observed on an IP backbone. In Proceedings of IEEE INFOCOM '03, San Francisco, CA, Apr. 2003.
21. Y. A. Korilis, A. A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE Journal of Selected Areas in Communications, 13(7):1241-1251, Sept. 1995.
22. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 404-413, 1999.
23. J. B. Krawczyk and S. Berridge. Relaxation algorithms in finding Nash equilibria. In Computational Economics from Economics Working Paper Archive at WUSTL, Jul. 1997.
24. lp_solve. ftp://ftp.ics.ele.tue.nl/pub/lp_solve/.
25. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: Boston University representative Internet topology generator. Available from http://www.cs.bu.edu/brite.
26. Multiprotocol label switching (MPLS). http://www.ietf.org/html.charters/mpls-charter.html.
27. The network simulator: ns-2. http://www.isi.edu/nsnam/ns/.
28. Open shortest path first (OSPF). http://www.ietf.org/html.charters/ospf-charter.html.
29. M. Patriksson. Algorithms for computing traffic equilibria. In Networks and Spatial Economics. 2003. http://www.cs.chalmers.se/̃mipat/LATEX/NSE.ps.
30. T. Roughgarden. Selfish Routing. PhD thesis, Cornell University, May 2002.
31. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of ACM, 49(2):236-259, 2002.
32. S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan. Detour: a case for informed Internet routing and transport. In IEEE Micro, volume 19(1), pages 50-59, Jan. 1999.
33. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The end-to-end effects of Internet path selection. In Proceedings of ACM SIGCOMM '99, pages 289-299, Cambridge, MA, Aug. 1999.
34. Y. Sheffi. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, 1985.
35. S. Shenker. Making greedy work in networks: A game-theoretic analysis of switch service discipline. IEEE/ACM Transactions on Networking, 3, 1995.
36. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proceedings of ACM SIGCOMM '02, Pittsburgh, PA, Aug. 2002.
37. J. W. Stewart. BGP4: Inter-Domain Routing in the Internet. Addison Wesley, 1998.
38. L. Subrmanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the Internet hierarchy from multiple vantage points. In Proceedings of IEEE INFOCOM '02, New York, NY, June 2002.
39. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs. structural. In Proceedings of ACM SIGCOMM '02, Pittsburgh, PA, Aug. 2002.
40. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The impact of routing policy on Internet paths. In Proceedings of IEEE INFOCOM '01, Anchorage, AK, Apr. 2001.
41. S. Uryas'ev and R. Y. Rubinstein. On relaxation algorithms in computation of noncooperative equilibria. IEEE Transactions on Automatic Control, 39(6):1263-1267, Jun. 1995.
42. X. Xiao, A. Hannan, B. Bailey, and L. Ni. Traffic engineering with MPLS in the Internet. IEEE Network Magazine, Mar. 2000.
43. E. Zegura, M. Ammar, Z. Fei, and S. Bhattacharjee. Application-layer anycasting: A server selection architecture and use in a replicated web service. IEEE/ACM Transactions on Networking, 8(4), Aug. 2000.
44. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In Proceedings of ACM SIGMETRICS '03, Jun. 2003.