Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Caching Content under Digital Rights Management

  • Conference paper
Approximation and Online Algorithms (WAOA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5426))

Included in the following conference series:

Abstract

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.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Azar, Y., Bartal, Y., Feuerstein, E., Fiat, A., Leonardi, S., Rosen, A.: On capital investment. Algorithmica 25(1), 22–36 (1999)

    Article  MATH  Google Scholar 

  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. 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)

    MATH  Google Scholar 

  4. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kimbrel, T.: Online paging and file caching with expiration times. Theor. Comput. Sci. 268(1), 119–131 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  11. Young, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525–541 (1994)

    Article  MathSciNet  Google Scholar 

  12. Young, N.E.: On-line file caching. Algorithmica 33(3), 371–383 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Haifa, 31905, Haifa, Israel

    Leah Epstein

  2. School of Computer Science, Tel-Aviv University, Israel

    Amos Fiat & Meital Levy

Authors
  1. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amos Fiat
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meital Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Boulevard François Mitterand,, 91025, Evry Cedex, France

    Evripidis Bampis

  2. Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften, Straße des 17. Juni 136, 10623, Berlin, Germany

    Martin Skutella

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, L., Fiat, A., Levy, M. (2009). Caching Content under Digital Rights Management. In: Bampis, E., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2008. Lecture Notes in Computer Science, vol 5426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93980-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-93980-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-93979-5

  • Online ISBN: 978-3-540-93980-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation