About one algorithm for keeping connectivity into a distributed data system

An algorithm that manages data distribution between different research and/or command centers is proposed. All the centers form a distributed data system that insists messages and data to be exchanged. Some of the centers may be directly linked to one or more external for the system of interest high-level organizations as well. Each center is considered as a node of a connected graph. Communication links between centers are interpreted as edges between the nodes. As a basic graph an n-dimensional hypercube is applied. An analysis of the situation when some of the links between nodes may be permanently or temporary destroyed has been performed. The algorithm proposed enables data distribution up to the "worst case scenario" when the system is only a connected graph. Dimensional collapse and data scattering technique is applied.