Cross-monotonic multicast

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 2261-2269

  Li, Zongpeng ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Game theory; Graph theory; Mathematical programming optimization; Multicast

Indexed keywords

GAME THEORY; MATHEMATICAL PROGRAMMING/OPTIMIZATION; MULTICAST;

BUDGET CONTROL; COST EFFECTIVENESS; COSTS; ERROR ANALYSIS; GRAPH THEORY; OPTIMIZATION; TOPOLOGY;

COMPUTER NETWORKS;

EID: 51349168681     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.219     Document Type: Conference Paper

References (34)

1. 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.
2. S. Chen, O. Günlük, and B. Yener, "The Multicast Packing Problem," IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 311-318, 2000.
3. C. Chekuri, J. Chuzhoy, L. Lewin-Eytan, J. Naor, and A. Orda, "Non-Cooperative Multicast and Facility Location Games," in Proceedings of ACM Conference on Electronic Commerce (EC), 2006.
4. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-Bandwidth Multicast in Cooperative Environments,' in Proceedings of ACM SOSP, October 2003.
5. 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.
6. K. Jain, M. Mandian, and M. R. Salavatipour, "Packing Steiner Trees," in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
7. M. Thimm, "On The Approximability Of The Steiner Tree Problem," in Mathematical Foundations of Computer Science 2001, Springer LNCS 2136, 678-689, 2001.
8. 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.
9. 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.
10. Z. Li, B. Li, D. Jiang, and L. C. Lau, "On Achieving Optimal Throughput with Network Coding," in Proceedings of IEEE INFOCOM, 2005.
11. Z. Li and B. Li, "Efficient and Distributed Computation of Maximum Multicast Rates," in Proceedings of IEEE INFOCOM, 2005.
12. 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.
13. 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.
14. J. Yuan, Z. Li, W. Yu, and B. Li, "A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks," Journal on Selected Arras in Communications (JSAC), vol. 24, no. 11, pp. 2092-2103, November 2006.
15. C. Papadimitriou, "Algorithms, Games, and the Internet," in Proc. of the 33rd ACM Symposium on the Theory of Computing (STOC), 2001.
16. W. Wang, X.-Y. Li, and Y. Wang, "Truthful Multicast in Selfish Wireless Networks," in Proceedings of ACM MobiCom, 2004.
17. W. Wang, X.-Y. Li, and Z. Sun, "Sharing the Multicast Payment Fairly," in Proceedings of the 11th International Computing and Combinatorics Conference (COCOON), 2005.
18. Z. Li, "Min-Cost Multicast of Selfish Information Flows," in Proceedings of IEEE INFOCOM, 2007.
19. H. Moulin and S. Shenker, "Strategyproof Sharing of Submodular Costs: Budget Balance versus Efficiency," Economic Theory, vol. 18, no. 3, pp. 511-533, 2001.
20. M. pál and E. Tardos, "Group Strategyproof Mechanisms via Primal-Dual Algorithms," in Proc. of the 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
21. H. Moulin. Game Theory for the Social Sciences. New York: New York University Press, 1982.
22. K. Jain and V. V. Vazirani, "Applications of Approximation Algorithms to Cooperative Games," in Proc. of the 33rd ACM Symposium on the Theory of Computing (STOC), 2001.
23. H. Moulin, Cooperative Microeconomics: A Game Theoretic Introduction. Princeton, NJ: Princeton University Press, 1982.
24. N. Immorlica, M. Mandian, and V. S. Mirrokni, "Limitations of Cross-Monotonic Cost Sharing Schemes," in Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
25. J. Könemann, S. Leonardi, and G. Schäfer "A Group-Strategyproof Mechanism for Steiner Forests," in Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
26. P. Erdös and A. Rényi, "On the Existence of a Factor of Degree One of a Connected Random Graph," Acta Mathematica Hungarica, vol. 17, no. 3-4, pp. 359-368, 1966.
27. L. S. Shapley, "A Value for n-Person Games," Contributions to the Theory of Games, pp. 3140, 1953, Princeton University Press.
28. D. B. West, Introduction To Graph Theory, 2nd Edition. Upper Saddle River, New Jersey: Prentice Hall, 2001.
29. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, New Jersey: Prentice Hall, 1993.
30. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models, Athena Scientific. 1998.
31. Z. Li and B. Li, "Network Coding in Undirected Networks," in Proc. of the 38th Annual Conference on Information Sciences and Systems (CISS), 2004.
32. A. Agarwal and M. Charikar, "On the Advantage of Network Coding for Improving Network Throughput," in Proceedings of the IEEE Information Theory Workshop, 2004.
33. GNU Linear Programming Kit, http://www.gnu.org/software/glpk/glpk. html.
34. A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: Boston University Representative Internet Topology Generator, http://www.cs.bu.edu/ brite.