Subscribe
Issue No.05 - May (2012 vol.23)
pp: 913-923
Zongpeng Li , University of Calgary, Calgary
Xiaowen Chu , Hong Kong Baptist University, Hong Kong
ABSTRACT
In computer networks, multicast models a class of data dissemination applications, where a common data item is routed to multiple receivers simultaneously. The routing of multicast flows across the network may incur a cost, and such a cost is to be recovered from payments by receivers who enjoy the multicast service. In reality, a group of potential multicast receivers exist at different network locations. Each receiver has a valuation for receiving the multicast service, but such valuation is private information known to itself. A multicast scheme asks each potential receiver to report her valuation, then decides which subset of potential receivers to serve, how to route the multicast flow to them, and how much to charge each of them. A multicast scheme is stragegyproof if no receiver has incentive to lie about her true valuation. It is further group strategyproof if no group of colluding receivers has incentive to lie. We study multicast schemes that target group strategyproofness, in both directed and undirected networks. Our main results reveal that under group strategyproofness, a compromise is necessary in either routing optimality or budget balance. We also design multicast schemes that pursue maximum budget balance while guaranteeing group stragetyproofness and routing optimality.
INDEX TERMS
Multicast, network coding, game theory, mathematical programming/optimization.
CITATION
Zongpeng Li, Xiaowen Chu, "On Achieving Group-Strategyproof Multicast", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 5, pp. 913-923, May 2012, doi:10.1109/TPDS.2011.197
REFERENCES
 [1] J. Feigenbaum, C. Papadimitriou, and S. Shenker, "Sharing the Cost of Multicast Transmissions," J. 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 Trans. Networking, vol. 8, no. 3, pp. 311-318, June 2000. [3] C. Chekuri, J. Chuzhoy, L. Lewin-Eytan, J. Naor, and A. Orda, "Non-Cooperative Multicast and Facility Location Games," Proc. Seventh ACM Conf. 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," Proc. 19th ACM Symp. Operating Systems Principles (SOSP), Oct. 2003. [5] Z. Li, B. Li, and L.C. Lau, "On Achieving Optimal Multicast Throughput in Undirected Networks," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2467-2485, June 2006. [6] K. Jain, M. Mahdian, and M.R. Salavatipour, "Packing Steiner Trees," Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2003. [7] M. Thimm, "On the Approximability of the Steiner Tree Problem," Proc. 26th Int'l Math. Foundations of Computer Science, 2001. [8] R. Ahlswede, N. Cai, S.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. 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 Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003. [10] Z. Li, B. Li, D. Jiang, and L.C. Lau, "On Achieving Optimal Throughput with Network Coding," Proc. IEEE INFOCOM, 2005. [11] Z. Li and B. Li, "Efficient and Distributed Computation of Maximum Multicast Rates," Proc. 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," Proc. 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," IEEE J. Selected Areas in Comm., vol. 23, no. 1, pp. 136-150, Jan. 2005. [14] J. Yuan, Z. Li, W. Yu, and B. Li, "A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks," IEEE J. Selected Areas in Comm., vol. 24, no. 11, pp. 2092-2103, Nov. 2006. [15] C. Papadimitriou, "Algorithms, Games, and the Internet," Proc. 33rd Ann. ACM Symp. Theory of Computing (STOC), 2001. [16] W. Wang, X.-Y. Li, and Y. Wang, "Truthful Multicast in Selfish Wireless Networks," Proc. ACM MobiCom, 2004. [17] W. Wang, X.-Y. Li, and Z. Sun, "Sharing the Multicast Payment Fairly," Proc. 11th Ann. Int'l Computing and Combinatorics Conf. (COCOON), 2005. [18] Z. Li, "Min-Cost Multicast of Selfish Information Flows," Proc. 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," Proc. IEEE 44th Ann. Symp. Foundations of Computer Science (FOCS), 2003. [21] H. Moulin, Game Theory for the Social Sciences. New York Univ. Press, 1982. [22] K. Jain and V.V. Vazirani, "Applications of Approximation Algorithms to Cooperative Games," Proc. 33rd Ann. ACM Symp. Theory of Computing (STOC), 2001. [23] H. Moulin, Cooperative Microeconomics: A Game Theoretic Introduction. Princeton Univ. Press, 1982. [24] N. Immorlica, M. Mahdian, and V.S. Mirrokni, "Limitations of Cross-Monotonic Cost Sharing Schemes," Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2005. [25] J. Könemann, S. Leonardi, and G. Schäfer, "A Group-Strategyproof Mechanism for Steiner Forests," Proc. 16th Ann. ACM-SIAM Symp. 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, nos. 3/4, pp. 359-368, 1966. [27] H. Moulin, "Dominance Solvability and Cournot Stability," Math. Social Sciences, vol. 7, pp. 83-102, 1984. [28] L.S. Shapley, "A Value for $n$ -Person Games," Contributions to the Theory of Games, Princeton Univ. Press, pp. 31-40, 1953. [29] D.B. West, Introduction to Graph Theory, second ed. Prentice Hall, 2001. [30] A. Gopinathan, Z. Li, and B. Li, "On Achieving Group Strategyproof Information Dissemination in Wireless Networks," Proc. First Int'l Conf. Game Theory for Networks (GameNets), 2009. [31] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993. [32] D.P. Bertsekas, Network Optimization: Continuous and Discrete Models. Athena Scientific, 1998. [33] Z. Li, B. Li, and L.C. Lau, "A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks," IEEE Trans. Information Theory, vol. 55, no. 3, pp. 1016-1026, Mar. 2009. [34] A. Agarwal and M. Charikar, "On the Advantage of Network Coding for Improving Network Throughput," Proc. IEEE Information Theory Workshop, 2004. [35] GNU Linear Programming Kit, http://www.gnu.org/software/glpkglpk.html , 2011. [36] A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: Boston Univ. Representative Internet Topology Generator, http://www.cs.bu.edubrite, 2011.