Partially optimal routing

IEEE Journal on Selected Areas in Communications

Volumn 25, Issue 6, 2007, Pages 1148-1161

  Acemoglu, Daron ^b   Johari, Ramesh ^a,c   Ozdaglar, Asuman ^a,d  

^a IEEE

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Stanford University   (United States)

^d USA   (United States)

Author keywords

Braess' paradox; Selfish routing; Traffic engineering; Wardrop equilibrium

Indexed keywords

BRAESS' PARADOX; INTERCONNECTED ADMINISTRATIVE DOMAINS; SELFISH ROUTING; WARDROP EQUILIBRIUM;

CARRIER COMMUNICATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC;

NETWORK ROUTING;

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

References (20)

1. D. Acemoglu, R. Johari, and A. Ozdaglar, "Paradoxes of traffic engineering with partially optimal routing," Conference on Information Sciences and Systems, 2006.
2. J. Rexford, Route optimization in IP networks. Springer Science and Business Media, 2006, pp. 679-700.
3. L. Qiu, Y. Yang, Y. Zhang, and S. Shenker, "On selfish routing in Internet-like environments," Proc. ACM SIGCOMM, 2003, pp. 151-162.
4. H. Zhang, Y. Liu, W. Gong, and D. Towsley, "Understanding the interaction between overlay routing and traffic engineering," University of Massachusetts CMPSCI, Technical Report 04-63, 2004.
5. _, "On the interaction between, overlay routing and underlay routing," Proc. IEEE Infocom, 2005, pp. 2543-2553.
6. H. Han, S. Shakkottai, C. Hollot, R. Srikant, and D. Towsley, "Overlay TCP for multi-path routing and congestion control," 2004, submitted.
7. F. P. Kelly and T. Voice, "Stability of end-to-end algorithms for joint routing and rate control," Computer Communication Review, vol. 35, no. 2, pp. 5-12, 2005.
8. M. Beckmann, C. B. McGuire, and C. B. Winsten, Studies in the Economics of Transportation. New Haven, Connecticut: Yale University Press, 1956.
9. A. Pigou, The Economics of Welfare. London, U.K.: Macmillan, 1920.
10. T. Roughgarden and É. Tardos, "How bad is selfish routing?" Journal of the ACM, vol. 49, no. 2, pp. 236-259, 2002.
11. J. Correa, A. Schulz, and N. Stier-Moses, "Selfish routing in capacitated networks," Mathematics of Operations Research, vol. 29, no. 4, pp. 961-976, 2002.
12. F. P. Kelly, "Network routing," Philosophical Transactions: Physical Sciences and Engineering, vol. 337, no. 1647, pp. 343-367, 1991.
13. S. Dafermos and F. Sparrow, "The traffic assignment problem for a general network," Journal of Research of the National Bureau of Standards-B. Mathematical Sciences, vol. 73, no. 2, pp. 91-118, 1969.
14. M. Smith, "The existence, uniqueness and stability of traffic equilibria," Transportation Research, vol. 13B, pp. 295-304, 1979.
15. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," Proc. IEEE INFOCOM, 2000, pp. 519-528.
16. D. Acemoglu, R. Johari, and A. Ozdaglar, "Partially optimal routing," MIT Laboratory for Information and Decisions Systems, Technical Report 2703, 2006.
17. I. Milchtaich, "Network topology and the efficiency of equilibrium," Department of Economics, Bar-Ilan University, Working Paper 12-01, 2005.
18. J. Correa, A. Schulz, and N. Stier-Moses, "On the inefficiency of equilibria in congestion games," Proc. the 11th Conference on Integer Programming and Combinatorial Optimization, vol. 3509, 2005, pp. 167-181.
19. D. Bertsekas, A. Nedic, and A. Ozdaglar, Convex Analysis and Optimization. Cambridge, Massachusetts: Athena Scientific, 2003.
20. T. Roughgarden, "The price of anarchy is independent of the network topology," Proc. ACM Symposium on the Theory of Computing, 2002, pp. 428-437.