Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs

  • Authors:
  • P. P. Parkhomenko

  • Affiliations:
  • Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Organization of an efficient self-diagnosis of the multicomponent computer and communication systems of diverse structures always attracted attention of the researchers and engineers. A method to solve these problems is presented in the paper by way of the example of a system whose structure is modeled by a uniform ordinary bipartite graph of diameter d = 3, any degree s 1, and any number n of vertices, where n = s(s − 1) + 1. The method requires checking of (s − 1)3 graph loops of length eight each, which is smaller than the number s 2(s − 1) + s of checks of single graph edges.