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

Access Restriction
Subscribed

 Author Rabin, Michael O. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1989 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract An Information Dispersal Algorithm (IDA) is developed that breaks a file $\textit{F}$ of length $\textit{L}$ = ↿ $\textit{F}↾$ into $\textit{n}$ pieces $\textit{Fi},$ l ≤ $\textit{i}$ ≤ $\textit{n},$ each of length $↿\textit{Fi}↾$ = $\textit{L}/\textit{m},$ so that every $\textit{m}$ pieces suffice for reconstructing $\textit{F}.$ Dispersal and reconstruction are computationally efficient. The sum of the lengths $↿\textit{F}i↾$ is $(\textit{n}/\textit{m})$ · $\textit{L}.$ Since $\textit{n}/\textit{m}$ can be chosen to be close to l, 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. For the latter problem provably time-efficient and highly fault-tolerant routing on the $\textit{n}-cube$ is achieved, using just constant size buffers. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1989-04-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 36 Issue Number 2 Page Count 14 Starting Page 335 Ending Page 348

#### Open content in new tab

Source: ACM Digital Library