Caching Content under Digital Rights Management

  • Leah Epstein
  • Amos Fiat
  • Meital Levy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5426)


Digital rights management systems seek to control the use of proprietary material (e.g., copyrighted movies). The use of DRM introduces a new set of caching issues not previously studied. Technically, these problems include elements of ski rental algorithms as well as paging, and their generalizations, online “capital investment” and generalized caching (the Landlord algorithm). The introduction of DRM restrictions does not impact the competitive ratio by more than a constant factor.


Competitive Ratio Cache Size Tight Bound Expiration Time Cache Content 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Azar, Y., Bartal, Y., Feuerstein, E., Fiat, A., Leonardi, S., Rosen, A.: On capital investment. Algorithmica 25(1), 22–36 (1999)CrossRefzbMATHGoogle Scholar
  2. 2.
    Bansal, N., Buchbinder, N., Naor, S.: Randomized competitive algorithms for generalized caching. In: The 40th Annual ACM Symposium on Theory of Computing (STOC 2008) (2008)Google Scholar
  3. 3.
    Becker, E., Buhse, W., Günnewig, D., Rump, N. (eds.): Digital Rights Management - Technological, Economic, Legal and Political Aspects. LNCS, vol. 2770. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  4. 4.
    Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)zbMATHGoogle Scholar
  5. 5.
    Chrobak, M., Karloff, H.J., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM Journal of Discrete Math. 4(2), 172–181 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Gopalan, P., Karloff, H., Mehta, A., Mihail, M., Vishnoi, N.: Caching with expiration times for internet applications. Internet Mathematics 2(2), 165–184 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kimbrel, T.: Online paging and file caching with expiration times. Theor. Comput. Sci. 268(1), 119–131 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Ku, W., Chi, C.-H.: Survey on the technological aspects of digital rights management. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 391–403. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Liu, Q., Safavi-Naini, R., Sheppard, N.P.: Digital rights management for content distribution. In: ACSW Frontiers 2003: Proceedings of the Australasian information security workshop conference on ACSW frontiers, Darlinghurst, Australia, Australia, pp. 49–58. Australian Computer Society, Inc. (2003)Google Scholar
  10. 10.
    Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Young, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525–541 (1994)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Young, N.E.: On-line file caching. Algorithmica 33(3), 371–383 (2002)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Leah Epstein
    • 1
  • Amos Fiat
    • 2
  • Meital Levy
    • 2
  1. 1.Department of MathematicsUniversity of HaifaHaifaIsrael
  2. 2.School of Computer ScienceTel-Aviv UniversityIsrael

Personalised recommendations