Skip to main content

The Information Dispersal Algorithm and its Applications

  • Conference paper
Sequences

Abstract

We present the Information Dispersal Algorithm (IDA) which breaks a file F of length L = |F| into n pieces F i , 1 ≤ in, each of length |F i | = L/m, so that every m pieces suffice for reconstructing F. Dispersal and reconstruction are computationally efficient. The sum of lengths |F i | is (n/m) L. Since n/m can be chosen to be close to 1, the IDA is space efficient. IDA has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission of information in networks, and to communications between processors in parallel computers. Here we also give applications to the problem of data consistency and availability in distributed systems, and to a distributed pattern matching algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Asmuth, C.A., Blakley, G.R., “Pooling splitting and restituting information to overcome total failure of some channels of communication”, Proc. of the 1982 Symp. on Security and Privacy, IEEE Soc. (1982), pp. 156–169

    Google Scholar 

  2. Berlekamp, E.R., “Algebraic Coding Theory”. McGraw-Hill Pub. Co., New York (1968),

    Google Scholar 

  3. Gifford 79] Gifford, D.K., “Weighted voting for replicated data”, Prod, of ACM SIGOPS Symp. On Operating Systems Principles, (Pacific Grove Ca. 1979), pp, 150–179.

    Google Scholar 

  4. Karp, R.M., Rabin, M.O., “Efficient randomized pattern-matching algorithms”, IBM Jour, of Res. and Dev., vol. 31 (1987), pp. 249–260.

    Article  MathSciNet  MATH  Google Scholar 

  5. Mirsky, L., “An Introduction to Linear Algebra”. Dover Pub. Inc., New York (1982).

    MATH  Google Scholar 

  6. Rabin, M.O., “Fingerprinting by Random Polynomials”. TR-15-81. Center for Research in Computing Technology, Harvard University, Cambridge, Massachusetts, 1981.

    Google Scholar 

  7. Rabin, M.O., “Efficient dispersal of information for security, load balancing, and fault tolerance”, Jour, of the ACM, vol. 36, No. 2 (1989).

    MathSciNet  Google Scholar 

  8. Schuster, 88] Schuster, A., Private Communication.

    Google Scholar 

  9. Valiant, L.G., “A Scheme For Fast Parallel Communication”. SIAM F. Computing vol. 11: 2, (1982), pp. 350–361.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York Inc.

About this paper

Cite this paper

Rabin, M.O. (1990). The Information Dispersal Algorithm and its Applications. In: Capocelli, R.M. (eds) Sequences. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3352-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-3352-7_32

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7977-8

  • Online ISBN: 978-1-4612-3352-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics