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={M. Rabin},
  journal={J. ACM},
  year={1989},
  volume={36},
  pages={335-348}
}
  • M. Rabin
  • Published 1989
  • Computer Science
  • J. ACM
  • 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>, so that every <italic>m</italic> pieces suffice for reconstructing <italic>F</italic>. Dispersal and reconstruction are computationally… CONTINUE READING

    Paper Mentions