<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Simulating of Fault-Tolerant Gateway Based on VRRP Protocol in OMNeT++ Environment*</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>I. Noskov</string-name>
          <email>noskovii@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>imir A. Bog</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Saint-Petersburg National Research University of Information Technologies</institution>
          ,
          <addr-line>Mechanics and Optics, Kronverksky prospect, 49, Saint Petersburg, 197101, Russian Federation</addr-line>
        </aff>
      </contrib-group>
      <fpage>111</fpage>
      <lpage>120</lpage>
      <abstract>
        <p>Ways of improving the fault-tolerance of local computer network gateways using the Virtual Router Redundancy Protocol (VRRP) are considered. VRRP protocol is analyzed in the OMNeT++ simulation environment that has models of real communication channels and TCP/IP network protocols. The method of constructing computer network models with a fault-tolerant gateway based on the VRRP protocol in the OMNeT++ environment is proposed in the paper. The paper provides a description of all the main stages of creating and carrying out experiments with a computer network model. All windows of the simulation environment in which the model is parameterized and settings are considered in detail. The paper also describes the internal language of the OMNeT++ environment for the development of computer network models - NED. The process of creating scripts that allow simulating various events in the simulation process, such as the break of the communication channel between devices or the failure of the device is considered in detail. ANSA-INET is the OMNeT++ framework, which contains many modules and implementations of network protocols, including the FHRP family of protocols. This framework is used as the main framework for developing models in this paper. Capabilities of this framework are shown while simulating the VRRP protocol for creating a fault-tolerant gateway in the local area network.</p>
      </abstract>
      <kwd-group>
        <kwd>Simulating</kwd>
        <kwd>Fault-Tolerant Gateway</kwd>
        <kwd>Computer Networks</kwd>
        <kwd>VRRP</kwd>
        <kwd>OMNeT++</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        At present, the number of real-time systems with high requirements for functional and
structural reliability has significantly increased in conditions of destructive impacts on
the channel or active network equipment [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1-4</xref>
        ]. That is why reliability and
fault-tolerance researching of information and communication systems and networks is carrying
out nowadays [
        <xref ref-type="bibr" rid="ref5 ref6">5-6</xref>
        ]. The choice of design solutions for the construction of information
and communication systems is based on analytical or simulation modeling [
        <xref ref-type="bibr" rid="ref10 ref7 ref8 ref9">7-10</xref>
        ].
*
      </p>
      <p>Gateway is an important element for traffic forwarding in local area computer
networks because it links this network with others. Failure of this element can lead to the
inoperability of the entire subnet and the loss of large amounts of data. To ensure
gateway reliability in local computer networks, it is necessary to use device redundancy and
using specialized gateway protocols for developing a cluster of routers.</p>
      <p>
        For effective interaction of computer nodes of distributed systems, it is necessary to
build networks with a redundancy of elements of active network equipment, with the
support of multipath routing [
        <xref ref-type="bibr" rid="ref11 ref12 ref13 ref14">11-14</xref>
        ] with the possibility of choosing an alternative
route to the destination node for balancing traffic. The transport coding allows reducing
the average delays of messages in the network with the multipath coupling of nodes
[
        <xref ref-type="bibr" rid="ref15 ref16">15–16</xref>
        ]; the effect is achieved due to the coding that it is possible to recover the entire
message without repeating transmissions. In redundant real-time information and
communication systems, increasing the likelihood of timeliness and reducing the average
latency of servicing requests allows for redundant maintenance, which creates copies
of requests made by different nodes of the system or by different sequences of nodes
[
        <xref ref-type="bibr" rid="ref17 ref18 ref19">17-19</xref>
        ]. Redundant query service can be effectively applied in cluster architecture
systems and in multipath data transmission systems that are sensitive to delays.
      </p>
      <p>
        The aim of this work is building reliable fault-tolerant network solutions based on
