By Topic

About one algorithm for keeping connectivity into a distributed data system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gichev, D.V. ; Bourgas Free Univ., Bulgaria ; Lazarov, A.D.

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.

Published in:

Digital Avionics Systems Conference, 2005. DASC 2005. The 24th  (Volume:2 )

Date of Conference:

30 Oct.-3 Nov. 2005