
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Zongpeng Li, Carey Williamson, "Enforcing MinimumCost Multicast Routing against Selfish Information Flows," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 9, pp. 12991308, September, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.229, author = {Zongpeng Li and Carey Williamson}, title = {Enforcing MinimumCost Multicast Routing against Selfish Information Flows}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {9}, issn = {10459219}, year = {2009}, pages = {12991308}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.229}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Enforcing MinimumCost Multicast Routing against Selfish Information Flows IS  9 SN  10459219 SP1299 EP1308 EPD  12991308 A1  Zongpeng Li, A1  Carey Williamson, PY  2009 KW  Communication/networking KW  multicast KW  graph algorithms. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 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 Trans. Information Theory, vol. 46, no. 4, pp. 12041216, July 2000.
[4] R. Koetter and M. Médard, “An Algebraic Approach to Network Coding,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782795, Oct. 2003.
[5] K. Jain, M. Mahdian, and M.R. Salavatipour, “Packing Steiner Trees,” Proc. 10th Ann. ACMSIAM Symp. Discrete Algorithms (SODA), 2003.
[6] 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. 24672485, June 2006.
[7] D.S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, and H. Lee, “Achieving MinimumCost Multicast: a Decentralized Approach Based on Network Coding,” Proc. IEEE INFOCOM, 2005.
[8] Z. Li and B. Li, “Efficient and Distributed Computation of Maximum Multicast Rates,” Proc. IEEE INFOCOM, 2005.
[9] E. Koutsoupias and C. Papadimitriou, “WorstCase Equilibria,” Lecture Notes in Computer Science, vol. 1563, pp. 404413, 1999.
[10] T. Roughgarden and E. Tardos, “How Bad is Selfish Routing?” J. ACM, vol. 49, no. 2, pp. 236259, 2002.
[11] H. Yang and H. Huang, “The MultiClass, MultiCriteria Traffic Network Equilibrium and Systems Optimum Problem,” Transportation Research, Part B, vol. 38, no. 1, pp. 115, Jan. 2004.
[12] L. Fleischer, K. Jain, and M. Mahdian, “Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games,” Proc. 45th IEEE Symp. Foundations of Computer Science (FOCS), 2004.
[13] G. Karakostas and S.G. Kolliopoulos, “Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users,” Proc. 45th IEEE Symp. Foundations of Computer Science (FOCS), 2004.
[14] J. Feigenbaum, C. Papadimitriou, and S. Shenker, “Sharing the Cost of Multicast Transmissions,” J. Computer and System Sciences, vol. 63, pp. 2141, 2001.
[15] S. Bhadra, S. Shakkottai, and P. Gupta, “MinCost Selfish Multicast with Network Coding,” IEEE Trans. Information Theory, vol. 52, no. 11, pp. 50775087, Nov. 2006.
[16] L.S. Shapley, “A Value for $n$ Person Games,” Contributions to the Theory of Games. Princeton Univ. Press, pp. 3140, 1953.
[17] W. Wang, X. Li, and Y. Wang, “Truthful Multicast in Selfish Wireless Networks,” Proc. ACM MobiCom, 2004.
[18] Z. Li, B. Li, D. Jiang, and L.C. Lau, “On Achieving Optimal Throughput with Network Coding,” Proc. IEEE INFOCOM, 2005.
[19] Y. Wu, P.A. Chou, Q. Zhang, K. Jain, W. Zhu, and S.Y. Kung, “Network Planning in Wireless Ad Hoc Networks: A CrossLayer Approach,” J. Selected Areas in Comm., vol. 23, no. 1, pp. 136150, Jan. 2005.
[20] J. Yuan, Z. Li, W. Yu, and B. Li, “A CrossLayer Optimization Framework for Multihop Multicast in Wireless Mesh Networks,” J. Selected Areas in Comm., special issue on multihop wireless mesh networks, 2006.
[21] H.W. Kuhn and A.W. Tucker, “Nonlinear Programming,” Proc. Second Berkeley Symp. Math. Statistics and Probability, 1951.
[22] W. Wang, X.Y. Li, Y. Wang, and Z. Sun, “Designing Multicast Protocols for NonCooperative Networks,” IEEE J. Selected Areas in Comm., vol. 26, no. 7, pp. 12381249, Sept. 2008.
[23] K. Jain and V.V. Vazirani, “Applications of Approximation Algorithms to Cooperative Games,” Proc. 33rd ACM Symp. Theory of Computing (STOC), 2001.
[24] N. Immorlica, D. Karger, E. Nikolova, and R. Sami, “FirstPrice Path Auctions,” Proc. Sixth ACM Conf. Electronic Commerce (EC), 2005.
[25] Z. Li, “CrossMonotonic Multicast,” Proc. IEEE INFOCOM, 2008.
[26] 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 Trans. Information Theory, vol. 51, no. 6, pp. 19731982, June 2005.
[27] G. Dantzig, Linear Programming and Extensions. Princeton Univ. Press, 1998.
[28] M.J. Osborne and A. Rubinstein, A Course in Game Theory. MITPress, 1994.
[29] E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden, “The Price of Stability for Network Design with Fair Cost Allocation,” Proc. 45th IEEE Symp. Foundations of Computer Science (FOCS), 2004.
[30] C. Papadimitriou, “Algorithms, Games, and the Internet,” Proc. 33rd ACM Symp. the Theory of Computing (STOC), 2001.
[31] E. Altman and L. Wynter, “Euilibrium, Games, and Pricing in Transportation and Telecommunication Networks,” Networks and Spatial Economics, vol. 4, no. 1, pp. 721, Mar. 2004.
[32] 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.