Previous Page  12 / 13 Next Page
Information
Show Menu
Previous Page 12 / 13 Next Page
Page Background

Г.П. Можаров

52

ISSN 0236-3933. Вестник МГТУ им. Н.Э. Баумана. Сер. Приборостроение. 2016. № 6

Можаров Геннадий Петрович

— канд. техн. наук, доцент кафедры «Компьютерные

системы и сети» МГТУ им. Н.Э. Баумана (Российская Федерация, 105005, Москва, 2-я

Бауманская ул., д. 5).

Просьба ссылаться на эту статью следующим образом:

Можаров Г.П. Отказоустойчивые компьютерные сети, построенные на основе комбина-

торных блок-дизайнов // Вестник МГТУ им. Н.Э. Баумана. Сер. Приборостроение. 2016.

№ 6. C. 41–53. DOI: 10.18698/0236-3933-2016-6-41-53

FAULT-TOLERANT COMPUTER NETWORKS CONSTRUCTED

ON THE BASIS OF COMBINATORY BLOCK DESIGNS

G.P. Mozharov

mojarov_g@mail.ru

Bauman Moscow State Technical University, Moscow, Russian Federation

Abstract

Keywords

The paper presents a new class of computer systems and

networks consisting of homogeneous processors with local

memory and a high-speed communication network. We

carried out the topology analysis and synthesis of the given

class of computer and communication networks, using

combinatory objects with special properties: counterba-

lanced incomplete block designs (block-schemes). We give

a detailed description of a class of computer communica-

tion networks which are especially appropriate for practical

use — so-called Steiner triple system. These computer

systems and the networks are well-structured, have a high

fault tolerance, have a small average length of the way, the

minimum cost of communication and gradual degradation

of topology with the influence on the failure flow network.

Besides, they have a free parameter which makes it possible

to co-ordinate productivity and network cost. The topology

of such computer networks is optimum among cyclic sys-

tems, with regard to the average diameter, productivity,

fault tolerance and cost. Finally, we suggest a sufficiently

simple algorithm of routing providing the fault tolerance

work of a computer communication network with cyclic

topology

Сomputer system, communication

network, combinatory block designs,

fault tolerance, gradual degradation,

network bandwidth, routing algo-

rithm

REFERENCES

[1]

Tarannikov Yu.V.

Kombinatornye svoystva diskretnykh struktur i prilozheniya k

kriptologii [Combinatorial properties of discrete structures and application to cryptology

problems]. Moscow, MTsNMO Publ., 2011. 152 p. (in Russ.).

[2]

Andreev A.M., Mozharov G.P., Syuzev V.V. Mnogoprotsessornye vychislitel'nye sistemy:

teoreticheskiy analiz, matematicheskie modeli i primenenie

[Multiprocessing computing sys-

tems: theoretical analysis, mathematical models and application]. Moscow, Bauman MSTU

Publ., 2011. 334 p.