<!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>Adaptive VPN Bonding Technique for Enhancing Dual-SIM Mobile Internet Access</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Francesco Beritelli , Aurelio La Corte</institution>
          ,
          <addr-line>Grazia Lo Sciuto</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <fpage>23</fpage>
      <lpage>25</lpage>
      <abstract>
        <p>-Mobile Internet access networks are not designed to support real-time data traffic because of several drawbacks concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc., which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to the quality of user experience. While in a fixed network scenario the gap is reduced arbitrarily by an appropriate dimensioning of the characteristics of ADSL access in terms of guaranteed minimum bandwidth or MCR (minimum cell rate), in a cellular network scenario the quality of service over IP is greatly reduced due to strong current limitations in terms of the requirements regarding delay and guaranteed bandwidth that cannot be arbitrarily decided. The main scope of the present paper is to introduce a dual USIM HSPA access point thanks to which it will be possible to guarantee a QoS suitable for a series of network-centric application such as real-time communications and monitoring, video surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The main idea is to exploit multiple radio access networks in order to enhance the available end-to-end bandwidth and the perceived quality of experience. The scope has been reached by combining multiple radio access with dynamic load balancing and the VPN bond technique.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>
        The rapid and continuous consolidation of Mobile
Internet access request together with the significant increase of
mobile services provided by third and fourth generation (3G,
HSPA, LTE) networks, have recently created the conditions
for a considerable expansion of mobile IP applications and
services. Mobile IP networks are not designed to support
realtime and/or time-critical traffic because of several drawbacks
concerning the wireless medium [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]: resource sharing, traffic
congestion, radio link coverage etc., which impact directly
such parameters as delay, jitter, and packet losses. These are
the main causes of quality degradation of numerous services
over the PSTN. In recent works the authors have introduced
a dual streaming (or packet duplication) approach to mitigate
the degradation of speech quality [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] in a scenario of dual-SIM
VoIP services over 3G-HSPA [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>In the present paper, the authors propose a multiple SIM
Access Point exploiting VPNs bond of two cellular radio
access connections coupled with an adaptive load balancing
algorithm based on real time evaluation of the available
endto-end bandwidth offered by two different network operators.</p>
      <p>The authors propose a trivial prototype in order to evaluate
the effectiveness of the proposed solution in terms of the
enhancement of both the instantaneous available bandwidth
and connection availability between the mobile access point
Copyright c 2016 held by the authors.
and a remote command and control and/or monitoring node. As
to the costs/benefits balance, the proposed method on the one
hand requires a dual RF module, but on the other hand it is also
true that nowadays HSPA or LTE modems have become very
cheap and common and there are a lot of free and open source
operative systems allowing the implementation of advanced
networking functions such as load balancing techniques, VPN
creation and bonding, network performance evaluation and so
on.</p>
      <p>The paper is structured as follows: Section II describes
the possible applications and contexts where the proposed
approach can offer considerable benefits in terms of reliability
and efficiency and gives an overview on the overall system;
Section III presents the end-to-end bandwidth measurement
algorithm and the adaptive weight assignment procedure; Section
IV reports the performance results of a real test bed; finally,
in Section V conclusions are drawn.</p>
    </sec>
    <sec id="sec-2">
      <title>II. SCENARIO</title>
      <p>Wireless sensor networks and internet of things have
become very commonly used technologies enabling a large
number of applications and services in everyday life. Usually the
architecture of the above cited networks is based on a certain
number of sensors and devices that communicate among them
and towards a critical device called sink that has the scope
of collecting data from the devices for monitoring, control,
statistics, etc. Often the sink is designed to communicate via
Internet to a remote command and control position where a
user can operate over the network. With this scope, the sink
provides the functionality of gateway with the external IP
world. Regarding this aspect, the gateway is equipped with
Ethernet, wifi, or 3G/4G interfaces in order to communicate
with the IP world according to the applicative scenario for
which the ad hoc network has been conceived. In particular,
when the sensor network or the IoT network are deployed for
command and/or control, monitoring, surveillance or similar
use in mobile or vehicular contexts and a fixed wide area
network connection is not available, it is mandatory to provide
a stable, reliable and effective wireless connection towards
the remote server in order to guarantee the required QoS
for time-critical and real time applications (see e.g. highly
computationally costly applications [5]–[12], or distributed
services [13]).</p>
      <p>With this aim the authors propose a Dual SIM 3G/4G
wireless access point that acts as the sink for the sensor
network and, at the same time, acts as gateway towards the IP
core network. To guarantee QoS for time critical and real time
applications, the proposed device offers two main features:
F  ig. 1. Scenario overview.</p>
      <p>1)
