IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-3352-7_32.html
   My bibliography  Save this book chapter

The Information Dispersal Algorithm and its Applications

In: Sequences

Author

Listed:
  • Michael O. Rabin

    (Harvard University, Aiken Computation Laboratory
    The Hebrew University, Institute of Mathematics and Computer Science)

Abstract

We present the Information Dispersal Algorithm (IDA) which breaks a file F of length L = |F| into n pieces F i , 1 ≤ i ≤ n, 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.

Suggested Citation

  • Michael O. Rabin, 1990. "The Information Dispersal Algorithm and its Applications," Springer Books, in: Renato M. Capocelli (ed.), Sequences, pages 406-419, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-3352-7_32
    DOI: 10.1007/978-1-4612-3352-7_32
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-3352-7_32. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.