Data storage in unreliable multi-agent networks

The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is split and distributed across the network. The graph-based connectivity model assuming independent erasures is given, and the capacity of such graph is computed. It is shown by an information-theoretic argument that multi-agent systems with unreliable connectivity can increase overall data storage reliability through cooperation. Categories and Subject Descriptors C.2.1 [Computer Systems Organization]: Network Architecture and Design—wireless communication; C.2.4 [Computer Systems Organization]: Distributed Systems—network operating systems; I.2.11 [Artificial Intelligence]: Distributed Artificial Intelligence— multiagent systems General Terms Reliability, Performance, Design Keywords Distributed Coding, Erasure Graph, Partition Encoding

• Type: Conference
• Year: 2005
• Where: ATAL
• Authors: Filip Miletic, Patrick Dewilde
• Keywords: ATAL 2005, Computer Systems Organization, Devices Incur Loss, Distributed Data Storage