NETWORKING 2011: NETWORKING 2011 pp 82-96 | Cite as

Strategyproof Mechanisms for Content Delivery via Layered Multicast

  • Ajay Gopinathan
  • Zongpeng Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6641)

Abstract

Layered multicast exploits the heterogeneity of user capacities, making it ideal for delivering content such as media streams over the Internet. In order to maximize either its revenue or the total utility of users, content providers employing layered multicast need to carefully choose a routing, layer allocation and pricing scheme. We study algorithms and mechanisms for achieving either goal from a theoretical perspective. When the goal is maximizing social welfare, we prove that the problem is NP-hard, and provide a simple 3-approximation algorithm. We next tailor a payment scheme based on the idea of critical bids to derive a truthful mechanism that achieves a constant fraction of the optimal social welfare. When the goal is revenue maximization, we first design an algorithm that computes the revenue-maximizing layer pricing scheme, assuming truthful valuation reports. This algorithm, coupled with a new revenue extraction procedure for layered multicast, is used to design a randomized, strategyproof auction that elicits truthful reports. Employing discrete martingales to model the auction, we show that a constant fraction of the optimal revenue can be guaranteed with high probability. Finally, we study the efficacy of our algorithms via simulations.

Keywords

Network Code Steiner Tree Content Provider Content Delivery Payment Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. 1.
    Kurose, J., Ross, K.: Computer networking: a top-down approach featuring the Internet. Addison-Wesley, Reading (2003)Google Scholar
  2. 2.
    Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner Trees. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA (2003)Google Scholar
  3. 3.
    Thimm, M.: On the approximability of the steiner tree problem. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, p. 678. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    McCanne, S., Jacobson, V., Vetterli, M.: Receiver-driven layered multicast. In: Proceedings of ACM SIGCOMM (1996)Google Scholar
  5. 5.
    Zhao, J., Yang, F., Zhang, Q., Zhang, Z., Zhang, F.: Lion: Layered overlay multicast with network coding. IEEE Transactions on Multimedia 8, 1021 (2006)CrossRefGoogle Scholar
  6. 6.
    Gopinathan, A., Li, Z.: Optimal layered multicast. ACM Transactions on Multimedia Computing, Communications and Applications 7(2) (2011)Google Scholar
  7. 7.
    Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: Proceedings of the ACM Symposium on Theory of computing, STOC (1999)Google Scholar
  8. 8.
    Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)MATHGoogle Scholar
  9. 9.
    Ahlswede, R., Cai, N., Li, S.R., Yeung, R.W.: Network Information Flow. IEEE Transactions on Information Theory 46(4), 1204–1216 (2000)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 8–37 (1961)Google Scholar
  11. 11.
    Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17–33 (1971)CrossRefGoogle Scholar
  12. 12.
    Groves, T.: Incentives in teams. Econometrica: Journal of the Econometric Society, 617–631 (1973)Google Scholar
  13. 13.
    Goldberg, A., Hartline, J., Karlin, A., Saks, M., Wright, A.: Competitive auctions. Games and Economic Behavior 55(2), 242–269 (2006)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Azuma, K.: Weighted sums of certain dependent random variables. Tohoku Mathematical Journal 19(3), 357–367 (1967)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Gopinathan, A., Li, Z.: Strategyproof mechanisms for layered multicast, http://ajay.gopinathan.net
  16. 16.
    Li, Z., Li, B., Jiang, D., Lau, L.C.: On Achieving Optimal Throughput with Network Coding. In: Proceedings of IEEE INFOCOM (2005)Google Scholar
  17. 17.
    Li, Z., Li, B.: Efficient and Distributed Computation of Maximum Multicast Rates. In: Proceedings of IEEE INFOCOM (2005)Google Scholar
  18. 18.
    Myerson, R.B.: Optimal auction design. Mathematics of Operations Research, 58–73 (1981)Google Scholar
  19. 19.
    Borgs, C., Chayes, J., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: Proceedings of the ACM Conference on Electronic Commerce, EC (2005)Google Scholar
  20. 20.
    ISO/IEC, Generic coding of moving pictures and association audio information, ISO/IEC 13 818–2 (1995)Google Scholar
  21. 21.
    ITU, Video coding for low bit rate communication. ITU-T Recommendation H.263 (1998)Google Scholar
  22. 22.
    Boston University Representative Internet Topology gEnerator, http://www.cs.bu.edu/brite/

Copyright information

© IFIP International Federation for Information Processing 2011

Authors and Affiliations

  • Ajay Gopinathan
    • 1
  • Zongpeng Li
    • 1
  1. 1.Department of Computer ScienceUniversity of CalgaryCanada

Personalised recommendations