Skip to main content
SpringerLink
Log in

Economics-Informed Design of CDNs

  • Chapter
Content Delivery Networks

Part of the book series: Lecture Notes Electrical Engineering ((LNEE,volume 9))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Napster protocol specification (2000). http://opennap.sourceforge.net/napster.txt

    Google Scholar 

  2. Adar, E., Huberman, B.: Free riding on Gnutella. First Monday 5(10) (2000)

    Google Scholar 

  3. Akella, A., Seshan, S., Karp, R., Shenker, S., Papadimitriou, C.: Selfish behavior and stability of the Internet: A game-theoretic analysis of TCP. In: Proc. ACM SIGCOMM’02, pp. 117–130. Pittsburgh, PA (2002)

    Google Scholar 

  4. Akerlof, G., Yellen, J.: Can small deviations from rationality make significant differences to economic equilibria? American Economic Review 75(4), 708–720 (1985)

    Google Scholar 

  5. Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable application layer multicast. In: Proc. ACM SIGCOMM’02, pp. 205–217. Pittsburgh, PA (2002)

    Google Scholar 

  6. Braess, D.: Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12, 258–268 (1969)

    Article  MathSciNet  Google Scholar 

  7. Breslau, L., Cao, P., Fan, L., Philips, G., Shenker, S.: Web caching and Zipf-like distributions: Evidence and implications. In: Proc. IEEE INFOCOM’99, pp. 126–134. New York, NY (1999)

    Google Scholar 

  8. Buchegger, S., Le Boudec, J.Y.: Performance analysis of the confidant protocol. In: Proc. ACM MobiHoc’02, pp. 226–236. ACM (2002)

    Google Scholar 

  9. Cha, M., Kwak, H., Rodriguez, P., Ahn, Y.Y., Moon, S.: I Tube, You Tube, Everybody Tubes: Analyzing the world’s largest user generated content video system. In: Proc. ACM IMC’07. San Diego, CA (2007)

    Google Scholar 

  10. Christin, N., Chuang, J.: On the cost of participating in a peer-to-peer network. In: Proc. IPTPS’04, Lecture Notes in Computer Science, Vol. 3279, pp. 22–32. San Diego, CA (2004)

    Google Scholar 

  11. Christin, N., Chuang, J.: A cost-based analysis of overlay routing geometries. In: Proc. INFOCOM’05, Vol. 4, pp. 2566–2577. Miami, FL (2005)

    Google Scholar 

  12. Christin, N., Grossklags, J., Chuang, J.: Near rationality and competitive equilibria in networked systems. In: Proc. ACM SIGCOMM’04 Workshop on Practice and Theory of Incentives in Networked Systems (PINS), pp. 213–219. Portland, OR (2004)

    Google Scholar 

  13. Chu, Y.H., Rao, S., Zhang, H.: A case for endsystem multicast. In: Proc. ACM SIGMETRICS’00, pp. 1–12. Santa Clara, CA (2000)

    Google Scholar 

  14. Chun, B.G., Chaudhuri, K., Wee, H., Barreno, M., Papadimitriou, C., Kubiatowicz, J.: Selfish caching in distributed systems: a game-theoretic analysis. In: Proc. ACM PODC’04, pp. 21–30. Saint John’s, NL, CA (2004)

    Google Scholar 

  15. Chun, B.G., Fonseca, R., Stoica, I., Kubiatowicz, J.: Characterizing selfishly constructed overlay networks. In: Proc. IEEE INFOCOM’04, Vol. 2, pp. 1329–1339. Hong Kong (2004)

    Google Scholar 

  16. Cohen, B.: Incentives build robustness in BitTorrent. In: Proc. 1st Workshop on the Economics of Peer-to-Peer Systems. Berkeley, CA (2003)

    Google Scholar 

  17. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proc. ACM PODC’03, pp. 347–351. Boston, MA (2003)

    Google Scholar 

  18. Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proc. DIAL-M’02, pp. 1–13. Atlanta, GA (2002)

    Google Scholar 

  19. Feldman, M., Chuang, J., Stoica, I., Shenker, S.: Hidden-action in multi-hop routing. In: Proc. ACM EC’05, pp. 117–126. ACM (2005)

    Google Scholar 

  20. Goemans, M., Li, L., Mirrokni, V., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: Proc. ACM MobiHoc ’04, pp. 55–66. ACM, Roppongi Hills, Tokyo, Japan (2004)

    Book  Google Scholar 

  21. Goeree, J., Holt, C.: A model of noisy introspection. Games and Economic Behavior 46(2), 365–382 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proc. ACM SIGCOMM’03, pp. 381–394. Karlsruhe, Germany (2003)

    Google Scholar 

  23. Hardin, G.: The tragedy of the commons. Science 162(3859), 1243–1248 (1968)

    Article  Google Scholar 

  24. Holt, C., Roth, A.: The Nash equilibrium: a perspective. Proc. National Academy of Sciences 101(12), 3999–4002 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  25. Hsieh, H.Y., Sivakumar, R.: Performance comparison of cellular and multi-hop wireless networks: A quantitative study. In: Proc. ACM SIGMETRICS’01, pp. 113–122. Cambridge, MA (2001)

    Google Scholar 

  26. Huang, C., Li, J., Ross, K.: Can internet video-on-demand be profitable? In: Proc. ACM SIGCOMM’07, pp. 133–144. Kyoto, Japan (2007)

    Google Scholar 

  27. Jackson, M., Wolinsky, A.: A strategic model for social and economic networks. Journal of Economic Theory 71(1), 44–74 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  28. Kaashoek, M.F., Karger, D.: Koorde: A simple degree-optimal distributed hash table. In: Proc. IPTPS’03, pp. 323–336. Berkeley, CA (2003)

    Google Scholar 

  29. Khor, S.H., Christin, N., Wong, T., Nakao, A.: Power to the people: Securing the Internet one edge at a time. In: Proc. ACM SIGCOMM’07 Workshop on Large-Scale Attack Defense (LSAD), pp. 89–96. Kyoto, Japan (2007)

    Google Scholar 

  30. Liebeherr, J., Nahas, M., Si, W.: Application-layer multicast with Delaunay triangulations. IEEE Journal of Selected Areas in Communications 20(8), 1472–1488 (2002)

    Article  Google Scholar 

  31. Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Proc. ACM SIGCOMM’03, pp. 395–406. Karlsruhe, Germany (2003)

    Google Scholar 

  32. McKelvey, R., Palfrey, T.: Quantal response equilibria for normal form games. Games and Economic Behavior 10(1), 6–38 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  33. Mockapetris, P., Dunlap, K.: Development of the domain name system. In: Proc. ACM SIGCOMM’88, pp. 123–133. Stanford, California (1988)

    Google Scholar 

  34. Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proc. ACM SPAA’03, pp. 50–59. San Diego, CA (2003)

    Google Scholar 

  35. Nash, J.: Non-cooperative games. Annals of Mathematics 54(2), 286–295 (1951)

    Article  MathSciNet  Google Scholar 

  36. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.): Algorithmic Game Theory. Cambridge University Press (2007)

    Google Scholar 

  37. Papadimitriou, C.: Algorithms, games and the Internet. In: Proc. ACM STOC’01, pp. 749–753. Heraklion, Crete, Greece (2001)

    Google Scholar 

  38. Pathan, A.M., Buyya, R.: Economy-based content replication for peering content delivery networks. In: Proc. CCGRID, pp. 887–892. IEEE Computer Society (2007)

    Google Scholar 

  39. Perkins, C. (ed.): Ad hoc networking. Addison-Wesley, Boston, MA (2000)

    Google Scholar 

  40. Plaxton, C.G., Rajamaran, R., Richa, A.: Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems 32(3), 241–280 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  41. Radner, R.: Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives. Journal of Economic Theory 22, 136–154 (1980)

    Article  MATH  Google Scholar 

  42. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM’01, pp. 161–172. San Diego, CA (2001)

    Google Scholar 

  43. Roughgarden, T., Tardos, É.: How bad is selfish routing? Journal of the ACM 49(2), 236–259 (2002)

    Google Scholar 

  44. Rowston, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large scale peer-to-peer systems. In: Proc. IFIP/ACM Middleware’01, pp. 329–350. Heidelberg, Germany (2001)

    Google Scholar 

  45. Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proc. SPIE/ACM MMCN’02, pp. 156–170. San Jose, CA (2002)

    Google Scholar 

  46. Shenker, S.: Making greed work in networks: A game-theoretic analysis of switch service disciplines. IEEE/ACM Transactions on Networking 3(6), 819–831 (1995)

    Article  MathSciNet  Google Scholar 

  47. Sivarajan, K., Ramaswami, R.: Lightwave networks based on de Bruijn graphs. IEEE/ACM Transactions on Networking 2(1), 70–79 (1994)

    Article  Google Scholar 

  48. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)

    Article  Google Scholar 

  49. Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph, A., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1), 41–53 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University INI and CyLab Japan, 1-3-3-17 Higashikawasaki-cho, Chuo-ku, Kobe, 650-0044 Japan

    Nicolas Christin

  2. School of Information, The University of California at Berkeley, 102 South Hall, Berkeley, CA 94720, USA

    John Chuang & Jens Grossklags

Authors
  1. Nicolas Christin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Chuang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jens Grossklags
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Computer Science&Software Engineering, University of Melbourne, 111 Barry Street, Carlton VIC 3053, Australia

    Rajkumar Buyya

  2. Dept. Computer Science & Software Engineering, University of Melbourne, 111 Barry Street, Carlton VIC 3053, Australia

    Mukaddim Pathan

  3. Dept. Informatics, Aristotle University of Thessaloniki, 541 24 Thessaloniki, Greece

    Athena Vakali

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Christin, N., Chuang, J., Grossklags, J. (2008). Economics-Informed Design of CDNs. In: Buyya, R., Pathan, M., Vakali, A. (eds) Content Delivery Networks. Lecture Notes Electrical Engineering, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77887-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77887-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77886-8

  • Online ISBN: 978-3-540-77887-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation