<!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>Simulation of computer network with switch and packet reservation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ilya Noskov</string-name>
          <email>noskovii@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vladimir Bogatyrev</string-name>
          <email>vladimir.bogatyrev@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivan Slastikhin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ITMO University</institution>
          ,
          <addr-line>Saint-Petersburg</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Simulation model of computer network based on switch Ethernet and redundant transfer is developed and researched. E ciency of this model using on con gurations with di erent redundancy ratio is dened. The aim of the work is the studying of the redundant transfer in computer networks. The e ciency analysis of the redundant packet transmissions is carried out on the basis of simulation modeling. The complex e ciency of the redundant packet transmission is determined based on the multiplicative index, which takes into account the errorfree transmission and the average time margin relative to the maximum permissible transmission delay. The presented results can be used in the design of the high-reliable computer systems including the computer systems providing real-time services. Recommendations for using the presented results are described in the assigned section of this paper and in the conclusion.</p>
      </abstract>
      <kwd-group>
        <kwd>Simulation modeling</kwd>
        <kwd>network switch</kwd>
        <kwd>computer networks</kwd>
        <kwd>channel aggregation</kwd>
        <kwd>redundant transfer</kwd>
        <kwd>OMNeT++</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Currently, there is important problem of increasing the reliability, fault tolerance,
security and performance of distributed computing systems and networks of
various application purposes, including those operating in real time under the
conditions of possible targeted destructive impact on the channel in order to
distort the transmitted data or prevent transmission at all [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1-5</xref>
        ].
      </p>
      <p>
        The reliability and fault tolerance assurance of networks [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] with the
reduced delays during load balancing is achieved when the communication
channels are reserved and aggregated, which is important for the real-time systems.
Using high-level protocols, which guaranteed delivery, such as the TCP protocol
(Transmission Control Protocol), is impossible, since the relevance of the
transmitted data is lost for a period of time during which the packet loss will be
higher, and the transfer process will be reinitiated.
      </p>
      <p>
        Using reservation at service of requests for sending packets is perspective
approach to solve the problem of timeliness of data delivery at the link channel.
This solution is modi cation of concept reducing delays of service in computer
systems with cluster architecture [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] based on dynamic redistribution and
redundant service of requests in di erent nodes of cluster. The e ectiveness of
improving the timeliness of transmissions based on redundancy in networks in
a client-server architecture without detailing of the choice of protocols and
network equipment is researched in paper.
      </p>
      <p>E ciency of redundant transmissions at peer-to-peer interconnection in
switching net-work is researched in this article.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The purpose of this work</title>
      <p>The purpose of this work is studying of improving of packets timely delivery
probability in the local computer networks based on the switched Ethernet at
reservation of network switches and creating copy of packets which will be send
for target node via di erent switch-es. The environment for modeling computer
networks OMNeT++ was chosen as a simulation package. This environment
provides the user with the ability to build networks based on the real network
protocols at all levels of the reference network model. To achieve this goal, it
is necessary to develop the computer network models in the OMNeT++
environment, conduct experiments with various options for the channel aggregation,
and highlight areas for the rational use of the computer network to improve the
e ciency of the computing system in the conditions of unreliable transmissions.
3</p>
    </sec>
    <sec id="sec-3">
      <title>The object and objectives of the study</title>
      <p>The object of the study is the distributed computer network which consists
of n network switches and m peer-to-peer clients connected to switches which
generate the data destined to each other at random times. Scheme of considered
computer networks and tra c directions are shown at Fig. 1.</p>
      <p>The probability of the bit errors in each of the communication channels of
this system is B. The data ow generated by each client is the simplest with
the intensity . To increase the probability of delivering messages to the server in
this system with the channel redundancy the transfer of the packet copy
transmissions with multiplicity K is applied, where K shows how many switches are
used to deliver the copies of the packet to the server from each client.
However, it should be worth considering that switches like other net-work equipment
have input and output queues and with increasing redundancy ratio in the
system increases the probability of delivery; however the size of queues in switches
also in-creases which entails the increase of the total frame stay time in the
system. Channel division between clients helps to realize ability of redundant
transfer. For ex-ample, if K = 2 then every client send own tra c via two
network switches, if K = 3 then client send via three network switches etc. In this
way, delivery probability is increasing. Criterion for evaluating the e ectiveness
of using one or another method of the redundant packet transmission, which is
the criterion M = P(t0 T), re ecting the average time of error-free and timely
transmitted packets from the client to the server, where P is the probability of
the timely and error-free package delivery, de ned by simulation, t0 is the time
limit for the timely delivery acceptable for a given system, T is the average time
the package has been in the system.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Developing simulation model</title>
      <p>The OMNeT++ simulation environment provides many di erent network
