|
Redundancy in a system of distributed information
The more redundant the information in a network,
the higher the probability to come close to it.
Redundancy optimizes the response time to requests object of frequent
and repeated calls (popular requests).
Redundancy makes it possible to secure data that, in RU3 model,
are only stored in the random-access memory (RAM) of the connected
machines.
Redundancy of parity data makes it possible to re-establish integrity
of distributed data during disconnection of part of the machines
making up the network.
The selected model is the model of algorithms used by the organizers
Raid 5 for secured hard discs.
Redundancy is only practiced on data that qualify the information
itself.
|
