Cooperative interdomain traffic engineering using nash bargaining and decomposition

IEEE/ACM Transactions on Networking

Volumn 18, Issue 2, 2010, Pages 341-352

  Shrimali, Gireesh ^a   Akella, Aditya ^b   Mutapcic, Almir ^c  

^a INDIAN SCHOOL OF BUSINESS   (India)

^b University of Wisconsin Madison   (United States)

^c Stanford University   (United States)

Author keywords

Cooperative game theory; Dual decomposition; Hot potato routing; Interdomain traffic engineering (TE); ISP peering; Nash bargaining; Nash equilibrium

Indexed keywords

COOPERATIVE GAME THEORY; DUAL DECOMPOSITION; HOT-POTATO ROUTING; INTERDOMAIN TRAFFIC ENGINEERING; NASH BARGAINING; NASH EQUILIBRIUM;

AD HOC NETWORKS; ELECTRIC NETWORK TOPOLOGY; GAME THEORY; GLOBAL OPTIMIZATION; HIGHWAY ENGINEERING;

INTERNET SERVICE PROVIDERS;

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

References (39)

1. R. Mahajan, D. Wetherall, and T. Anderson, "Towards coordinated in-terdomain traffic engineering," presented at the HotNets-III, 2004.
2. R. Mahajan, "Practical and efficient internet routing with competing interests," Ph.D. dissertation, Univ. Washington, Seattle, 2005.
3. N. Spring, R. Mahajan, and T. Anderson, "Quantifying the causes of Internet path inflation," in Proc. SIGCOMM, Aug. 2003, pp. 113-124.
4. R. Teixeira, T. Griffin, G. Voelker, and A. Shaikh, "Network sensitivity to hot potato disruptions," in Proc. SIGCOMM, 2004, pp. 231-244.
5. J. Winick, S. Jamin, and J. Rexford, "Traffic engineering between neighboring domains," 2002.
6. R. Mahajan, D. Wetherall, and T. Anderson, "Negotiation-based routing between neighboring ISPs," in Proc. 2nd Netw. Syst. Design Implement., May 2005, pp. 29-42.
7. R. E. Steur, Multiple Criteria Optimization: Theory, Computation, and Application. New York: Wiley, 1986.
8. A. Mas-Colell, M. D. Whinston, and J. R. Green, Microeconomic Theory. Oxford, U.K.: Oxford Univ. Press, 1995.
9. J. F. Nash, "The bargaining problem," Econometrica, vol.28, pp. 155-162, Aug. 1950.
10. R. B. Myerson, Game Theory: Analysis of Conflict. Cambridge, MA: Harvard Univ. Press, 1991.
11. F. P. Kelly, A. K. H. Mallu, and D. K. H. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," J. Operat. Res. Soc., 1998.
12. L. Lasdon, Optimization Theory for Large Systems, ser. in Operat. Res. New York: McMillan, 1970.
13. S. Boyd and L. Vanderberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
14. S. Kumar, R. Randhawa, and T. Yahalom, "Fairness in capacity allocation and scheduling: Non-monetary mechanisms," Working paper, 2005.
15. U. Steve and Q. Bruno, "Tweak-it: BGP-based interdomain traffic engineering for transit ases," in Proc. NGI, 2005, pp. 75-82.
16. N. Feamster, J. Borkenhagen, and J. Rexford, "Guidelines for interdo-main traffic engineering," ACM SIGCOMM Comput. Commun. Rev., vol.33, no.6, pp. 19-30, Oct. 2003.
17. R. Gao, C. Dovrolis, and E. Zegura, "Interdomain ingress traffic engineering through optimized as-path prepending," in Proc. IFIP Netw., 2005, pp. 647-658.
18. R. Yang, H. Xie, H. Wang, A. Silberschatz, Y. Liu, L. E. Li, and A. Kr-ishnamurthy, "On route selection for interdomain traffic engineering," IEEE Netw., vol.19, no.6, pp. 20-27, Nov./Dec. 2005.
19. H. Wang, H. Xie, R. Yang, L. Li, Y. Liu, and A. Silberschatz, "Stable egress route selection for interdomain traffic engineering: Model and analysis," in Proc. IEEE ICNP, Nov. 2005, pp. 16-29.
20. H. Wang, H. Xie, R. Yang, L. Li, Y. Liu, and A. Silberschatz, "On the stability of rational, heterogeneous interdomain route selection," in Proc. IEEE ICNP, Nov. 2005, pp. 40-50. (Pubitemid 44733844)
21. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. INFOCOM, 2000, vol.2, pp. 519-528.
22. J. He, M. Bessler, M. Chiang, and J. Rexford, "Towards robust multi-layer traffic engineering: Optimization of congestion control and routing," 2006 [Online]. Available: www.princeton.edu/~jhe/re-search/jsac2. pdf
23. D. Mitra, K. Ramakrishnan, and Q. Wang, "Combined economic modeling and traffic engineering: Joint optimization of pricing and routing in multi-service networks," in Proc. 17th Int. Teletraffic Congress, 2001, pp. 73-85.
24. J. Feigenbaum, V. Ramachandran, and M. Scapira, "Incentive- compatible interdomain routing," in Proc. 7th Conf. Electron. Commerce, 2006, pp. 130-139.
25. J. Feigenbaum, M. Scapira, and S. Schenker, "Distributed algorithmic mechanism design," Algorithmic Game Theory, pp. 363-384, 2007.
26. R. Mazumdar, L. G. Mason, and C. Doulgligeris, "Fairness in network optimal flow control: Optimality of product forms," IEEE Trans. Commun., vol.39, no.5, pp. 775-782, May 1991.
27. C. Touati, E. Altman, and J. Galtier, "Utility based fair bandwidth allocation," 2002, unpublished.
28. T. Roughgarden and E. Tardos, "How bad is selfish routing?," in Proc. IEEE Symp. Found. Comp. Sci., 2000, pp. 93-102.
29. L. Qiu, Y. Yang, Y. Zhang, and S. Shenker, "On selfish routing in Internet-like enviroments," in Proc. SIGCOMM, Karlsruhe, Germany, 2003, pp. 151-162.
30. N. Z. Shor, Minimization Methods for Non-differentiable Functions, ser. in Comput. Math. New York: Springer, 1985.
31. M. Caesar, D. Caldwell, N. Feamster, J. Rexford, A. Shaikh, and J. van der Merwe, "Design and implementation of a routing control platform," in Proc. NSDI, 2005, pp. 15-28.
32. A. Greenberg, G. Hjalmtysson, D. A. Maltz, A. Meyers, J. Rexford, G. Xie, H. Yan, J. Zhan, and H. Zhang, "A clean slate 4d approach to network control and management," SIGCOMM Comp. Commun. Rev., vol.35, no.5, pp. 41-54, Oct. 2005.
33. D. Xu, M. Chiang, and J. Rexford, "Deft: Distributed exponentially-weighted flow splitting," in Proc. INFOCOM, Anchorage, AK, May 2007, pp. 71-79.
34. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. New York: Athena Scientific, 1998.
35. W. Norton, "Internet service providers and peering," Equinix White Paper, 2001.
36. W. Thomson, "Manipulability of resource allocation mechanisms," Rev. Econom. Studies, vol.51, pp. 447-460, Jul. 1984.
37. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," in Proc. SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 133-145.
38. R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "Inferring link weights using end-to-end measurements," in Proc. Internet Meas. Workshop, Nov. 2002, pp. 231-236.
39. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, "Fast accurate computation of large-scale IP traffic matrices from link loads," in Proc. SIGMETRICS, 2003, pp. 206-217.