protocols and tra c generators using these protocols. In this work, the UDP protocol
(User Datagram Protocol) is used, as it is assumed to transmit the data
sensitive to the delay for controlling actions on the real-time system. OMNeT++
environment implements various types of generators and users of UDP tra c.
The UDPBasicApp application generates packets of a certain size with a given
intensity to the address speci ed in the con guration le. The UDPSink
application listens to the speci ed port and receives all packets that came to the socket
from the source. However the application data models do not assume the use of
the redundant transmission: the generator application sends only one packet to
a given communication channel, and the recipient application cannot recognize
copies of the same packet and receives them all, assuming that they are di erent
packets from the source. The OMNeT++ modeling system is writ-ten in the C
++ programming language and allows to modify the kernel of the system and
the developed models. To enable the development of the models with the
redundant transmissions, new application classes that extend existing ones have been
developed. This classes allow to send copies of packets via di erent channels for
redundant transmissions.</p>
      <p>The simulation model of the above system with three switches and six
peerto-peer clients was built after nalizing the components for modeling. This model
is based on the EtherSwitch switch model and the StandardHost model, which
represents the clients and server of the simulated system. Fig. 2 shows the
constructed model of the system under investigation in the OMNeT ++
environment. The developed model allows to set the parameters in the con guration
les and the initialization les of the modeling process for the study and study
of various options for the implementation of the transmission redundancy.</p>
      <p>Fig. 2: The simulation model of the network with the possibility of the redundant
transfers in the OMNeT ++ environment.</p>
      <p>All clients are divided into groups of two, for example Client 1 and Client 4,
Client 2 and Client 5 and so on. In every group all clients send and receive
tra c. In case of the redundant transmission every switch is used by more than
one client.</p>
      <p>We will conduct a series of experiments with speci ed parameters and varying
the redundancy ratio: L = 10 Mbit/s - bandwidth of the communication channels
connecting clients and the server to the switches, t0 = 0.0005 s - delivery time
margin, B = 0.0001 - bit probability channel errors, = 2000 1/s - the packet
receipt intensity, the packet length for the entire modeling process is assumed
to be 100 bytes.</p>
      <p>Fig. 3 shows the chart of the criterion M on the redundancy multiplicity
of trans-missions K at a packet arrival rate of 2000 1/s and 5000 1/s. It can
be seen from the chart that the selected performance criterion M takes large
values at lower intensity, which indicates small queue sizes in network switches.
At greater intensity and with an increase in the multiplicity of redundancy due
to the transmission of copies of the queue packets in the commutators they grow
which leads to an increase in the residence time of packets in the system and
reduces the value of the e ciency criterion. Thus, in this network con guration
packet trans-mission with less intensity is more e cient.
Simulation model of computer network based on switch Ethernet that allows
increasing transmission redundancy is developed via OMNet++ simulation
environment. Simulation experiment with di erent intensity and redundancy ratio
are carried out. Areas of applications of transfer redundancy at channel
aggregation in computer networks based on switch Ethernet are identi ed.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Sorin D. Fault</surname>
          </string-name>
          <article-title>Tolerant Computer Architecture</article-title>
          . Morgan &amp; Claypool
          <year>2009</year>
          .
          <volume>103</volume>
          p.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Dudin</surname>
            ,
            <given-names>A. N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <article-title>A multiserver MAP/PH/N system with controlled broadcasting by unreliable servers // Automatic Control</article-title>
          and
          <source>Computer Sciences</source>
          ,
          <year>2009</year>
          , No.
          <issue>5</issue>
          , pp.
          <fpage>32</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <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-2
          <fpage>16</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <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>
          / IEEE EUROCON.
          <string-name>
            <surname>Saint-Petersburg</surname>
          </string-name>
          ,
          <year>2009</year>
          . P.
          <year>1883</year>
          -
          <fpage>1887</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinokurova</surname>
            <given-names>M.S.</given-names>
          </string-name>
          <string-name>
            <surname>Control</surname>
          </string-name>
          and Safety of Operation of Duplicated Computer Systems // Communications in Computer and Information Science - 2017, Vol.
          <volume>700</volume>
          , pp.
          <fpage>331</fpage>
          -
          <lpage>342</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Arustamov</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogatyrev</surname>
            ,
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polyakov</surname>
            ,
            <given-names>V.I.</given-names>
          </string-name>
          <article-title>Back Up Data Transmission in Real-</article-title>
          <source>Time Duplicated Computer Systems // Advances in Intelligent Systems and Computing, IET2016</source>
          , Vol.
          <volume>451</volume>
          , pp.
          <fpage>103</fpage>
          -
          <lpage>109</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>