Min-cost selfish multicast with network coding

IEEE Transactions on Information Theory

Volumn 52, Issue 11, 2006, Pages 5077-5087

  Bhadra, Sandeep ^a   Shakkottai, Sanjay ^a   Gupta, Piyush ^b  

^a The University of Texas at Austin   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Convex optimization; Game theory; Minimum cost multicast; Nash equilibrium; Network coding

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); GAME THEORY; OPTIMIZATION;

CONVEX OPTIMIZATION; MINIMUM COST MULTICAST; NASH EQUILIBRIUM; NETWORK CODING;

MULTICASTING;

EID: 33750582957     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.883636     Document Type: Article

References (28)

1. D. S. Lun, N. Ratnakar, R. M. M. Koetter, E. Ahmed, and H. Lee, "Achieving minimum cost multicast: A decentralized approach based on network coding," in Proc. IEEE INFOCOM 2005, Mar. 2005.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, 2000.
3. T. H. R. Koetter, M. Médard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. 2003 Int. Symp. Inf. Theory, 2003.
4. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proc. 41st Allerton Annu. Conf. Commun., Contr., Comput., Monticello, IL, Oct. 2003.
5. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Allerton Annu. Conf. Commun., Contr., Comput., Monticello, IL, Oct. 2003.
6. M. Charikar, C. Chekuri, T. y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed steiner problems," in Proc. Ninth Annu. ACM-SIAM Symp. Discr. Algorithms (SODA 1998), 1998, pp. 192-200.
7. L. Zosin and S. Khuller, "On directed Steiner trees," in Proc. 13th Annu. ACM-SIAM Symp. Discr. Algorithms (SODA 2002), 2002, pp. 59-63.
8. D. S. Lun, M. Médard, T. Ho, and R. Koetter, "Network coding with a cost criterion," in Proc. 2004 Int. Symp. Inf. Theory and its Appl. (ISITA 2004), Oct. 2004.
9. R. Johari and J. Tsitsiklis, "Efficiency loss in a network resource allocation game," Math. Oper. Res., vol. 29, no. 3, pp. 407-435, 2004.
10. D. Acemoglu and A. Ozdaglar, Flow Control, Routing and Performance From Service Provider Viewpoint MIT-LIDS, MIT-LIDS-WP- 1696 Tech. Rep., 2003.
11. F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
12. K. Jain, V. V. Vazirani, and Y. Yu, "Market equilibria for homothetic, quasi-concave utilities and economies of scale in production," in Proc. ACM-SIAM Symp. Discr. Algorithms (SODA 2005), Jan. 2005.
13. M. J. Osborne and A. Rubinstein, A Course in Game Theory. Cambridge, MA: MIT Press, 1994.
14. T. Roughgarden and E. Tardos, "How bad is selfish routing?," J. ACM, vol. 49, no. 2, pp. 236-259, Mar. 2002.
15. C. Papadimitriou, "Algorithms, games, and the internet," in Proc. 33rd Annu. ACM Symp. Theory Comput., 2001, pp. 749-753.
16. S. C. Dafermos and F. T. Sparrow, "The traffic assignment problem for a general network," J. Res. Nat. Bureau of Standards, Series B, vol. 73B, no. 2, pp. 91-118, 1969.
17. M. Beckmann, C. B. McGuire, and C. B. Winsten, Studies in the Economics of Transportation. New Haven, CT: Yale University Press, 1956.
18. T. Roughgarden, "The price of anarchy is independent of the network topology," in Proc. Annu. ACM Symp. Theory of Comput., 2002, pp. 428-437.
19. J. Correa, A. Schulz, and N. Stier-Moses, "Selfish routing in capacitated networks," Math. Oper. Res., vol. 29, no. 4, pp. 961-976, Nov. 2004.
20. A. R. Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. ACM-SIAM Symp. Discr. Algorithms SODA-2004, Jan. 2004.
21. S. Deb and R. Srikant, "Congestion control for fair resource allocation in networks with multicast flows," IEEE/ACM Trans. Network., pp. 274-285, Apr. 2004.
22. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
23. L. Kleinrock, Queueing Systems. New York: Wiley, 1976, vol. 2.
24. D. Gamarnik and A. Zeevi, "Validity of heavy traffic steady-state approximations in generalized Jackson networks," Ann. Appl. Prob., vol. 16, no. 1, pp. 56-90, 2006, to be published.
25. P. Gupta and P. R. Kumar, "A system and traffic dependent adaptive routing algorithm for ad hoc networks," in Proc. IEEE 36th Conf. Decision Contr., San Diego, CA, 1997, pp. 2375-2380.
26. P. Gupta, "Design and Performance Analysis of Wireless Networks," Ph.D. dissertation, University of Illinois at Urbana-Champaign, Urbana, IL, 2000.
27. V. Borkar and P. R. Kumar, "Dynamic Cesaro-Wardrop equilibration in networks," IEEE Trans. Automat. Control, vol. 48, pp. 382-396, Mar. 2003.
28. S. Bhadra, S. Shakkottai, and P. Gupta, Min-Cost Selfish Multicast With Network Coding Bell Labs, 2005, Tech. Rep..