DMCA
Efficient dispersal of information for security, load balancing, and fault tolerance (1989)
Cached
Download Links
- [discovery.csc.ncsu.edu]
- [web.engr.oregonstate.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of the ACM |
| Citations: | 551 - 1 self |
BibTeX
@ARTICLE{Rabin89efficientdispersal,
author = {Michael Rabin},
title = {Efficient dispersal of information for security, load balancing, and fault tolerance},
journal = {Journal of the ACM},
year = {1989},
volume = {36},
pages = {335--348}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. An Information Dispersal Algorithm (IDA) is developed that breaks a file F of length L = ( F ( into n pieces F,, 1 5 i 5 n, each of length ( F, 1 = L/m, so that every m pieces suffice for reconstructing F. Dispersal and reconstruction are computationally efficient. The sum of the lengths ( F, 1 is (n/m). L. Since n/m can be chosen to be close to I, the IDA is space eflicient. 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 communi-cations between processors in parallel computers. For the latter problem provably time-efftcient and highly fault-tolerant routing on the n-cube is achieved, using just constant size buffers. Categories and Subject Descriptors: E.4 [Coding and Information Theory]: nonsecret encoding schemes
Keyphrases
efficient dispersal fault tolerance load balancing information dispersal algorithm single disk computer network numerous application information theory reliable storage efficient transmission parallel computer constant size buffer piece suffice space eflicient latter problem subject descriptor
