
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Nandan Garg, Daniel Grosu, "A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 8, pp. 10891101, August, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.221, author = {Nandan Garg and Daniel Grosu}, title = {A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {8}, issn = {10459219}, year = {2009}, pages = {10891101}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.221}, 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  A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions IS  8 SN  10459219 SP1089 EP1101 EPD  10891101 A1  Nandan Garg, A1  Daniel Grosu, PY  2009 KW  Multicast KW  cost sharing KW  faithful implementation KW  algorithmic mechanism design. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] A. Dan, D. Sitaram, and P. Shahabuddin, “Scheduling Policies for an OnDemand Video Server with Batching,” Proc. Second ACM Int'l Conf. Multimedia (MULTIMEDIA '94), pp. 1523, Oct. 1994.
[2] V.O.K. Li and Z. Zaichen, “Internet Multicast Routing and Transport Control Protocols,” Proc. IEEE, vol. 90, no. 3, pp.360391, 2002.
[3] K.C. Almeroth and M.H. Ammar, “The Use of Multicast Delivery to Provide a Scalable and Interactive VideoonDemand Service,” IEEE J. Selected Areas in Comm., vol. 14, no. 6, pp. 11101122, 1996.
[4] K. Sripanidkulchai, B. Maggs, and H. Zhang, “An Analysis of Live Streaming Workloads on the Internet,” Proc. Fourth ACM SIGCOMM Conf. Internet Measurement (IMC '04), pp. 4154, Oct. 2004.
[5] G. Tan and S.A. Jarvis, “Improving the Fault Resilience of Overlay Multicast for Media Streaming,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 721734, June 2007.
[6] P. Van Mieghem, G. Hooghiemstra, and R. van der Hofstad, “On the Efficiency of Multicast,” IEEE/ACM Trans. Networking, vol. 9, no. 6, pp. 719732, 2001.
[7] V.P. Kompella, J.C. Pasquale, and G.C. Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286292, 1993.
[8] D. Dolev, O. Mokryn, and Y. Shavitt, “On Multicast Trees: Structure and Size Estimation,” IEEE/ACM Trans. Networking, vol. 14, no. 3, pp. 557567, 2006.
[9] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM '02, pp.205217, Aug. 2002.
[10] J. Jannotti, D.K. Gifford, K.L. Johnson, M.F. Kaashoek, and J.W. O'Toole, Jr., “Overcast: Reliable Multicasting with an Overlay Network,” Proc.Fourth Symp. Operating Systems Design and Implementation (OSDI '00), pp. 197212, Oct. 2000.
[11] Y.H. Chu, S.G. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS '00, pp. 112, June 2000.
[12] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “TopologicallyAware Overlay Construction and Server Selection,” Proc. IEEE INFOCOM '02, vol. 3, pp. 11901199, June 2002.
[13] N. Laoutaris, G. Smaragdakis, K. Oikonomou, I. Stavrakakis, and A. Bestavros, “Distributed Placement of Service Facilities in LargeScale Networks,” Proc. IEEE INFOCOM '07, pp. 21442152, May 2007.
[14] S. Deering and D.R. Cheriton, “Multicast Routing in Datagram Internetworks and Extended LANs,” ACM Trans. Computer Systems, vol. 8, no. 2, pp. 85110, 1990.
[15] C. Yi, X. Yuan, and K. Nahrstedt, “Optimal Resource Allocation in Overlay Multicast,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 8, pp. 808823, Aug. 2006.
[16] C. Huang, J. Li, and K.W. Ross, “Can Internet VideoonDemand Be Profitable?” Proc. IEEE INFOCOM '07, pp. 21442152, May 2007.
[17] N. Nisan and A. Ronen, “Algorithmic Mechanism Design,” Games and Economic Behaviour, vol. 35, nos. 1/2, pp. 166196, Apr. 2001.
[18] J. Feigenbaum and S. Shenker, “Distributed Algorithmic Mechanism Design: Recent Results and Future Directions,” Proc. Sixth ACM Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '02), pp. 113, Sept. 2002.
[19] A. MasColell, M.D. Whinston, and J.R. Green, Microeconomic Theory. Oxford Univ. Press, 1995.
[20] J. Feigenbaum, C. Papadimitriou, and S. Shenker, “Sharing the Cost of Multicast Transmissions,” J. Computer and System Sciences, vol. 63, no. 1, pp. 2141, Aug. 2001.
[21] H. Moulin and S. Shenker, “Strategyproof Sharing of Submodular Costs: Budget Balance versus Efficiency,” J. Economic Theory, vol. 18, no. 3, pp. 511533, 2001.
[22] J. Green, E. Kohlberg, and J. Laffont, “Partial Equilibrium Approach to the FreeRider Problem,” J. Public Economics, vol. 6, no. 4, pp. 375394, 1976.
[23] J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker, “Approximation and Collusion in Multicast Cost Sharing,” Proc. Fourth ACM Conf. Electronic Commerce (EC '03), p. 280, June 2003.
[24] J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker, “Hardness Results for Multicast Cost Sharing,” Theoretical Computer Science, vol. 304, nos. 13, pp. 215236, 2003.
[25] J. Shneidman and D.C. Parkes, “Specification Faithfulness in Networks with Rational Nodes,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 8897, July 2004.
[26] L. Lao, J.H. Cui, M. Gerla, and S. Chen, “A Scalable Overlay Multicast Architecture for LargeScale Applications,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 4, pp. 449459, Apr. 2007.
[27] S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, “Omni: An Efficient Overlay Multicast Infrastructure for RealTime Applications,” Computer Networks, vol. 50, no. 6, pp.826841, 2006.
[28] Y. Chawathe, “Scattercast: An Adaptable Broadcast Distribution Framework,” Multimedia Systems, vol. 9, no. 1, pp. 104118, 2003.
[29] E.I. Lin, A.M. Eskicioglu, R.L. Lagendijk, and E.J. Delp, “Advances in Digital Video Content Protection,” Proc. IEEE, vol. 93, no. 1, pp.171183, 2005.
[30] S. Rafaeli and D. Hutchison, “A Survey of Key Management for Secure Group Communication,” ACM Computing Surveys, vol. 35, no. 3, pp. 309329, 2003.
[31] S. Deering, D.L. Estrin, D. Farinacci, V. Jacobson, L. ChingGung, and W. Liming, “The PIM Architecture for WideArea Multicast Routing,” IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 153162, 1996.
[32] T.E. Carroll and D. Grosu, “Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines,” Proc. Eighth Int'l Symp. Parallel Architectures, Algorithms, and Networks (ISPAN '05), pp. 194199, Dec. 2005.
[33] T.E. Carroll and D. Grosu, “A Strategyproof Mechanism for Scheduling Divisible Loads in Tree Networks,” Proc. 20th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '06), Apr. 2006.
[34] J. Shneidman, D.C. Parkes, and L. Massoulie, “Faithfulness in Internet Algorithms,” Proc. ACM SIGCOMM Workshop Practice and Theory of Incentives in Networked Systems (PINS '04), pp. 220227, Sept. 2004.
[35] S. Shakkottai and R. Srikant, “Economics of Network Pricing with Multiple ISPs,” IEEE/ACM Trans. Networking, vol. 14, no. 6, pp. 12331245, 2006.
[36] J. MacKieMason and H. Varian Pricing the Internet, Public Access to the Internet, pp. 269314. MIT Press, 1995.
[37] S. Herzog, S. Shenker, and D. Estrin, “Sharing the “Cost” of Multicast Trees: An Axiomatic Analysis,” IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 847860, 1997.
[38] J. Mitchell and V. Teague, “Autonomous Nodes and Distributed Mechanisms,” Software Security—Theories and Systems. MextNSFJSPS Int'l Symp. (ISSS '02), pp. 5883, 2003.
[39] S. Gorinsky, S. Jain, H. Vin, and Z. Yongguang, “Design of Multicast Protocols Robust against Inflated Subscription,” IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 249262, 2006.
[40] PlanetLab, http:/www.planetlab.org, 2008.
[41] S. Siachalou and L. Georgiadis, “Algorithms for Precomputing Constrained Widest Paths and Multicast Trees,” IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 11741187, 2005.
[42] S. Ramanathan, “Multicast Tree Generation in Networks with Asymmetric Links,” IEEE/ACM Trans. Networking, vol. 4, no. 4, pp.558568, 1996.
[43] L.S. Shapley, “A Value for NPerson Games,” Contribution to the Theory of Games, vol. 2, Princeton Univ. Press, pp. 3140, 1953.
[44] OpenSSL, http:/www.openssl.org, 2008.
[45] N. Garg and D. Grosu, “Faithful Distributed Shapley Mechanisms for Sharing the Cost of Multicast Transmissions,” Proc. 12th IEEE Symp. Computers and Comm. (ISCC '07), pp. 741747, July 2007.
[46] N. Garg and D. Grosu, “Performance Evaluation of Multicast Cost Sharing Mechanisms,” Proc. 21st IEEE Int'l Conf. Advanced Information Networking and Applications (AINA '07), pp. 901908, May 2007.