Efficient dispersal of information for security, load balancing, and fault tolerance

@article{Rabin1989EfficientDO,
  title={Efficient dispersal of information for security, load balancing, and fault tolerance},
  author={Michael O. Rabin},
  journal={J. ACM},
  year={1989},
  volume={36},
  pages={335-348}
}
An Information Dispersal Algorithm (IDA) is developed that breaks a file <italic>F</italic> of length <italic>L</italic> = ↿ <italic>F</italic>↾ into <italic>n</italic> pieces <italic>F<subscrpt>i</subscrpt></italic>, l ≤ <italic>i</italic> ≤ <italic>n</italic>, each of length ↿<italic>F<subscrpt>i</subscrpt></italic>↾ = <italic>L</italic>/<italic>m</italic… CONTINUE READING

Topics

Statistics

050100'91'94'97'00'03'06'09'12'15'18
Citations per Year

1,535 Citations

Semantic Scholar estimates that this publication has 1,535 citations based on the available data.

See our FAQ for additional information.

  • Blog articles referencing this paper

  • Presentations referencing similar topics