2)
a VPN bonding between the two radio access
connections, thanks to which it is possible to obtain
a bandwidth almost equal to the sum of the two
available end-to-end bandwidths;
a dynamic load balancing algorithm, which is a
process that establishes the weights the device gives
to the two different radio connections during the
movement of the mobile sink/gateway on the base
of the instantaneous available end-to-end bandwidth
offered by the two different network operators.</p>
      <p>It has been observed that in this first phase of the present
research the weights are established in order to maximize the
cumulative bandwidth but as a future work the authors will
implement a more complex algorithm able to dynamically
calculate the VPN weights based on the traffic typology (voice,
file transfer, best effort, etc.) and the related parameters that
directly impact on the quality of experience of the end user
willing to use the service.</p>
      <p>III.</p>
    </sec>
    <sec id="sec-3">
      <title>ARCHITECTURE AT A GLANCE</title>
      <p>The smart gateway proposed by the authors is based on
a well-known technique called VPNs bond, usually employed
in the Ethernet switch and extended to the cellular domain
to counteract some drawbacks connected to the radio access
technology. Due to the application of VPNs bond it is possible
to balance the data load among the available network interfaces
but, for the sake of clarity, it should be highlighted that this
technique is much more flexible if compared to the common
load balancing algorithms; in fact, the latter permit to split
the data connection between the source and the destination by
using the available connections and according to the weights
assigned to each interface. In such a way, the effectiveness of
the mechanism is obtained only when there are more than one
end-to-end connection between the sender and the receiver.</p>
      <p>In case there is only a data flow towards the remote server,
load balancing permits to assign the data stream to one of the</p>
      <p>F  ig. 2. VPNs bond architecture.
two connections and the perceived end-to-end bandwidth is
equal to the one offered by the best network operator. Instead,
the use of the VPNs bond technique permits to enhance the
available end-to-end bandwidth also in the case of only one
data flow from the source node, i.e. the gateway of the ad hoc
network, and the destination, i.e. the remote command and
control position.</p>
      <p>The VPNs bonding consists in unifying two or more layer
2 connections in order to be able to assign to one data flow a
bandwidth ideally equal to the sum of the bandwidth offered
by single L2 connections. This technique is well known and
widely employed in the field of Ethernet switches where it is
possible to unify two or more L2 interfaces to guarantee a
larger point-to-point bandwidth in the core network.</p>
      <p>In the present use case, the procedure consists in the
creation of a VPN between each 3G/4G interface and the
end point of the communication, i.e. the remote server. Once
established the two VPNs it is possible to make the bonding
of the latter in order to establish a large bandwidth connection
between source and destination nodes (see fig. 2). Usually the
VPNs bond technique is coupled with a trivial load balancing
algorithm that consists in assigning static and equal weights
to each L2 connection.</p>
      <p>In case of L2 switches or DSL modem/routers this
approach represents a good solution because the network
conditions are similar for each interface and they remain almost
constant in time. Let us suppose that the two available
connections provide a bandwidth equal to 2 Mbps; in such a case
a trivial load balancer will assign weights equal to 1 to each
connection and the system will provide a bandwidth equal to
4 Mbps.</p>
      <p>Now, supposing that at a time t the connection number 1
provides a bandwidth equal to 2 Mbps whereas the connection
number 2 offers a bandwidth equal to 1 Mbps. Under this
condition, if the load balancing algorithm maintains constant
weights, by using a simple round robin mechanism, the
connection 2 will represent a bottleneck for the system because
the overall available end-to-end bandwidth will not be equal
to the sum of the two bandwidths but it will be equal to twice
that of the worst connection.</p>
      <p>In a wireless scenario characterized by the high variability
