<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">The using of fractal measures for network state monitoring and probabilistic network attack type determination</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Yu</forename><surname>Gubareva</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Povolzhskiy State University of Telecommunications and Informatics</orgName>
								<address>
									<addrLine>L. Tolstoy Street 23</addrLine>
									<postCode>443010</postCode>
									<settlement>Samara</settlement>
									<country key="RU">Russia</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">O</forename><forename type="middle">V</forename><surname>Osipov</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Povolzhskiy State University of Telecommunications and Informatics</orgName>
								<address>
									<addrLine>L. Tolstoy Street 23</addrLine>
									<postCode>443010</postCode>
									<settlement>Samara</settlement>
									<country key="RU">Russia</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">A</forename><forename type="middle">O</forename><surname>Pocheptsov</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Povolzhskiy State University of Telecommunications and Informatics</orgName>
								<address>
									<addrLine>L. Tolstoy Street 23</addrLine>
									<postCode>443010</postCode>
									<settlement>Samara</settlement>
									<country key="RU">Russia</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">V</forename><forename type="middle">V</forename><surname>Pugin</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Povolzhskiy State University of Telecommunications and Informatics</orgName>
								<address>
									<addrLine>L. Tolstoy Street 23</addrLine>
									<postCode>443010</postCode>
									<settlement>Samara</settlement>
									<country key="RU">Russia</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">The using of fractal measures for network state monitoring and probabilistic network attack type determination</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">AB89D507AD6CB9E1F554ABB42A8B333D</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-23T20:25+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>In the academic paper for network traffic analysis concerning risk assessment of network nodes infosecurity fractal analysis is used which takes into consideration system past history and makes it possible to randomly determine probable network attack types on the system of interest. There has been developed a network traffic analysis technique based on fractal measures set with a focus on network state analysis and probabilistic attack type determination. Following on from the thesis results there is possible the creation of network traffic analyzer (sniffer) for time estimate of infosecurity state as well as further computation of previously attacked devices and network nodes.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Any organization when operating is liable to various infosecurity risks which one way or another affect particular business processes characteristics and can negatively influence on financial data as well as the opportunity for the organization to go on its activity. Current business requirements necessitate using well-grounded technical-and-economic methods and means in operation providing quantitative and qualitative infosecurity (IS) level determination both with assessing infosecurity cost efficiency. For the purpose of efficient organization infosecurity a serious, systematic and integrated approach is required. Almost any infosecurity system building must start form risks analysis. Before infosecurity system designing one should specify what threatening (in other words conditions and factors which can become the reason for breaking system integrity, its security and privacy and also facilitating unauthorized access to it) exists for the given infosystem and to what extent it is potentially critical.</p><p>Telecommunications networks have numerous vulnerabilities arising both in system software development and in misconfiguration and equipment operation. The presence of security threat makes it possible for intruders to put into operation various types of network attack. Nowadays software tools development for infosecurity risks analysis by means of network traffic online analysis is of great interest. Clearing up possible threat aims makes the basis for providing safety-related system design. The threat aims show what should be protected. As a rule network state is analyzed with a focus on network administration problem solving, routing device monitoring, etc. To become aware of abnormal system behavior there is often used various statistic information collection and analysis via IP-traffic. In this paper for network traffic data accessing a free given software Zabbix under GNU GPL license was used. The monitoring system in this case builds software set for current traffic measuring and software system of its analysis constructed with computing entries so called fractal measures which will be specified in the given paper.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">The research objective and solution method</head><p>The research objective is network traffic analysis technique development based on fractal measures set aimed at network state analysis and probabilistic attack type determination. Resting upon the research described in this paper the authors are planning to create a network traffic analyzer (sniffer) currently left on a company server for its time estimate, consecutive defining of previously attacked devices and network nodes (network vulnerabilities) and as a result further IS risks assessment.</p><p>The paper <ref type="bibr" target="#b0">[1]</ref> gives an overview of scientific research in the field of analysis real-time network traffic, and specific hardware and software solutions are considered.</p><p>In the work <ref type="bibr" target="#b1">[2]</ref> the use of the Hurst index for the analysis of the traffic subject to anomalous intrusions in the form of DoS-attacks is considered. The studies conducted in <ref type="bibr" target="#b1">[2]</ref> showed that traffic has the property of self-similarity during abnormal intrusions, which proves the possibility of determining traffic anomalies in real time.</p><p>To take the set goal in the academic paper the following challenges are met: running the process analysis of the infosystem in question (the infosystem of an academic institution was taken as a basis) as an object to protect; Hurst exponent assessment, power-density spectrum and network traffic fractal measures in normal state and in the time of attack on the infosystem resources; executing the attack on the system resources.</p><p>Fractal analysis is statistic in its nature and in addition it gives the possibility to find selfsimilarity markers in the traffic of interest. The fact permits first to become aware of minimal required time for making the experiment. Second, it makes it possible to rely on the opportunity to forecast the system behavior dynamics in the nearest future. Fractal model is a set of fractal parameters (measures) put in accordance with the current network traffic state. The fractal measures changes dynamics when involving a series of measurements of one and the same telecommunication node lets us estimate traffic condition dynamics that is about the presence or absence of attacks on infosystem resources. Jumping ahead we can mention that as a result of the performed experiment it was brought to light that in case of DoS-attacks the self-similarity network traffic level reduces as well as there takes place power-density spectrum transformation.</p><p>The experiment idea is the following: there is some telecom traffic which is network load to timing dependency diagram (figure <ref type="figure" target="#fig_0">1</ref>). From mathematical analysis perspective the traffic in question represents univariate time series the observations of which are channel occupancy levels at different moments. The current series can be analyzed with various fractal measures calculating (Hurst exponent, etc.) as well as power-density spectrum.</p><p>At the first stage Hurst exponent and power-density spectrum were calculated for the normal network condition.</p><p>First they determine Hurst exponent for calculating network traffic self-similarity level. For its determination they find average channel occupancy value U N for N tick marks <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>:</p><formula xml:id="formula_0">U N = 1 N N n=1 U (n).<label>(1)</label></formula><p>Then they define X(n, N ) which is accumulated divergency U (n) from average value U N , which is determined with the help of the following total (union): where the average value U N is defined by the formula (1).</p><formula xml:id="formula_1">X(n, N ) = n p=1 {U (p) − U N },<label>(2)</label></formula><p>According to standardized Hurst range <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>, the divergence range is determined via minimal and maximal values of the accumulated divergence X(n, N) (2):</p><formula xml:id="formula_2">R(N ) = max 1≤n≤N X(n, N ) − min 1≤n≤N X(n, N ).<label>(3)</label></formula><p>The standard divergence S (N ) can be computed with the following known formula via dispersivity <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>:</p><formula xml:id="formula_3">S (N ) = 1 N N n=1 [U (n) − U N ] 2 1/2 . (<label>4</label></formula><formula xml:id="formula_4">)</formula><p>For most timing series the observed standardized range R/S is described by empiric relation and with the help of (3) and (4) appears as <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>:</p><formula xml:id="formula_5">R/S = (αN ) H , (<label>5</label></formula><formula xml:id="formula_6">)</formula><p>where H is the Hurst exponent; α is an arbitrary parameter (constant). The described procedure in scientific literature got the name of R/S-analysis.</p><p>In figure <ref type="figure" target="#fig_1">2</ref> there is shown R/S telecom traffic dependency in normal state upon N in log-log scale. The axis of ordinate shows the value of lg(R/S), on the x-axis -lg N .</p><p>Hurst exponent value for the traffic in question in normal condition turned out to be equal 0.68. In accordance with the theory of fractals if the got Hurst exponent value H &lt; 0.5 then the under study series has "short" memory. In other words it is antipersistent. It means that recent events in the begetter system produce much more influence on the following system behavior than less recent events. If H &gt; 0.5 the timing series is persistent and has fractal nature. With the value H = 0.5 the signal represents stochastic noise and doesnt have any useful information. As can be seen from the above, it was proved that the traffic in question in normal state is self-similar and has fractal nature.</p><p>Further in the paper there was made power-density spectrum estimation which represents rapid inverse Fourier transform of autocorrelation function.</p><p>The network traffic autocorrelation function is determined by the following formula: where N is the total number of network traffic tic marks. The signal power-density spectrum is defined by direct inverse Fourier transform of autocorrelation function <ref type="bibr" target="#b5">(6)</ref>:</p><formula xml:id="formula_7">R (j) = 1 N N −j i=1 U (i) U (i + j),<label>(6)</label></formula><formula xml:id="formula_8">S k = 1 N 2 N i=1 N −i p=1 U (p) U (p + i) exp −j 2πki N , k = 0, N − 1 .<label>(7)</label></formula><p>In figure <ref type="figure" target="#fig_2">3</ref> there is introduced network traffic power-density spectrum S (f ) = S k (U ) in normal state (with no network attack).</p><p>On the second stage there were studied fractal measures and network traffic power-density spectrum with DoS-attack.</p><p>During the DoS attack, the channel was fully loaded at 70 MB per second. It is worth noting here that the use of fractal measures (in particular, the parameter R/S) allows to guarantee the scalability of the obtained results in the case of higher channel utilization.</p><p>For this a before vulnerable web-system which before-known IP-address was developed. To perform DoS-attack there was used the software which is similar to LOIC program that allows to execute an attack of the given in advance IP-address with variable transactions amount. In addition to that simultaneously with this there was executed an attack on MySQL-server using SQL-injection implementation through get-parameter of the vulnerable system.</p><p>To do that they used an enquiry with SQL-function benchmark (n, q) that gives the possibility to do n times function q <ref type="bibr" target="#b4">[5]</ref>.</p><p>For attacking SQL-server there was written a script which given number of times issued such requests in cycle. After executing DoS-attack network traffic was taken during its time which was again analyzed about fractal measures and power-density spectrum. Hurst exponent for the traffic in question in the time of attack equaled 0.54 that speaks of sharp decrease self-similarity level of the traffic of interest.</p><p>Currently, experiments are being conducted on the backbone network with a load of 1.2 GB per second with a time sample duration of 24 hours (86,000 calculated values of the channel load).</p><p>In figure <ref type="figure" target="#fig_3">4</ref> there is shown power-density spectrum for the case in question which allows to visually classify the signal in question as "brown" noise. Consequently as a result of the experiment in real network fractal measures changing and power-density spectrum were proved with DoS-attack.</p><p>Not without interest are studying of fractal measures and network traffic power-density spectrum while various network attacks are that can lead to creation of some on-line "patterns" database (library) of power-density spectra and fractal measures values. In other words it is referred to the opportunity to make some fractal network-status indicator for the time of high probability to determine the threat type. Worth making a point in this regard is that subtle fractal analysis allows to reveal minimal traffic changing despite full channel occupancy in case of network attack. However, here we need further experimental research aimed at revealing specific attacks and building "patterns" of fractal characteristics. Note that Hurst exponent computing of network traffic with 10000 time samples takes around 1,5 seconds when using Intel Core i5 and power-density spectrum calculation takes about 4 seconds.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Conclusion</head><p>In conclusion, let us dwell on the main conclusions of the work done. Fractal network indicator led has to perform the following functions:</p><p>• saving channel occupancy entries sampling for certain time windows that are enough for network condition diagnostics;</p><p>• fractal measures and power-density spectrum calculation for every set timing series for the definite interval times for the purpose of further comparison with ¡¡patterns¿¿ from the information base (using neural networks);</p><p>• finding of network state totally in the current and precedent time points;</p><p>• probability forecast about the network attack nature in the future. Thus, in the paper for network traffic state analysis (including DoS-attacks) there is offered to use fractal measures and power-density spectrum which allow by indirect hints for agreeable time limit to determine threat level.</p><p>The algorithms developed in this work may be useful for the analysis of "smartlink connections" <ref type="bibr" target="#b5">[6]</ref>. Another object of the fractal technique is the stochastic network <ref type="bibr" target="#b6">[7]</ref>.</p><p>In conclusion, we note that the proposed method is the basis for creating a fractal indicator for analyzing the state of the network, while specialized software (iptables, ipwf, etc.) should be used to determine the sources of the DoS attack.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 .</head><label>1</label><figDesc>Figure 1. Network load to timing dependency diagram.</figDesc><graphic coords="3,70.87,113.39,453.55,138.74" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. The R/S dependency of telecom traffic on the number of timing counts.</figDesc><graphic coords="4,70.87,113.39,453.53,232.69" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 .</head><label>3</label><figDesc>Figure 3. Network traffic power-density spectrum in normal condition.</figDesc><graphic coords="5,159.76,113.39,272.13,248.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 .</head><label>4</label><figDesc>Figure 4. Network traffic power-density spectrum at the time of attack.</figDesc><graphic coords="5,159.76,488.36,272.12,185.92" type="bitmap" /></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_0">IV International Conference on "Information Technology and Nanotechnology" (ITNT-2018)</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Analysis of network traffic in the m ode real-time: overview of applied tasks, approaches and solutions Trudy I</title>
		<author>
			<persName><forename type="first">G</forename></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename></persName>
		</author>
		<author>
			<persName><forename type="first">Markin</forename><surname>Yu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Evstropov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Obydenkov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D O</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">SP RAN</title>
		<imprint>
			<biblScope unit="volume">29</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="117" to="150" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
	<note>in Russian</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Analysis of changes in the fractal properties of telecommunications traffic caused by abnormal intrusions</title>
		<author>
			<persName><forename type="first">O I</forename><surname>Shelukhin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Antonyan A A</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">T-COMM: Telecommunications and transport</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="61" to="64" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
	<note>in Russian</note>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Feder</surname></persName>
		</author>
		<title level="m">Fractals</title>
				<imprint>
			<publisher>Springer Science + Business Media, LLC</publisher>
			<date type="published" when="1991">1991</date>
			<biblScope unit="page">305</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Neural network methods for processing chaotic processes VII All-Russian scientific-technical conference</title>
		<author>
			<persName><forename type="first">V</forename><surname>Golovko</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Neuroinformatics</title>
		<imprint>
			<biblScope unit="page" from="43" to="91" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
	<note>in Russian</note>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Nizamutdinov</surname></persName>
		</author>
		<title level="m">The tactics of protecting and attacking WEB applications</title>
				<imprint>
			<publisher>BHV-Peterburg Publisher</publisher>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page">432</biblScope>
		</imprint>
	</monogr>
	<note>in Russian</note>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Modeling the &quot;smartlink connection</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">S</forename><surname>Nikitin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">I</forename><surname>Semyonov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Solostin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Sharov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S V</forename><surname>Chayka</surname></persName>
		</author>
		<idno type="DOI">10.18287/2412-6179-2016-40-1-64-72</idno>
	</analytic>
	<monogr>
		<title level="j">performance Computer Optics</title>
		<imprint>
			<biblScope unit="volume">40</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="64" to="72" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Method for the reliable shortest path search in timedependent stochastic networks and its application to GIS-based traffic control</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">A</forename><surname>Agafonov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Myasnikov</surname></persName>
		</author>
		<idno type="DOI">10.18287/2412-6179-2016-40-2-275-28</idno>
	</analytic>
	<monogr>
		<title level="j">Computer Optics</title>
		<imprint>
			<biblScope unit="volume">40</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="275" to="283" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
