Design multicast protocols for non-cooperative networks

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2005, Pages 1596-1607

  Wang, WeiZhao ^a   Li, Xiang Yang ^a   Sun, Zheng ^b   Wang, Yu ^c  

^a Illinois Institute of Technology   (United States)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^c University of North Carolina at Charlotte   (United States)

Author keywords

Combinatorics; Control theory; Economics; Multicast; Non cooperative; Payment; Sharing

Indexed keywords

MULTICASTING PROTOCOLS; NON-COOPERATIVE NETWORKS;

COMPUTER SIMULATION; MULTICASTING;

NETWORK PROTOCOLS;

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

References (30)

1. Noam Nisan, "Algorithms for selfish agents," Lecture Notes in Computer Science, vol. 1563, pp. 1-15, 1999.
2. W. Vickrey, "Counterspeculation, auctions and competitive sealed tenders," Journal of Finance, pp. 8-37, 1961.
3. E. H. Clarke, "Multipart pricing of public goods," Public Choice, pp. 17-33, 1971.
4. T. Groves, "Incentives in teams," Econometrica, pp. 617-631, 1973.
5. J. Green and J. J. Laffont, "Characterization of satisfactory mechanisms for the revelation of preferences for public goods," Econometrica, pp. 427-438, 1977.
6. Noam Nisan and Amir Ronen, "Algorithmic mechanism design," in Proc. ACM STOC, 1999, pp. 129-140.
7. Kamal Jain and Vijay V. Vazirani, "Applications of approximation algorithms to cooperative games," in ACM Symposium on Theory of Computing, 2001, pp. 364-372.
8. Shuchi Chawla, David Kitchin, Uday Rajan, R. Ravi, and Amitabh Sinha, "Profit maximizing mechanisms for the extended multicasting games," Tech. Rep. CMU-CS-02-164, Carnegie Mellon University, July 2002.
9. A Fiat, A. Goldberg, J. Hartline, and A. Karlin, "Competitive generalized auctions," in ACM STOC, 2002.
10. Lavy Libman and Ariel Orda, "Atomic resource sharing in noncooperative networks," Telecommunication Systems, vol. 17, no. 4, pp. 385-409, 2001.
11. S. Shenker, D. Clark, E. Estrin, and S. Herzog, "Pricing in Computer Networks: Reshaping the Research Agenda," ACM SIGCOMM Computer Communication Review, vol. 26, no. 2, pp. 19-43, 1996.
12. Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker, "Hardness results for multicast cost sharing," Theoretical Computer Science, vol. 304, no. 1-3, pp.215-236, 2003.
13. Shai Herzog, Scoot Shenker, and Deborah Estrin, "Sharing the Cost of Multicast Trees: An axiomatic Analysis," IEEE/ACM Transactions on Networking (TON), vol. 5, no. 6, pp. 847-860, 1997.
14. G. Robins and A. Zelikovsky, "Improved steiner tree approximation in graphs," in ACM SODA, 2000, pp. 770-779.
15. H. Takahashi and A. Matsuyama, "An approximate solution for the steiner problem in graphs," Math Jap., vol. 24, pp. 573-577, 1980.
16. P. Klein and R. Ravi, "A nearly best-possible approximation algorithm for node-weighted Steiner trees," Journal of Algorithms, vol. 19, no. 1, pp.104-115, 1995.
17. S. Guha and S. Khuller, "Improved methods for approximating node weighted steiner trees and connected dominating sets," in Foundations of Software Technology and Theoretical Computer Science, 1998, pp. 54-65.
18. WeiZhao Wang Xiang-Yang Li and Yu Wang, "Truthful multicast in selfish wireless networks," in ACM MobiCom 2004, 2004.
19. Shai Herzog, Scott Shenker, and Deborah Estrin, "Sharing the cost of multicast trees: an axiomatic analysis," in Proc. of the conf. on Applications, technologies, architectures, and protocols for computer communication. 1995, pp. 315-327, ACM Press.
20. R. Cocchi, S. Shenker, D. Estrin, and Lixia Zhang, "Pricing in computer networks: motivation, formulation, and example," IEEE/ACM Trans. Netw., vol. 1, no. 6, pp. 614-627, 1993.
21. Micah Adler and Dan Rubenstein, "Pricing multicasting in more practical network models," in ACM SODA, 2002, pp. 981-990.
22. Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker, "Hardness results for multicast cost sharing," Theor. Comput. Sci., vol. 304, no. 1-3, pp. 215-236, 2003.
23. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker, "Sharing the cost of multicast transmissions," Journal of Computer and System Sciences, vol. 63, no. 1, pp. 21-41, 2001.
24. Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker, "Approximation and collusion in multicast cost sharing (abstract)," in ACM Economic Conference, 2001.
25. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGP-based mechanism for lowest-cost routing," in Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing., 2002, pp. 173-182.
26. Luzi Anderegg and Stephan Eidenbenz, "Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents," in ACM MobiCom. 2003, pp. 245-259.
27. Herve Moulin and Scoot Shenker, "Strategyproof sharing of submodular costs: Budget balance versus efficiency," Economic Theory vol. 18, no. 3, pp. 511-533, 2001
28. L. S. Shapley, "A value for n-person games," in Contributions to the Theory of Games, pp. 31-40. Princeton Univ. Press, 1953.
29. WeiZhao Wang and Xiang-Yang Li, "Truthful low-cost unicast in selfish wireless networks," in Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, with IPDPS 2004, 2004.
30. Aaron Archer and Eva Tardos, "Frugal path mechanisms," in ACM-SIAM SODA, 2002, pp. 991-999.