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}
}
  • M. Rabin
  • Published 1 April 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… 
Fast computation using faulty hypercubes
TLDR
It is shown that with high probability, the faulty hypercube can emulate the fault-free hypercube with only constant slowdown and represent the first adaptive routing algorithms for which an effective theoretical analysis has been achieved.
The slide mechanism with applications in dynamic networks
TLDR
An end-to-end communication protocol with optimal amortized message communication complexity, a systematic mechanism to combine a dynamic algorithm with a static algorithm for the same problem, and a general method to efficiently and systematically combine dynamic and static algorithms.
Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
  • V. Pan
  • Computer Science
    ISSAC
  • 2000
TLDR
This work exploits various matrix structures to decrease the running time and memory space of the known practical deterministic schemes for erasure-resilient encoding/decoding and proposes faster algorithms.
On the Confidentiality of Information Dispersal Algorithms and Their Erasure Codes
TLDR
This paper presents an effective way to construct an IDA with strong confidentiality from an arbitrary non-systematic erasure code, the computation complexity of which is comparable to or sometimes even lower than that of Rabin's IDA.
Efficient program transformations for resilient parallel computation via randomization (preliminary version)
TLDR
This paper presents a transformation which can be applied to an ideal program such that the resulting program's execution on an asynchronous machine is work and space efficient, relative to the ideal program from which it is derived.
Computing with faulty arrays
We present and <italic>O</italic>(1) slowdown emulation of a fault-free <italic>N</italic> x <italic>N</italic> two dimensional mesh with a slack of <italic>O</italic>(log <italic>N</italic> log log
Fast fault-tolerant parallel communication for de Bruijn networks using information dispersal
  • Y. Lyuu
  • Computer Science
    Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing
  • 1991
TLDR
Space-efficient information dispersal algorithm (IDA) is applied to fault-tolerant parallel communication in the de Bruijn network and tolerates O(N) random link failures with probability at least 1-N/sup -ln/ /Sup ln/ /sup n/12/.
The information dispersal algorithm and its applications
TLDR
The Information Dispersal Algorithm (IDA) is presented, which breaks a file 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.
Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
  • Y. Lyuu
  • Computer Science
    Mathematical systems theory
  • 2005
TLDR
It is shown that a constant fraction of the wires can be disabled simultaneously without disrupting the ongoing computation or degrading the routing performance much, and this property suggests various on-line maintenance procedures.
Optimal information dispersal for reliable communication in computer networks
  • Hung-Min Sun, S. Shieh
  • Computer Science
    Proceedings of 1994 International Conference on Parallel and Distributed Systems
  • 1994
TLDR
Several interesting features of (m, n) IDSs are discovered which can help reduce the complexity for computing the highest communication reliability and a method for determining the optimal IDS is proposed.
...
...

References

SHOWING 1-10 OF 18 REFERENCES
How to share a secret
  • A. Shamir
  • Computer Science, Mathematics
    CACM
  • 1979
TLDR
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Pooling, Splitting, and Restituting Information to Overcome Total Failure of Some Channels of Communication
TLDR
This paper shows how to produce cheap high speed processes which come within a hair of being optimal (in the sense just described) solutions to the problem in question and describes parameter settings in which the problem cannot be solved satisfactorily by at leastsome approaches.
A Scheme for Fast Parallel Communication
TLDR
There is a distributed randomized algorithm that can route every packet to its destination without two packets passing down the same wire at any one time, and finishes within time $O(\log N)$ with overwhelming probability for all such routing requests.
Parallel Communication with Limited Buffers (Preliminary Version)
TLDR
This work presents and analyzes a new parallel communication scheme that ensures that at most a fixed number of packets reside at a given node at any time.
Algebraic coding theory
  • E. Berlekamp
  • Computer Science
    McGraw-Hill series in systems science
  • 1968
This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering
A Model of SIMD Machines and a Comparison of Various Interconnection Networks
  • H. J. Siegel
  • Computer Science
    IEEE Transactions on Computers
  • 1979
TLDR
A formal mathematical model of single instruction stream-multiple data stream (SIMD) machines is defined as a basis for analyzing various types of interconnection networks and the methods used to prove the lower bounds and to construct simulation algorithms to show the upper bounds can be generalized and applied to the analysis of other networks.
Probabilistic Algorithms in Finite Fields
  • M. Rabin
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1980
We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial, and factoring a polynomial into its
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
  • P. Raghavan
  • Computer Science, Mathematics
    27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
The cosmic cube
TLDR
This “Cosmic Cube” computer is a hardware simulation of a future VLSI implementation that will consist of single-chip nodes and offers high degrees of concurrency in applications and suggests that future machines with thousands of nodes are both feasible and attractive.
The connection machine
TLDR
The Connection Machine describes a fundamentally different kind of computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time.
...
...