F  ig. 3. The prototype employed for our test bed.
of radio coverage, different traffic conditions, handover
procedures, and mobility, each radio interface equipped with the
related SIM - performs according to the infrastructure and the
load conditions set by its operator. Under these conditions, a
static weights assignment would result in a drastic reduction
in performance where the worst connection would act as a
bottleneck for the whole system. With the aim of overcoming
this limit, the authors propose a mechanism of real time
bandwidth evaluation to establish each time and for each L2
connection the weights to assign to the VPNs bond, thus
maximizing the transmission rate towards the destination node.</p>
      <p>In the next sections the adaptive load balancing algorithm
will be described and the first performance evaluation of a
trivial prototype will be presented.</p>
      <p>A. Description of the prototype</p>
      <p>
        To prove the effectiveness of our proposal we realized
a prototype by using a small form factor system boards
optimized for wireless routing and network applications,
an ALIX2D2 board [
        <xref ref-type="bibr" rid="ref13">14</xref>
        ], equipped with a 500 MHz AMD
Geode LX800 CPU and 256 MB DDR DRAM on board;
two USB Internet keys have been used to provide cellular
connectivity and the two devices have been equipped with
two SIMs of two different network operators, that we will
define as Operator 1 and Operator 2 in the following sections;
ZeroShell [
        <xref ref-type="bibr" rid="ref14">15</xref>
        ] and OpenVPN [
        <xref ref-type="bibr" rid="ref15">16</xref>
        ] has been used as operative
system and VPN manager respectively, whereas proprietary
scripts has been realized by using bash and python language
to evaluate the available end-to-end bandwidth between the
couples source-destination and, consequently, to establish the
weights to assign to each VPN in order to maximize the
overall performance of the prototype.
      </p>
      <p>For the aim of clarity, the same hardware and software
have been employed to evaluate the performance of the
standard static weights assignment procedure without using,
obviously, the scripts for the dynamic evaluation of the VPN
weights. A picture of the hardware employed to realize our
prototype is shown in fig. 3.</p>
      <p>F  ig. 4. One way delay values of the ith packet train in the SLoPS technique</p>
    </sec>
    <sec id="sec-4">
      <title>ADAPTIVE WEIGTH ASSIGNEMENT The proposed algorithm can be summarized in three steps: 1) 2)</title>
      <p>3)</p>
      <p>Bandwidth measuremet for each available radio data
connection;
Results analysis and weight evaluation to establish
and set up the VPN bond parameters;
Periodic performance evaluation to determinate the
most suitable weight for each mobile connection.</p>
      <p>
        As to the first step, i.e. the end-to-end bandwidth
evaluation, it is carried out via the Self Loading of Periodic Streams
(SloPS) technique [
        <xref ref-type="bibr" rid="ref16">17</xref>
        ]–[19]. The latter is based on a
clientserver application: the sender process runs on the multi-SIM
access point whereas the receiver process runs on a remote
host, which, in the present architecture, is the remote gathering
node of the sensor data network.
      </p>
      <p>The above mentioned architecture is suitable in case the
mobile hot spot has to send data towards a remote sink
collecting sensor data; however, if the time-critical application
is based on the transmission from the remote host to the mobile
network the upload bandwith will be taken into consideration.</p>
      <p>The working principle of the Self Loading of Periodic
Streams is very simple: it is based on the periodic transmission
of packet streams from the source to the destination and on the
consequent measure of the One Way Delay (OWD), which is
the time interval between the transmission of the data packet
and its reception at the receiver side.</p>
      <p>The number of packets transmitted increases until the
growing one way delay; when this happens it means that the
packet transmission rate is greater than the available bandwidth
provided by the radio access network. Fig. 4 shows the
above mentioned procedure: when the transmission rate (R) is
compatible with the available bandwidth (A), i.e. R &lt; A, the
one way delay shows an almost constant trend; however, when
the packet rate from the source to the destination is greater
than the available bandwidth, i.e. R &gt; A, the one way delay
increases because of the TCP congestion window mechanism.</p>
      <p>The measurement is obtained by the iterative sending of
