Designing multicast protocols for non-cooperative networks

IEEE Journal on Selected Areas in Communications

Volumn 26, Issue 7, 2008, Pages 1238-1249

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

^a IEEE

^b GOOGLE INC   (United States)

^c ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

Author keywords

Combinatorics; Control theory; Economics; Multicast; Noncooperative; Payment; Sharing

Indexed keywords

MULTICASTING;

COMBINATORICS; CONTROL THEORY; ECONOMICS; MULTICAST; NONCOOPERATIVE; PAYMENT; SHARING;

NETWORK PROTOCOLS;

EID: 50649121280     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2008.080920     Document Type: Article

References (32)

1. Steve E. Deering, Multicast Routing in a Datagram Internetwork, Ph.D. thesis, Stanford University, Dec 1991.
2. Noam Nisan, "Algorithms for selfish agents," in Proc. 16th Symposium on Theoretical Aspects of Computer Science, LNCS, vol. 1563, pp. 1-15, 1999.
3. W. Vickrey, "Counterspeculation, auctions and competitive sealed tenders," J. Finance, vol. 16, no. 1, pp. 8-37, 1961.
4. E. H. Clarke, "Multipart pricing of public goods," Public Choice, vol. 11, no. 1, pp. 17-33, 1971.
5. T. Groves, "Incentives in teams," Econometrica, vol. 41, no. 4, pp. 617-631, 1973.
6. Gabriel Robins and Alexander Zelikovsky, "Improved steiner tree approximation in graphs," in Proc. ACM SODA, 2000, pp. 770-779.
7. H. Takahashi and A. Matsuyama, "An approximate solution for the steiner problem in graphs," Math. Jap., vol. 24, no. 6, pp. 573-577, 1980.
8. P. Klein and R. Ravi, "A nearly best-possible approximation algorithm for node-weighted steiner trees," J. Algorithms, vol. 19, no. 1, pp. 104-115, 1995.
9. S. Guha and S. Khuller, "Improved methods for approximating node weighted steiner trees and connected dominating sets," Infornuttion and Computation, vol 150, no. 1, pp. 57-74, 1999.
10. Weizhao Wang, Xiang-Yang Li, and Yu Wang, "Truthful multicast in selfish wireless networks," in Proc. ACM MobiCom, pp. 402-413, 2004.
11. Shai Herzog, Scott Shenker, and Deborah Estrin, "Sharing the cost of multicast: trees: an axiomatic analysis," in ACM SigComm. 1995, pp. 315-327.
12. Ron Cocchi, Scott Shenker, Deborah Estrin, and Lixia Zhang, "Pricing in computer networks: motivation, formulation, and example," IEEE/ACM Trans. Networking, vol. 1, no. 6, pp. 614-627, 1993.
13. Micah Adler and Dan Rubenstein, "Pricing multicasting in more practical network models," in ACM SODA. 2002, pp. 981-990.
14. 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.
15. Joan Feigenbaum, Christos H. Papadimitriou, and Scott Shenker, "Sharing the cost of multicast transmissions," J. Computer System Sciences, vol. 63, no. 1, pp. 21-41, 2001.
16. Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker, "Approximation and collusion in multicast cost sharing (abstract)," in Proc. ACM Economic Conference, pp. 253-255, 2001.
17. Noam Nisan and Amir Ronen, "Algorithmic mechanism design," in Proc. ACM STOC, 1999, pp. 129-140.
18. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGP-based mechanism for lowest-cost routing," in ACM PODC, 2002, pp. 173-182.
19. 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.
20. Weizhao Wang and Xiang-Yang Li, "Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks," IEEE Trans. Mobile Comput. vol. 5, no. 5, pp. 596-607, 2006.
21. Kamal Jain and Vijay V. Vazirani, "Applications of approximation algorithms to cooperative games," In ACM STOC, 2001, pp. 364-372.
22. Shuchi Chawla, David Kitchin, Uday Rajan, R. Ravi, and Amitabh Sinha, "Profit maximizing mechanisms for the extended multicasting gomes," Tech. Rep. CMU-CS-02-164, Carnegie Mellon University, July 2002.
23. J. D. Hartline A. Fiat, A. V. Goldberg and A. R. Karlin, "Competitive generalized auctions," in ACM STOC. 2002, pp. 72-81.
24. Lavy Libman and Ariel Orda, "Atomic resource sharing in noncooperative networks," Telecommunication Systems, vol. 17, no. 4, pp. 385-409, 2001.
25. Yunhuo Liu, Li Xiao, and Lionel M Ni, "Building a Scalable Bipartite P2P Overlay Network," IEEE TPDS, Vol. 18, No. 9, 2007, Pages 1296-1306.
26. Yunhao Liu, Li Xiao, Xiaomei Liu, Lionel M Ni, and Xiaodong Zhang, "Location Awareness in Unstructured Peer-to-Peer Systems," IEEE TPDS, Vol. 16, No. 2, 2005, Pages 163-174.
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. 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.
29. Shal Herzog, Scoot Shenker, and Deborah Estrin, "Sharing the cost of multicast trees: An axiomatic analysis," IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 847-860, 1997.
30. Juniper Networks, Multiprotocol Extensions for BGP-4, RFC 2858.
31. Cisco Systems, A Border Gateway Protocol 4 (BGP-4), RFC 1771.
32. L. S. Shapley, "A value for n-person games," in Contributions to the Theory of Games, pp. 31-40, Princeton, University Press, 1953.