Min-cost multicast of selfish information flows

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 231-239

  Li, Zongpeng ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Game theory; Graph theory; Information theory; Mathematical programming optimization

Indexed keywords

ALGORITHMS; GAME THEORY; GRAPH THEORY; INFORMATION THEORY; MATHEMATICAL PROGRAMMING; RESOURCE ALLOCATION;

COST ALLOCATION; PRIMAL-DUAL ALGORITHMS;

MULTICASTING;

EID: 34548300086     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.35     Document Type: Conference Paper

References (29)

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. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models, Athena Scientific, 1998.
3. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network Information Flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
4. R. Koetter and M. Médard, "An Algebraic Approach to Network Coding," IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782-795, October 2003.
5. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing Steiner Trees," in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
6. Z. Li, B. Li, and L. C. Lau, "On Achieving Optimal Multicast Throughput in Undirected Networks," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2467-2485, June 2006.
7. D. S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, and H. Lee, "Achieving Minimum-cost Multicast: a Decentralized Approach Based on Network Coding," in Proceedings of IEEE INFOCOM, 2005.
8. Z. Li and B. Li, "Efficient and Distributed Computation of Maximum Multicast Rates," in Proceedings of IEEE INFOCOM, 2005.
9. E. Koutsoupias and C. Papadimitriou, "Worst-Case Equilibria," Lecture Notes in Computer Science, vol. 1563, pp. 404-413, 1999.
10. T. Roughgarden and E. Tardos, "How Bad is Selfish Routing?," Journal of the ACM, vol. 49, no. 2, pp. 236-259, 2002.
11. L. Fleischer, K. Jain, and M. Mahdian, "Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games," in Proc. of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
12. G. Karakostas and S. G. Kolliopoulos, "Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users," in Proc. of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
13. J. Feigenbaum, C. Papadimitriou, and S. Shenker, "Sharing the Cost of Multicast Transmissions," Journal of Computer and System Sciences, vol. 63, pp. 21-41, 2001.
14. S. Bhadra, S. Shakkottai, and P. Gupta, "Min-cost Selfish Multicast with Network Coding," IEEE Transactions on Information Theory, vol. 52, no. 11, pp. 5077-5087, November 2006.
15. L. S. Shapley, "A Value for n-Person Games," Contributions to the Theory of Games, pp. 31-40, 1953, Princeton University Press.
16. W. Wang, X. Li, and Y. Wang, "Truthful Multicast in Selfish Wireless Networks," in Proceedings of the 10th Annual ACM International Conference on Mobile Computing and Networking (MobiCom), 2004.
17. Z. Li, B. Li, D. Jiang, and L. C. Lau, "On Achieving Optimal Throughput with Network Coding," in Proceedings of IEEE INFOCOM, 2005.
18. Y. Wu, P. A. Chou, Q. Zhang, K. Jain, W. Zhu, and S. Y. Kung, "Network Planning in Wireless Ad Hoc Networks: A Cross-layer Approach," Journal on Selected Areas in Communications (JSAC), vol. 23, no. 1, pp. 136-150, January 2005.
19. J. Yuan, Z. Li, W. Yu, and B. Li, "A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks," Journal on Selected Areas in Communications (JSAC), Special Issue on Multi-hop Wireless Mesh Networks, to appear, 2006.
20. W. Jiang, D. Chiu, and J. Lui, "On the Interaction of Multiple Overlay Routing," Performance Evaluation, vol. 62, no. 1-4, pp. 229-246, October 2005.
21. H. W. Kuhn and A. W. Tucker, "Nonlinear Programming," in Second Berkeley Symposium on Mathematical Statistics and Probability, 1951.
22. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithm for Network Information Flow," in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2003.
23. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial Time Algorithms for Multicast Network Code Construction," IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1973-1982, June 2005.
24. G. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1998.
25. M. J. Osborne and A. Rubinstein, A Course in Game Theory, MIT Press, Cambridge, Massachusetts, 1994.
26. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden, "The Price of Stability for Network Design with Fair Cost Allocation," in Proc. of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
27. C. Papadimitriou, "Algorithms, Games, and the Internet," in Proc. of the 33rd ACM Symposium on the Theory of Computing (STOC), 2001.
28. H. D. Sherali and G. Choi, "Recovery of Primal Solutions When Using Subgradient Optimization Methods to Solve Lagrangian Duals of Linear Programs," Operations Research Letters, vol. 19, 1996.
29. C. Chekuri, J. Chuzhoy, L. Lewin-Eytan, J. Naor, and A. Orda, "Non-Cooperative Multicast and Facility Location Games," in Proceedings of the ACM Conference on Electronic Commerce (EC), Ann Arbor, Michigan, June 2006.