a series of K packets of L bit each of which is transmitted
during an interval of T seconds. In such a way the transmission
Fig. 5. C ountryside route of the test bed.
rate is equal to R = L=T [bit=s]. Each packet of the series
has a timestamp to indicate when the data packet has been
created and sent to the receiver node. Once the destination node
receives the packets stream it compares the arrival time (Ai)
and the sending time (Si) of the packets in order to calculate
the one way delay of the ith stream, i.e. Di = AiSi.</p>
      <p>The sender and the receiver communicate according to
the client-server paradigm in order to establish the available
bandwidth. When the one way delay at the destination side
increases, in fact, the receiver process notifies the sender that
behaves as follows:</p>
      <p>If R(i) &lt; A, the source process will send the
following packets stream at R(i + 1) &gt; R(i);
If R(i) &gt; A, the source process will send the
following packets stream at R(i + 1) &lt; R(i);
Furthermore, the rate of the stream (i + 1) is established as
follows [10]:</p>
      <p>Two start parameters, Rmin ed Rmax, are
initialized equal to zero and equal to the ideal maximum
throughput provided by the connection Rmax;
o
o</p>
      <p>If R(i) &lt; A then Rmin = R(i);</p>
      <p>If R(i) &gt; A then Rmax = R(i);
a
b
1)
2)</p>
      <p>R(i + 1) = (Rmax</p>
      <p>Rmin)=2;
3)
a
b</p>
      <p>The iterative process ends when (Rmax Rmin) &lt; w,
where w indicates the value depending on the
precision of the bandwidth evaluation procedure
(obviously, the greater the w the less accurate evaluation
but, at the same time, the faster the convergence
period required by the algorithm).</p>
      <p>The above mentioned algorithm runs for each radio access
connection and converges to the actually available end-to-end
bandwidth. When the process ends, the bandwidth values are
communicated to the adaptive load balancing process that
updates the VPNs bond weights as follows:
the VPN weight of the worst connection is set equal
to 1;
the VPN weight of the best connection is set equal
to Abetter=Aworst;
in case the bandwidth offered by one of the two operators is
equal to 0, e.g. because of a lack of radio coverage, the whole
traffic is routed to the active connection.</p>
    </sec>
    <sec id="sec-5">
      <title>V. PERFORMANCE EVALUATION</title>
      <p>In the above sections some problems have been illustrated
that arise when a mobile wireless sensor networks have to be
connected to a remote command and control server by using
the public 3G or 4G radio network.</p>
      <p>In order to overcome such drawbacks as connection
interruption, lack of bandwidth, delay in performance, jitter and
F  ig. 6. Throughput comparison Single operators and static bond.</p>
      <sec id="sec-5-1">
        <title>F  ig. 8. Static scheme vs. Adaptive scheme.</title>
        <p>F  ig. 7. Throughput comparison Single operators and adaptive bond.
packet loss rate not compatible with time critical applications,
a smart dual SIM sink/gateway based on multiple radio
access, VPN bonding and adaptive load balancing between the
available connections is proposed.</p>
        <p>The present section will prove the effectiveness of the
proposed solution showing the results obtained during our test
bed. We performed two campaigns of simulation, the first has
been realized in a countryside scenario as shown in fig. 5,
the second has been realized by moving the prototype in an
urban scenario as shown in fig. 10; for each test bed 15 data
transfers from the mobile sink/gateway to the remote C2 have
been performed; during the test bed it has been evaluated:
the throughput for each cellular operator;
the throughput obtained by using the dual SIMs
VPNs bonding with static weights assignment;
the throughput obtained by using the bond of the two
VPNs coupled with the adaptive weights assignment
and load balancing.</p>
        <p>In fig. 6 and fig. 7, referring to the static and the adaptive
weights assignment respectively in the extra-urban scenario, it
is possible to notice that two different conditions appear: in the
first part of the test bed the two network operators have similar
performances in terms of available end-to-end bandwidth; in
the second part the Operator 2 performs better that the Operator
1.</p>
        <p>When the first case appears both static and adaptive