the development of simulation models in the OMNeT++ environment, which allow
using real communication tools and network protocols to ensure the fault-tolerant of
gateways [
        <xref ref-type="bibr" rid="ref20 ref21 ref22 ref23 ref24">20-24</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Fault-tolerance of gateways</title>
      <p>The fault-tolerance of computer networks at the network level is ensured by the
reservation of active network equipment and/or communication channels, as well as the use
of specialized protocols. There are a whole family of First Hop Redundancy Protocols
(FHRP) protocols that allow building fault-tolerant computer networks with redundant
switching nodes. This is achieved by combining several routers into one virtual router
that responds to ARP requests and distributes traffic to currently active router from the
entire cluster. If the active router fails, another router from the group assumes its role,
and the traffic actually continues through the other router. Thus, in a computer network,
reliability, and probability of delivery of packages to the destination node increase.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Virtual Router Redundancy Protocol</title>
      <p>VRRP is a network protocol from the FHRP family designed to increase the availability
of routers acting as a default gateway. This is achieved by combining a group of routers
into one virtual router and assigning them a common IP address, which will be used as
the default gateway for computers on the network.</p>
      <p>At any time, only one of the physical routers performs traffic routing, that is, it
becomes the main VRRP router, the rest of the routers in the group become redundant. If
the main router becomes unavailable, then one of the backup ones assumes its role - the
one with the highest priority.
The basic concepts of the VRRP protocol are:
 VRRP Router — a router with running VRRP protocol. It can participate
in one or more virtual routers.
 Virtual Router (VR) — is an abstract object managed by VRRP protocol.</p>
      <p>Performs the role of the default router for computers in the network. A
virtual router is a group of router interfaces that are on the same network and
share a Virtual Router Identifier (VRID) and a virtual IP address.
 IP Address Owner — VRRP router that uses the IP address assigned to the
virtual router as the real IP address assigned to the interface.
 ADVERTISEMENT — messages that are sent by the Master-router.
 Virtual IP address — is the IP address assigned to the interface of one of
the routers that make up the Virtual Router. Also known as Primary IP
Address. VRRP adverts always use the virtual IP address as the sender's
address.
 VRRP Master router — is VRRP router that is responsible for sending
packets sent to an IP address that is associated with a virtual router and for
responding to ARP requests sent to this address. If the owner of the IP
address is available, then it always becomes the Master.
 VRRP Backup router — is a group of routers that are in standby mode and
are ready to take on the role of the VRRP Master router as soon as the
current VRRP Master router becomes unavailable.
 Virtual MAC address — is 0000: 5E00: 01xx, where xx is the number of
the VRRP group.</p>
      <p>VRRP is designed to increase the availability of routers that use as a default gateway
in the local area network.</p>
      <p>For a group of routers, they are configured to belong to a virtual router. In fact, a
virtual router is a group of router interfaces that are on the same network and share a
Virtual Router Identifier (VRID) and virtual IP address.</p>
      <p>A VRRP router can be in multiple virtual routers, each with a unique VRID/IP
address combination. The correspondences between the VRID and the IP address must be
the same on all routers on the same network.</p>
      <p>At any given time, only one of the physical routers performs traffic routing, that is,
it becomes a VRRP Master router, the rest of the routers in the group become a VRRP
Backup router. If the current VRRP Master router becomes unavailable, then one of the
VRRP Backup routers - the one with the highest priority - assumes its role. Setting
priority allows you to define more priority routers administratively.</p>
      <p>The backup router will not attempt to intercept the role of the master router unless it
has a higher priority than the current master router. VRRP allows administrative
blocking of the master-router role. The only exception to this rule is that the VRRP router
will always become the Master if it owns the IP address that is assigned to the virtual
router.</p>
      <p>In each virtual router, only the master sends periodic VRRP messages to the reserved
group address 224.0.0.18. At the data link layer, the virtual MAC address is used as the
MAC address of the sender of VRRP announcements.</p>
      <p>For researching of this protocol, it is necessary to develop models for the
simulationmodeling environment, which will allow a detailed review of the operation of the
protocol on various network configurations and topologies.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Develop a simulation model and carry out experiments</title>
      <p>The specialized environment for computer network simulating OMNeT++ was chosen
for creating and researching simulation models of computer networks with
fault-tolerant gateway because it is cross-platform, contains a large library of network
components and models of network protocols in different network layers, has a convenient
graphical interface and detailed English-language documentation.</p>
      <p>OMNeT++ simulating environment is a cross-platform specialized environment for
simulating computer networks for various purposes. This program is written in C++
language and allows modifying its modules in this language, as well as building models
using a graphical editor or a specialized model description language. The simulation
results are available to the user in the form of tracing events or data arrays, from which
you can automatically build informative graphs and charts. Since this environment is
an open-source environment, the user has access to many different libraries and
modules written by various developers and researchers. It has a great number of different
implementations of the vast majority of network protocols from the OSI stack. In
addition, it has components of the VRRP protocol based on router models that support this
protocol.</p>
      <p>The ANSA-INET library contains models of routers with the implementation of the
VRRP protocol for simulating computer networks with a fault-tolerant gateway. Fig. 1
shows the computer network model that was developed in the OMNeT++ environment:
The OMNeT++ simulation environment allows you to build computer network models
not only using a graphical user interface but also with using specialized NED language.
This language has a C-like language and allows us to create models without using a
graphical environment. This can be useful when we build large networks consisting of
a big amount of different nodes. Fig. 2 shows an example of a network configuration
that was built via this language.
In this model, H1 and H2 nodes are clients. Clients send network traffic to each other.
SW1 and SW2 - switches. These switches connect subnets of H1 and H2 clients. R1,
R2, and R3 routers are a group of routers that have VRRP protocol to provide
faulttolerance to the H1 client's subnet gateway. For working with the VRRP protocol, the
ANSA-INET framework provides a special type of the ANSA_VRRP_Router router.
In the model of this router, we can configure this protocol. The configuration of a
cluster of routers with VRRP protocols provides via using a special configuration file,
which is provided by the ANSA-INET library. Fig. 3 shows a fragment of the router's
configuration.
The configuration is an XML file that contains the settings of each of the interfaces of
the router. In this configuration, we can set their system name, address, description, and
other service information. Also in this file, we specify the VRRP settings for the correct
operation of the protocol: the virtual IP address of the fault-tolerant router, its id, and
description.</p>
      <p>The UDP traffic generator is configured for the H1 client node. This generator
creates a load flow towards the H2 client node. The UDPSink application is configured at
the H2 node. This application receives the traffic flow with the specified address and
destination port. In Fig. 4, we can see a fragment of the configuration of client
applications.
Also in this file, we set different parameters of routers using the path to the XML
configuration file and id of routers.</p>
      <p>OMNeT++ simulation environment allows you to write scripts that can influence the
model process and simulate various events in the system. A script has been developed
for researching fault-tolerance in our computer network. This script simulates the break
of the communication channel between the SW1 switch and the R3 router. In Fig. 5,
we can see a fragment of developed in the OMNeT++ environment script.
Fig. 6 shows that the traffic from the client H1 goes through the router R3. At each
moment only one of the three routers sending traffic - the rest are in standby mode. The
script simulates the break of the communication channel between the SW1 switch and
the active router R3. Fig. 7 shows the simulation process after the break of the
communication link.</p>
      <p>Traffic from the H1 node is going through an R2 router since the R3 router is
unavailable for H1 client. The VRRP algorithm allows us to change active router and traffic
from H1 client is sent via the R2 router. Thus, the computer network has the
faulttolerant gateway that allows sending traffic after break communication links and/or
network equipment.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>A computer network model has been developed with a fault-tolerant gateway based on
the VRRP protocol. The process of creating and researching computer network models
in the OMNeT++ environment is described in the paper. This approach allows building
computer network models using real communication tools and computer network
protocols of the TCP/IP stack. The algorithm of the VRRP protocol for implementing
faulttolerant gateway in the local area network is described and modeled in detail. The
results obtained in this article may be useful to network engineers and designers when
building computer networks with a fault-tolerant gateway.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Sorin D. Fault</surname>
          </string-name>
          <article-title>Tolerant Computer Architecture</article-title>
          . Morgan &amp; Claypool
          <year>2009</year>
          . p.
          <fpage>103</fpage>
          . DOI:
          <volume>10</volume>
          .2200/S00192ED1V01Y200904CAC005
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Coolen</surname>
            ,
            <given-names>F.P.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Utkin</surname>
          </string-name>
          , LV.:
          <article-title>Robust weighted SVR-based software reliability growth model</article-title>
          .
          <source>Reliability Engineering &amp; System Safety</source>
          <volume>176</volume>
          ,
          <fpage>93</fpage>
          -
          <lpage>101</lpage>
          (
          <year>2018</year>
          ), DOI: 10.1016/j.ress.
          <year>2018</year>
          .
          <volume>04</volume>
          .007.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Kopetz</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Real-Time</surname>
            <given-names>Systems</given-names>
          </string-name>
          :
          <article-title>Design Principles for Distributed Embedded Applications</article-title>
          . Springer, pp.
          <fpage>396</fpage>
          ,
          <year>2011</year>
          . DOI 10.1007/978-1-
          <fpage>4419</fpage>
          -8237-7.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Poymanova</surname>
            ,
            <given-names>E.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tatarnikova</surname>
            ,
            <given-names>T.M.</given-names>
          </string-name>
          <string-name>
            <surname>Models</surname>
          </string-name>
          and
          <article-title>Methods for Studying Network Traffic 2018 Wave Electronics and its Application in In-formation and Telecommunication Systems,</article-title>
          (WECONF)
          <fpage>26</fpage>
          -
          <lpage>30</lpage>
          Nov.
          <year>2018</year>
          . DOI:
          <volume>10</volume>
          .1109/WECONF.
          <year>2018</year>
          .8604470
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Aliev</surname>
            <given-names>T.I.</given-names>
          </string-name>
          <article-title>The synthesis of service discipline in systems with limits // Communications in Computer</article-title>
          and Information Science.
          <year>2016</year>
          . V. 601. P.
          <volume>151</volume>
          -
          <fpage>156</fpage>
          . DOI:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -30843-216.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kutuzov</surname>
            <given-names>O.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tatarnikova</surname>
            <given-names>T.M.</given-names>
          </string-name>
          <article-title>On the Acceleration of Simulation Modeling</article-title>
          .
          <source>XXI International Conference on Soft Computing and Measurements</source>
          (SCM'
          <year>2018</year>
          )
          <fpage>23</fpage>
          -
          <lpage>25</lpage>
          May 2018
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Gatchin</surname>
            <given-names>Y. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zharinov</surname>
            <given-names>I. O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Korobeynikov</surname>
            <given-names>A. G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zharinov</surname>
            <given-names>O. O.</given-names>
          </string-name>
          <article-title>Theoretical estimation of Grassmann's transformation resolution in avionics color-coding systems</article-title>
          //Modern Applied Science.
          <year>2015</year>
          . Vol.
          <volume>9</volume>
          ,
          <string-name>
            <given-names>N</given-names>
            <surname>5</surname>
          </string-name>
          . P.
          <volume>197</volume>
          -
          <fpage>210</fpage>
          . ISSN 1913-1844
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Tatarnikova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kolbanev</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Statement of a Task Corporate Information Networks Interface Centers Structural Synthesis</article-title>
          .
          <source>In IEEE EUROCON. Saint Petersburg</source>
          , pp.
          <fpage>1883</fpage>
          -
          <lpage>1887</lpage>
          (
          <year>2009</year>
          ). DOI:
          <volume>10</volume>
          .1109/EURCON.
          <year>2009</year>
          .
          <volume>5167903</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Kleinrock</surname>
            ,
            <given-names>L. Queueing</given-names>
          </string-name>
          <string-name>
            <surname>Systems: Volume I - Theory</surname>
          </string-name>
          . New York: Wiley Interscience.
          <year>1975</year>
          p.
          <fpage>417</fpage>
          . DOI:
          <volume>10</volume>
          .3103/S0146411615010022
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kleinrock</surname>
            ,
            <given-names>L. Queueing</given-names>
          </string-name>
          <string-name>
            <surname>Systems: Volume II - Computer Applications</surname>
          </string-name>
          . New York: Wiley Interscience.
          <year>1976</year>
          p.
          <fpage>576</fpage>
          . DOI:
          <volume>10</volume>
          .1002/net.3230070308
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Anders</surname>
            <given-names>Gunnar &amp; Mikael</given-names>
          </string-name>
          <string-name>
            <surname>Johansson</surname>
          </string-name>
          .
          <article-title>Robust load balancing under traffic uncertainty - tractable models</article-title>
          and efficient algorithms // Telecommun Syst. (
          <year>2011</year>
          )
          <volume>48</volume>
          :
          <fpage>93</fpage>
          -
          <lpage>107</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Merindol P. Improving Load Balancing with Multipath Routing</surname>
            / P. Merindol,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Pansiot</surname>
          </string-name>
          , S. Cateloin //
          <source>Proc. of the 17-th International Conference on Computer Communications and Networks</source>
          ,
          <string-name>
            <surname>IEEE ICCCN</surname>
          </string-name>
          <year>2008</year>
          .
          <article-title>-</article-title>
          2008. - P.
          <fpage>54</fpage>
          -
          <lpage>61</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ICCCN.
          <year>2008</year>
          .ECP.
          <volume>30</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Rajeev</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muthukrishnan</surname>
            <given-names>C.R.</given-names>
          </string-name>
          <article-title>Reliable backup routing in fault tolerant real-time networks</article-title>
          .
          <source>Proceedings. Ninth IEEE International Conference on Networks</source>
          ,
          <string-name>
            <surname>ICON</surname>
          </string-name>
          <year>2001</year>
          . DOI:
          <volume>10</volume>
          .1109/ICON.
          <year>2001</year>
          .
          <volume>962338</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Banner</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orda</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <article-title>Multipath Routing Algorithms for Congestion Minimization</article-title>
          ,
          <source>CCIT Report No. 429</source>
          , Department of Electrical Engineering, Technion, Haifa, Israel,
          <year>2004</year>
          . URL: http://www.ee.technion.ac.il/people/ron/Congestion.pdf
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Krouk</surname>
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semenov</surname>
            <given-names>S.</given-names>
          </string-name>
          <article-title>Application of Coding at the Network Transport Level to Decrease the Message Delay //</article-title>
          <source>Proc. of 3rd Intern. Symp. on Communication Systems Networks and Digital Signal Processing</source>
          . Staffordshire University, UK,
          <year>2002</year>
          . P.
          <volume>109</volume>
          -
          <fpage>112</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kabatiansky</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krouk</surname>
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semenov</surname>
            <given-names>S. Error</given-names>
          </string-name>
          <article-title>Correcting Coding and Security for Data Networks. Analysis of the Superchannel Concept</article-title>
          . Wiley,
          <year>2005</year>
          . 288 р
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>A.V.</given-names>
          </string-name>
          <string-name>
            <surname>Functional</surname>
          </string-name>
          <article-title>Reliability of a Real-Time Redundant Computational Process in Cluster Architecture Systems //Automatic Control</article-title>
          and
          <source>Computer Sciences, - 2015</source>
          , Vol.
          <volume>49</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>46</fpage>
          -
          <lpage>56</lpage>
          . DOI:
          <volume>10</volume>
          .3103/S0146411615010022
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>A.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>S.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>V.A.</given-names>
          </string-name>
          <article-title>Analysis of the Timeliness of Redundant Service in the System of the Parallel-Series Connection of Nodes with Unlimited Queues // 2018 Wave Electronics and its Application in Information and Telecommunication Systems</article-title>
          (WECONF)
          <article-title>- 2018</article-title>
          , DOI: 10.1109/WECONF.
          <year>2018</year>
          .8604379
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>V.A. Increasing</given-names>
          </string-name>
          <article-title>the fault tolerance of a multi-trunk channel by means of inter-trunk packet forwarding (1999) Automatic Control</article-title>
          and
          <source>Computer Sciences</source>
          ,
          <volume>33</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>70</fpage>
          -
          <lpage>76</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Noskov</surname>
            <given-names>I.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Slastikhin</surname>
            <given-names>I.A.</given-names>
          </string-name>
          <article-title>Simulation of computer network with switch</article-title>
          and packet reservation // CEUR Workshop Proceedings - 2019, Vol.
          <volume>2344</volume>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Slastikhin</surname>
            <given-names>I.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noskov</surname>
            <given-names>I.I.</given-names>
          </string-name>
          <article-title>The simulation model of the system with aggregated channels and redundant transmissions on the multiple access level /</article-title>
          / CEUR Workshop Proceedings - 2019, Vol.
          <volume>2344</volume>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Slastikhin</surname>
            <given-names>I.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>V.A.</given-names>
          </string-name>
          <string-name>
            <surname>Redundant</surname>
          </string-name>
          <article-title>Priority Maintenance in the Multi-Channel Systems // 2018 Wave Electronics and its Application in Information and Telecommunication Systems</article-title>
          (WECONF)
          <article-title>-</article-title>
          2018, pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          . DOI:
          <volume>10</volume>
          .1109/WECONF.
          <year>2018</year>
          .8604301
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. VESELÝ Vladimír, ŠVÉDA Miroslav. L2 protocols in OMNeT++ // IP Networking 1
          <article-title>- Theory and Practice</article-title>
          . Žilina: Zilina University Publisher,
          <year>2012</year>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>40</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. VESELÝ Vladimír, RYŠAVÝ Ondřej, ŠVÉDA Miroslav. Protocol Independent Multicast in OMNeT++ // The International Academy, Research and Industry Association,
          <year>2014</year>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>