13 / 13
Отказоустойчивые компьютерные сети, построенные на основе комбинаторных блок-дизайнов
ISSN 0236-3933. Вестник МГТУ им. Н.Э. Баумана. Сер. Приборостроение. 2016. № 6
53
[3] Deza M.M., Loran M. Geometry of cuts and metrics. 1997, Springer-Verlag, Berlin, Heidelberg.
588 p. (Russ. ed.: Geometriya razrezov i metric. Moscow, MTsNMO Publ., 2001. 736 p.).
[4]
Stanley R.P. Enumerative combinatorics. Vol. 2. Cambridge University Press, 1999. 595 p.
(Russ. ed.: Perechislitel'naya kombinatorika. T. 2. Moscow, Mir Publ., 2009. 767 p.).
[5] Asanov M.O., Baranskiy V.Α., Rasin V.V. Diskretnaya matematika: grafy, matroidy, algo-
ritmy [The discrete mathematics: grahhs, matroids, algorithms]. Sankt-Petersburg, Lan' Publ.,
2010. 368 p. (in Russ.).
[6] Raygorodskiy A.M. Ekstremal'nye zadachi teorii grafov i analiz dannykh [Extremum prob-
lems of graphs theory and data analysis]. Moscow, RKhD Publ., 2009. 64 p. (in Russ.).
[7] Zvonkin A.K., Lando S.K
.
Grafy na poverkhnostyakh i ikh prilozheniya
[Graphs on surfac-
es and their appendices]. Moscow, MTsNMO Publ., 2010. 480 p. (in Russ.).
[8] Deza M., Grishukhin V., Shtogrin M. Scale-isometric polytopal graphs in hypercubes and
cubic lattices. Gardners Books, 2004. 188 p. (Russ. ed.: Izometricheskie poliedral'nye podgrafy
v giperkubakh i kubicheskikh reshetkakh. Moscow, MTsNMO Publ., 2008. 192 p.)
[9] Lando S.K. Vvedenie v diskretnuyu matematiku [Introduction in discrete mathematics].
Moscow, MTsNMO Publ., 2012. 265 p. (in Russ.).
[10] Andreev A.M., Berezkin D.V., Mozharov G.P., Svirin I.S. Mathematical simulation of
reliability of computer systems and networks.
Vestnik MGTU im. N.E. Baumana. Ser. Priboro-
stroenie. Spets. vyp. “Modelirovanie i identifikatsiya komp'yuternykh sistem i setey”
[Herald of
the Bauman Moscow State Technical University. Ser. Instrument Engineering. Spec. iss.
“Modeling and identification of computer system and links”], 2012, pp. 3–46 (in Russ.).
[11]
Foss S., Shneer S., Turlikov A. Stability of a Markov-modulated Markov chain, with
application to a wireless network governed by two protocols.
Stochastic Systems
, 2012, vol. 2,
no. 1, pp. 208–231. DOI: 10.1214/11-SSY030
[12]
Ziegler Gunter M. Projected Products of Polygons.
Electronic Research Announcements.
AMS
, 2004, vol. 10, pp. 122–134. DOI: 10.1090/S1079-6762-04-00137-4
[13]
Tsigler G.M. Teoriya mnogogrannikov [Polytopes theory]. Moscow, MTsNMO Publ.,
2014. 568 p. (in Russ.).
[14] Alon N., Spencer J.H. The probabilistic method. New York, A Wiley Interscience Publica-
tion, 2004. 328 p. (Russ. ed.: Veroyatnostnyy metod. Moscow, BINOM Publ., 2007. 320 p.).
Mozharov G.P.
— Cand. Sci. (Eng.), Assoc. Professor of Computer Systems and Networks
Department, Bauman Moscow State Technical University (2-ya Baumanskaya ul. 5, Moscow,
105005 Russian Federation).
Please cite this article in English as:
Mozharov G.P. Fault-Tolerant Computer Networks Constructed on the Basis of Combinatory
Block Designs.
Vestn. Mosk. Gos. Tekh. Univ. im. N.E. Baumana, Priborostr.
[Herald of the
Bauman Moscow State Tech. Univ., Instrum. Eng.], 2016, no. 6, pp. 41–53.
DOI: 10.18698/0236-3933-2016-6-41-53