bonding perform well outperforming the performance of the
two single operators; static and adaptive approaches show
almost the same behavior. When the second case appears, the
performance of the static bonding mechanism is drastically
worse than the proposed adaptive approach and, furthermore,
the VPNs bonding provides an end-to-end bandwidth lower
than the one offered by the best single network operator, in
such a case the Operator 2.</p>
        <p>More in detail, during the sink movement the network
operator 2 delivers better performance respect with the network
operator 1. In such a case, the VPNs bond and the static load
balancing algorithm does not perform as expected and the
dual SIM gateway behaves similarly to the worst of the two
network operators (the throughput should be double the worst
connection but the overhead due to the establishment of the two
VPNs, i.e. the overhead related to the establishment of SSH
tunnel among the two radio network interfaces and the remote
server, drastically reduces the effective available bandwidth.);
in fact, the load balancing algorithm splits into two equal flows
the original one, assigning to each connection the amount of
data to transmit equal to the available bandwidth offered by
the worst operator, the latter representing, the bottleneck of the
system. In such a case, the VPN bond coupled with the static
load balancing does not offer any performance enhancement
because of the incorrect assignment of bond weights.</p>
        <p>Fig. 7 indicates the results obtained by the proposed
cellular bonding prototype with the use of the adaptive load
balancing algorithm in order to counteract the drawbacks
related to the variability of the end-to-end bandwidth offered
by each radio operator during the movement of the mobile
sink/gateway. The mobile sink/gateway was moved following
the same route. It clearly appears that the cellular bonding
almost always outperforms the best cellular operator; however,
when this does not happen it is due to the convergence time
of the adaptive weights algorithms. Also, this case highlights
that the final end-to-end bandwidth is not equal to the sum of
all bandwidths because of the presence of the overhead due to
Fig. 10.   Urban route of the test bed.
 
Fig. 9. Average end-to-end bandwidth comparison.
the implementation of the VPNs and their bonding.</p>
        <p>In the fig. 8 the behaviour of static and dynamic weights
is presented, whereas in the fig. 9 the average end-to-end
bandwidths of the two schemes and of the single operators
are compared. As we can see, the VPNs bond with adaptive
weights assignment outperforms the static assignment scheme
by almost 60% showing the effectiveness of the proposed
solution in vehicular applications such as telemedicine, telemetry,
remote command and control, etc...</p>
        <p>In fig. 11 and fig. 12, referring to the static and the adaptive
weights assignment respectively in the urban scenario, it is
possible to notice that three different conditions appear: in the
first part of the test bed one of the two operator goes down
because of lack of radio coverage or network congestion; in
the second phase Operator 1 and Operator 2 have almost the
same performance, and the same condition appear at the end
of the test bed; in the third phase of the test bed Operator 1
performs better than Operator 2.</p>
        <p>When the first condition appear, the use of the VPNs
bond technique and the use of two or more network accesses
guarantees a seamless connectivity between the source and the
destination if compared to the use of only one radio interface.
More in detail when one of the two operators goes down the
VPNs bond performs as the only working operator and the
prototype behaves every time like a common single stream
device equipped with the USIM belonging to the best network
operator, i.e. the operator offering the best connectivity at the
given time.</p>
        <p>Static and adaptive approaches behaves in the same manner
and the performance delivered by the VPN bond coupled with
the static load balancing between the two available connections
is satisfactory in the above mentioned scenarios; however,
when the performances of the two radio access networks are
different the adaptive scheme appropriately adjust the weights
assigned to the VPNs (see fig. 13) and it outperforms the static
one as shown in fig. 14. Finally, when the available bandwidth
offered by each operator is almost equal, the adaptive scheme
converges to the static one assigning the same weight to
the two connections and the two approaches show equal</p>
      </sec>
      <sec id="sec-5-2">
        <title>F  ig. 11. Throughput comparison Static scheme. F  ig. 13.</title>
        <p>Weights assigned to each VPN by the Adaptive scheme.</p>
      </sec>
      <sec id="sec-5-3">
        <title>F  ig. 12. Throughput comparison Adaptive scheme.</title>
        <p>performance.</p>
        <p>VI.</p>
        <p>CONCLUSION</p>
        <p>The present paper proposes a dynamic VPNs bonding and
load balancing techniques between two or more available radio
access connections.</p>
        <p>The approach is based on a smart gateway and the typical
scenario is based on the following applications: mobile
wireless sensor networks, IoT networks, local area networks for
time critical or real time communications.</p>
        <p>The first approach permits us to enhance the available
endto-end bandwidth and the reliability of the connection between
the sink and the remote position; the second step consists
in the dynamic weights calculation to be assigned to each
connection in order to maximize the cumulative end-to-end
bandwidth. In fact, Mobile IP networks are not designed to
support real-time and/or time-critical traffic because of several
drawbacks concerning the wireless medium, such as resources
sharing, traffic congestion, radio link coverage etc., which
impact directly such parameters as bandwidth, delay, jitter, and
packet losses that are the main causes of quality degradation
of numerous services over the PSTN.</p>
      </sec>
      <sec id="sec-5-4">
        <title>F  ig. 14. Static scheme vs. Adaptive scheme.</title>
        <p>Under this condition, the dynamic assignment of the weight
to each connection of the VPN bonding plays a key role in
exploiting the best connection available at the given time.
Performance evaluation of the prototype shows the
effectiveness of our approach in terms of instantaneous throughput.
Considering the future work, the authors of the present paper
are currently working on a device that is able to calculate the
dynamic weights of the load balancing algorithm based on the
kind of data traffic the sink/gateway has to transmit or receive
from the remote command and control station.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lamba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yadav</surname>
          </string-name>
          , and G. U. Devi, “
          <article-title>Analysis of technologies in 3g and 3.5g mobile networks</article-title>
          ,
          <source>” in International Conference on Communication Systems and Network Technologies (CSNT)</source>
          ,
          <fpage>11</fpage>
          -13 May,
          <year>2012</year>
          ,
          <year>2012</year>
          , pp.
          <fpage>330</fpage>
          -
          <lpage>333</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Jadhav</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          , “
          <article-title>Performance evaluation of quality of voip in wimax and umts</article-title>
          ,”
          <source>in IEEE 12th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Beritelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gallotta</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Rametta</surname>
          </string-name>
          , “
          <article-title>A dual streaming approach for speech quality enhancement of voip service over 3g networks,”</article-title>
          <source>in IEEE Digital Signal Processing (DSP)</source>
          ,
          <fpage>1</fpage>
          -
          <issue>3</issue>
          <year>July 2013</year>
          ,
          <year>2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F.</given-names>
            <surname>Beritelli</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Rametta</surname>
          </string-name>
          , “
          <article-title>Hsdpa dual streaming approach for improving voip speech quality in forensic applications,” in IEEE 9th International Symposium on Communications Systems Networks</article-title>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Pappalardo</surname>
          </string-name>
          and E. Tramontana, “
          <article-title>Automatically discovering design patterns and assessing concern separations for applications,”</article-title>
          <source>in Proceedings of ACM Symposium on Applied Computing (SAC)</source>
          , Dijon, France,
          <year>April 2006</year>
          , pp.
          <fpage>1591</fpage>
          -
          <lpage>1596</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pappalardo</surname>
          </string-name>
          , E. Tramontana, and G. Zappala, “
          <article-title>A CloudDistributed GPU Architecture for Pattern Identification in Segmented Detectors Big-Data Surveys,”</article-title>
          <source>The Computer Journal</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , G. Pappalardo, and E. Tramontana, “
          <article-title>An agent-driven semantical identifier using radial basis neural networks and reinforcement learning</article-title>
          ,” in XV Workshop ”From Objects to Agents
          <source>” (WOA)</source>
          , vol.
          <volume>1260</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Catania</surname>
          </string-name>
          , Italy: CEUR-WS,
          <year>September 2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Springer</surname>
            <given-names>LNCS</given-names>
          </string-name>
          , Zakopane, Poland,
          <year>June 2015</year>
          , vol.
          <volume>9119</volume>
          , pp.
          <fpage>79</fpage>
          -
          <lpage>89</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pappalardo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Tramontana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Marszałek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          , and M. Woz´niak, “
          <article-title>Simplified firefly algorithm for 2d image key-points search,” in Symposium on Computational Intelligence for Humanlike Intelligence (CHILI), ser</article-title>
          .
          <source>Symposium Series on Computational Intelligence (SSCI)</source>
          . IEEE,
          <year>2014</year>
          , pp.
          <fpage>118</fpage>
          -
          <lpage>125</lpage>
          . [Online]. Available: http://dx.doi.org/10.1109/CIHLI.
          <year>2014</year>
          .7013395 M. Woz´niak,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gabryel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Nowicki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , and E. Tramontana, “
          <article-title>Can we process 2d images using artificial bee colony?</article-title>
          ”
          <source>in Proceedings of International Conference on Artificial Intelligence and Soft Computing (ICAISC)</source>
          , ser. Springer LNCS, Zakopane, Poland,
          <year>June 2015</year>
          , vol.
          <volume>9119</volume>
          , pp.
          <fpage>660</fpage>
          -
          <lpage>671</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>G.</given-names>
            <surname>Capizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Lo</given-names>
            <surname>Sciuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , E. Tramontana, and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Woz´niak, “Automatic classification of fruit defects based on co-occurrence matrix and neural networks</article-title>
          ,
          <source>” in Proceedings of IEEE Federated Conference on Computer Science and Information Systems (FedCSIS)</source>
          , Lodz, Poland,
          <year>September 2015</year>
          , pp.
          <fpage>873</fpage>
          -
          <lpage>879</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>M. Woz</surname>
            ´niak,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Napoli</surname>
            , E. Tramontana,
            <given-names>G.</given-names>
            Capizzi, G.
          </string-name>
          <string-name>
            <surname>Lo</surname>
            <given-names>Sciuto</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Nowicki</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Starczewski</surname>
          </string-name>
          , “
          <article-title>A multiscale image compressor with rbfnn and discrete wavelet decomposition</article-title>
          ,”
          <source>in Proceedings of IEEE International Joint Conference on Neural Networks (IJCNN)</source>
          , Killarney, Ireland,
          <year>July 2015</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          , DOI: 10.1109/IJCNN.
          <year>2015</year>
          .
          <volume>7280461</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>G.</given-names>
            <surname>Borowik</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Woz´niak, A</article-title>
          . Fornaia,
          <string-name>
            <given-names>R.</given-names>
            <surname>Giunta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , G. Pappalardo, and E. Tramontana, “
          <article-title>A software architecture assisting workflow executions on cloud resources</article-title>
          ,”
          <source>International Journal of Electronics and Telecommunications</source>
          , vol.
          <volume>61</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>23</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>[14] “http://www.pcengines.ch/alix.htm.”</mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>[15] “http://www.zeroshell.net.”</mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [16] “
          <article-title>Openvpn: Building and integrating virtual private networks,” in Markus Feilner</article-title>
          , Packt Publishing Ltd,
          <volume>11</volume>
          mag
          <year>2006</year>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J.</given-names>
            <surname>Manish</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Dovrolis</surname>
          </string-name>
          , “
          <article-title>Pathload: a measurement tool for end-toend available bandwidth,” in Passive and Active Measurements (PAM</article-title>
          ) Workshop,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [18] [19]
          <string-name>
            <given-names>C.</given-names>
            <surname>Manish</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          and Dovrolis, “
          <article-title>End-to-end available bandwith: Measurements, methodology, dynamic and relation with tcp throughput</article-title>
          ,
          <source>” IEEE/ACM Transactions on Networking</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>R. S.</given-names>
            <surname>Prasad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Murray</surname>
          </string-name>
          , Dovrolis, and
          <string-name>
            <given-names>C. K.</given-names>
            <surname>Claffy</surname>
          </string-name>
          , “
          <article-title>Bandwith estimation: metrics, measurement techniques and tools</article-title>
          ,” IEEE Network,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>