<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">24691</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.024691</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Iterative Dichotomiser Posteriori Method Based Service Attack Detection in Cloud Computing</article-title><alt-title alt-title-type="left-running-head">Iterative Dichotomiser Posteriori Method Based Service Attack Detection in Cloud Computing</alt-title><alt-title alt-title-type="right-running-head">Iterative Dichotomiser Posteriori Method Based Service Attack Detection in Cloud Computing</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Dhiyanesh</surname><given-names>B.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref><email>dhiyanu87@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Karthick</surname><given-names>K.</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Radha</surname><given-names>R.</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Venaik</surname><given-names>Anita</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Hindusthan College of Engineering and Technology</institution>, <addr-line>Coimbatore, 641032</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Sona College of Technology</institution>, <addr-line>Salem, 636005</addr-line>, <country>India</country></aff>
<aff id="aff-3"><label>3</label><institution>Karpagam Institute of Technology</institution>, <addr-line>Coimbatore, 641105</addr-line>, <country>India</country></aff>
<aff id="aff-4"><label>4</label><institution>Amity Business School, Amity University</institution>, <addr-line>Noida, 201301</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: B. Dhiyanesh. Email: <email>dhiyanu87@gmail.com</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-06-07"><day>07</day>
<month>06</month>
<year>2022</year></pub-date>
<volume>44</volume>
<issue>2</issue>
<fpage>1099</fpage>
<lpage>1107</lpage>
<history>
<date date-type="received"><day>27</day><month>10</month><year>2021</year></date>
<date date-type="accepted"><day>24</day><month>1</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Dhiyanesh et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Dhiyanesh et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_24691.pdf"></self-uri>
<abstract>
<p>Cloud computing (CC) is an advanced technology that provides access to predictive resources and data sharing. The cloud environment represents the right type regarding cloud usage model ownership, size, and rights to access. It introduces the scope and nature of cloud computing. In recent times, all processes are fed into the system for which consumer data and cache size are required. One of the most security issues in the cloud environment is Distributed Denial of Service (DDoS) attacks, responsible for cloud server overloading. This proposed system ID3 (Iterative Dichotomiser 3) Maximum Multifactor Dimensionality Posteriori Method (ID3-MMDP) is used to overcome the drawback and a relatively simple way to execute and for the detection of (DDoS) attack. First, the proposed ID3-MMDP method calls for the resources of the cloud platform and then implements the attack detection technology based on information entropy to detect DDoS attacks. Since because the entropy value can show the discrete or aggregated characteristics of the current data set, it can be used for the detection of abnormal data flow, User-uploaded data, ID3-MMDP system checks and read risk measurement and processing, bug rating file size changes, or file name changes and changes in the format design of the data size entropy value. Unique properties can be used whenever the program approaches any data error to detect abnormal data services. Finally, the experiment also verifies the DDoS attack detection capability algorithm.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>ID3 (Iterative dichotomiser 3) maximum multifactor dimensionality posterior method (ID3-MMDP)</kwd>
<kwd>distributed denial of service (DDoS) attacks</kwd>
<kwd>detection of abnormal data flow</kwd>
<kwd>SK measurement and processing</kwd>
<kwd>bug rating file size</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>This has evolved from various existing technologies such as cloud computing phases, application computing, and service-oriented architecture. By using cloud computing, many companies can invest large sums of new infrastructure, software licenses and expand without building big data centers. The handling of abnormal data network traffic is still a critical issue that needs to be resolved because the abnormality may relate to the service at a particular moment.</p>
<p>Denial affects all parties, and distributed denial of service (DDoS) attacks are a severe problem extending cloud computing. The primary purpose of a DDoS attack is that the service attempts to restrict access to the machine or service rather than destroying the service itself-even if it is interrupted. This type of attack makes the network unable to provide regular services by targeting the network bandwidth or connectivity. Therefore, the methods and resources that can carry out and cover up this kind of attack are considerably evolved. This problem needs to be solved as soon as possible. Otherwise, the expenditures of biology and users of cloud services will increase with greater risk exposure simultaneously. In the rest of this article, DDoS attacks are defined, and second, some mechanisms used to mitigate DDoS attacks are summarized and discussed.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>Software-defined Networking (SDN) can be used to detect and slow down network-based, HTTP DDoS-based network attacks to assist security systems [<xref ref-type="bibr" rid="ref-1">1</xref>]. To run our simulation environment on the Mininet virtual machine, the Open Network Operating System (ONOS) controller is the closest option to a real-world product network [<xref ref-type="bibr" rid="ref-2">2</xref>].</p>
<p>Combined with intra-regional and inter-domain DDoS attack protection, Security Chain (SC) allows effective mitigation, including a continuous attack, and an effective mitigation path near the onset of the attack. Most of these are useless to augment horrendous traffic and can significantly reduce the cost of messaging across multiple sectors. As far as I know, on-chain-SC is the first solution proposed to resolve DDoS attacks, blockchain, and smart deals on inter-technology to mitigate this two-domain and SDN combination. Access to Ropsten for Chain-SC activation is suspended on the ethereal test network [<xref ref-type="bibr" rid="ref-3">3</xref>&#x2013;<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>Blockchain technology is used to overcome the SOC (Security Operations Center), trust, and integrity issues on the decentralized denial of service data exchange platform [<xref ref-type="bibr" rid="ref-6">6</xref>]. The DDoS attack vector is called a multiplex asymmetric DDoS attack that uses multiple options differently [<xref ref-type="bibr" rid="ref-7">7</xref>].</p>
<p>A novel DDoS detection framework is implemented using the Pursuit algorithm that matches the type of resource degradation DDoS attack detection. Multiple properties are used for network traffic to detect low-density DDoS attacks [<xref ref-type="bibr" rid="ref-8">8</xref>] simultaneously.</p>
<p>The Denial of Service (DDoS) attack has severely affected network availability for decades, yet robust security mechanisms are against it. However, Emerging Software Limited Network (SDN) offers a new way to protect against DDoS attacks. This article proposes two methods to detect DDoS attacks in SDN [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. Dynamically selected algorithms from the framework classification algorithms are ready to detect different DDoS ways that use fussy logic [<xref ref-type="bibr" rid="ref-11">11</xref>]. Utility Layered Distribution Service Denial (UL-DDoS) Attacks and Al-DDoS attack&#x0027;s magic can make many intrusion prevention methods ineffective and pose a significant threat to websites [<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>Application Layer DDoS Assistance in Understanding these Job Attempts uses the Full Spectrum of Attack These attacks can perform critical functions [<xref ref-type="bibr" rid="ref-13">13</xref>]. An accurate method is used to diagnose DDoS attacks by Exceeding Ratio Measurements (ERM). The proposed method is based on the difference between the probability distribution and the number of flows [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<p>Denial of Service (DDoS) attacks prevent online services from being voted on by traffic from multiple sources. Therefore, an effective method is proposed to detect DDoS attacks from massive data traffic jams [<xref ref-type="bibr" rid="ref-15">15</xref>]. In the development model of the novel botnet, the optimal design of the attack strategy is estimated on the DDoS, and the expected impact function refers to the attack. The associated DDoS approach reduces the variational problem to attack [<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<p>Denial Service Spread (DDoS) attacks are the second most popular cybercrime attack after information theft. DDoS TCP flood attacks, which deplete cloud resources and increase bandwidth, can affect the entire cloud computing program in a short period [<xref ref-type="bibr" rid="ref-17">17</xref>]. Emerging Network Operation Virtualized (NFV) technology Network Services Publishing demand reduces ownership hardware size and introduces new operating opportunities [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>The deep convolutional neural network (DCNN) automatically learns the optimization function of the original data distribution. It does not use the deep reinforcement learning Q-network to make a decisive decision to protect against attacks [<xref ref-type="bibr" rid="ref-19">19</xref>]. The infiltration detection and security model for CPSS (Cloud-Physical-Social Organization) are standard infiltration analysis properties. They can effectively detect large-scale Low-Rate (LR) DDoS attacks, particularly in the marginal environment [<xref ref-type="bibr" rid="ref-20">20</xref>].</p>
<p>This section presented the using methods described by various authors. These methods contain some limitations in introducing the proposed method. This method gives better results compared to the previous system.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Implementation of the Proposed System</title>
<p>The ID3 (Iterative Dichotomiser 3) Maximum Multifactor Dimensionality Posteriori Method (ID3-MMDP) system is based on the risk value, and then different state detection details are updated. For the proposed defense mechanism, the behavior differences between the allocation strategy of attackers and ordinary users are to be analyzed. Data errors cause damage to the data values in the program, resulting in incorrect intermediate values and final output files. Fault tolerance should include improving the reliability and integrity of the proposed system.</p>
<p>Setting up the same server cloud environment together behind the load balancer is considered. The average rate of request arrival and R requests per unit time and the load balancer are in a steady-state S distributed to the cloud data center, and the details are shown in the above <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Proposed system block diagram</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24691-fig-1.png"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Risk Value Measurement</title>
<p>A risk indicator measures the potential impact of a threat on the probability that a particular property will occur. It provides valuable information to assess the overall security status of cloud computing. There is no fixed allocation to the expected risk of each event. It has an initial value that can transform into a show and connect with other dynamics. The proposed system logically activates the communication machine, i.e., the rule tree used. The engine uses <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref> to define the risk value of the warning trigger whenever the panel increases with each other, and the risk level is greater than or equal to one:<disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">R</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi mathvariant="normal">D</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">b</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:math>
</disp-formula>where</p>
<p>Av-(Assert Value) Value of DDoS resource</p>
<p>Ap-(assert priority) the method of setting the value of shooting shots after a dangerous alert is accepted according to the average</p>
<p>Dr-(Detection Reliability)/) The probability of a contact level DDoS having a limited attack is</p>
<p>Fn-Normalize factor standard defined by the administrator in IDS configuration</p>
<p><bold>Analysis of state Level Updation</bold></p>
<p><bold>Step1:</bold> Assuming that the cloud system can be moduled by N number of different states N &#x003D; &#x007B;n1, n2,&#x2026;nn&#x007D;</p>
<p><bold>Step2:</bold> Define the security states S &#x003D; &#x007B;s1, s2, s3&#x2026;sn&#x007D; and also these states change over time S &#x003D; &#x007B;s1, s2, s3&#x2026;sn&#x007D; where Sn&#x2208;N.</p>
<p><bold>Step3:</bold> The system is tracked by S host H-based s and generates observation of most messages coming from H symbol set <italic>H</italic><sup><italic>t</italic></sup><italic>m</italic> m &#x003D; &#x007B;m1, m2,&#x2026;mn&#x007D; where m&#x2208;&#x2009;<italic>H</italic><sup><italic>t</italic></sup></p>
<p><bold>Step4:</bold> It&#x0027;s an empty team that gathers final release possibilities. It describes the severity of each warning in a definite state. These values should be calculated on the basis that the alarm intensity will be allocated to sources that are not functionally based.<disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>m</mml:mi><mml:mi>n</mml:mi></mml:msup><mml:mo>&#x2217;</mml:mo><mml:msup><mml:mi>H</mml:mi><mml:mi>t</mml:mi></mml:msup><mml:mo>&#x2217;</mml:mo><mml:msup><mml:mi>N</mml:mi><mml:mi>n</mml:mi></mml:msup><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><bold>Step5:</bold> Define cloud entities E and their resource level<disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mo>&#x03BB;</mml:mo><mml:mtext>E</mml:mtext></mml:math>
</disp-formula>// where m is the number of messages that is denoted as m &#x003D; m1, m2, m3&#x2026;mn</p>
<p>(L, M, H, V) The predictive intensity is then compared to one of the four priorities that will reflect the system&#x0027;s state, as we have explained in the ID3-MMDP.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Traffic Analysis</title>
<p>The previously transferred data of the transformation field of some neighbors and incremental address data for each state S are addressed. Cloud server extracted transition field is calculated by the transition path set and the records in the database cloud. Before the data is forwarded to its destination, the transfer data of each S will have a transfer address field and its address field.</p>
<p><bold>Traffic analysis algorithm steps:</bold></p>
<p><bold>Step1:</bold> Analyze the number of S and traffic log <italic>T</italic><sub><italic>log</italic></sub></p>
<p><bold>Step2:</bold> Identify the route source SA and destination DA, data D</p>
<p><bold>Step3:</bold> Data. size () to apply each data to identify the size and number of data</p>
<p><bold>Step4:</bold> If P &#x003D;&#x003D; original data then</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;To identify the SA &#x003D; <italic>P</italic><sub>(<italic>SA</italic>.<italic>Address</italic>)</sub>.<italic>xxx</italic>.<italic>xxx</italic>.<italic>xxx</italic>.<italic>xxx</italic>,</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;DA &#x003D; <italic>P</italic><sub>(<italic>DA</italic>.<italic>Address</italic>)</sub>.(<italic>xxx</italic>.<italic>xxx</italic>.<italic>xxx</italic>.<italic>xxx</italic>)</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Transmission time sequence Ts &#x003D; Current time.</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Transmission Range Tr &#x003D; <italic>P</italic><sub>(<italic>Tr</italic>.<italic>Address</italic>)</sub>.(<italic>xxx</italic>.<italic>xxx</italic>.<italic>xxx</italic>.<italic>xxx</italic>)<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mi>p</mml:mi></mml:munderover><mml:mo>&#x007B;</mml:mo></mml:mstyle><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mo>.</mml:mo><mml:mi>A</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x007C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mo>.</mml:mo><mml:mi>A</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>x</mml:mi><mml:mi>x</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>+</mml:mo><mml:mtext>Ts</mml:mtext><mml:mo>+</mml:mo><mml:mtext>Tr</mml:mtext><mml:mo>&#x007D;</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula></p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;End if</p>
<p><bold>Step5:</bold> Go to step3.</p>
<p><bold>Step6:</bold> Stop.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Trust Evaluation Monitoring of User Access Data</title>
<p>Data access to data failures caused by individual events can flow into web mining applications in large distributed systems. Therefore, it suggests a reliable service-oriented planning algorithm for data flow reliability to indicate service. The general belief that directs trust is defined as a trust which is as follows:<disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>D</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mi>T</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2217;</mml:mo><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><italic>D</italic>(<italic>U</italic><sub><italic>i</italic></sub>) a direct belief in the service <italic>i</italic><sup><italic>th</italic></sup> through history-based experiences using the service by users. Recommendation trust <italic>R</italic>(<italic>U</italic><sub><italic>i</italic></sub>) denoted by the Service among other users. It can calculate as follows, the service, direct trust recommended weight of trust <italic>W</italic><sub><italic>i</italic></sub> Denote:<disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>k</mml:mi></mml:mfrac></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:math>
</disp-formula>where <italic>k</italic> denotes the number of times of the <italic>i</italic><sup><italic>th</italic></sup> service. The credit rating is that transmission and data storage and data read/write times are the best, and data stream errors are very time-consuming.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Result and Discussion</title>
<p>The proposed ID3-MMDP has been implemented using the simulation tool visual studio and the programming language.Net..Net will support both window and web applications. Id3 Maximum Multifactor Dimensionality Posteriori Method (ID3-MMDP) algorithm is used to classify the data representing network traffic flows, including standard and Distributed Denial of Service (DDoS) traffic.</p>
<p>Above <xref ref-type="table" rid="table-1">Tab. 1</xref> shows the proposed ID3-MMDP, which needs the resources. This section is compared to the proposed ID3 (Iterative Dichotomiser 3) Maximum Multifactor Dimensionality Posteriori Method (ID3-MMDP), and existing Ad boost Shuffled Leaping Optimal Selection (ASLOS) enhanced history-based IP filtering scheme (eHIPF), Naive Bayes, and Fuzzy Logic System (FLS) methods.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Simulation parameter</title></caption>
<table><colgroup><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Parameter</th>
<th align="left">Value</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Tool name</td>
<td align="left">Visual studio 2012</td>
</tr>
<tr>
<td align="left">Front end</td>
<td align="left">Asp.Net</td>
</tr>
<tr>
<td align="left">Back end</td>
<td align="left">SQL (Structured Query Language)</td>
</tr>
<tr>
<td align="left">Total number of data&#x0027;s</td>
<td align="left">1200</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows the systematic analysis of packet flow performance based on the number of traffic that occurs. The previous eHIPF provides 154 with ms, Na&#x00EF;ve Bayes provides 165 with ms, and FLS provides 172 with ms, ASLOS provides 132 with ms, and the proposed ID3-MMDP provides 124 with ms.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Periodic analysis of packet flow</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24691-fig-2.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> shows the classification accuracy level. Accuracy refers to the number of intruder instances to detect divided by the number of intruder instances present in the dataset.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Analysis of accuracy</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Algorithm</th>
<th align="left">eHIPF</th>
<th align="left">Na&#x00EF;ve Bayes</th>
<th align="left">FLS</th>
<th align="left">ASLOS</th>
<th align="left">ID3-MMDP</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Analysis of accuracy in &#x0025;</td>
<td align="left">62</td>
<td align="left">71</td>
<td align="left">79</td>
<td align="left">85</td>
<td align="left">88</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The formula to estimate the Accuracy is,<disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">y</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>N</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>
<p>Above <xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows that the DDoS dataset classification accuracy level is compared with existing methods, and the proposed ID3-MMDP gives better accuracy than the previous systems.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Analysis of accuracy</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24691-fig-3.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the metric values during the attack time analysis. The attack time index is higher than today, but the attack power is high in the standard time, and the packet rate index is higher than the existing methods.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Metric value of during attacking time analysis</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24691-fig-4.png"/>
</fig>
<p>The above <xref ref-type="fig" rid="fig-5">Fig. 5</xref> presented about the analysis of risk evaluation speed is compared with the previous and proposed method. Hence the proposed ID3-MMDP gives better results compared with other methods.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Analysis of risk evaluation speed</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24691-fig-5.png"/>
</fig>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>DDoS attack in the cloud differs from other attacks on infrastructure in fixed application space. A comprehensive introduction to attack methods, results and attack intensity has not been given. This novel approach is an attempt to explore the task and design infrastructure to facilitate the collection of essential requirements for the DDoS Cloud. These requirements include optimization of the five critical factors in the director attack. Experiences of this type have shown that combat against DDoS attacks in a cloud environment with pure transport filtration is not sufficient. ID3-MMDP recommends minimizing damage and availability when considering stabilization, collaboration, resource management, and dealing with DDoS attacks in cloud computing. ID3-MMDP provides a multi-level flow-based warning collaboration DDoS detection solution framework to effectively design effective mitigation solutions. The proposed ID3-MMDP gives the periodic analysis of parameters. It indicates that the packet flow is 124 with ms, accuracy is 88&#x0025;, and metric value during attacking time analysis is 67.87 packet rate, analysis of risk evaluation speed is 86&#x0025;.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors received no specific funding for this study</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Hong</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Choi</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Park</surname></string-name></person-group>, &#x201C;<article-title>SDN-assisted slow HTTP DDoS attack defense method</article-title>,&#x201D; <source>IEEE Communications Letters</source>, vol. <volume>22</volume>, no. <issue>4</issue>, pp. <fpage>688</fpage>&#x2013;<lpage>691</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. A.</given-names> <surname>P&#x00E9;rez-D&#x00ED;az</surname></string-name>, <string-name><given-names>I. A.</given-names> <surname>Valdovinos</surname></string-name>, <string-name><given-names>K. K. R.</given-names> <surname>Choo</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Zhu</surname></string-name></person-group>, &#x201C;<article-title>A flexible SDN-based architecture for identifying and mitigating low-rate DDoS attacks using machine learning</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>155859</fpage>&#x2013;<lpage>155872</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. A. E.</given-names> <surname>Houda</surname></string-name>, <string-name><given-names>A. S.</given-names> <surname>Hafid</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Khoukhi</surname></string-name></person-group>, &#x201C;<article-title>Cochain-SC: An intra-and inter-domain DDoS mitigation scheme based on blockchain using SDN and smart contract</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>98893</fpage>&#x2013;<lpage>98907</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Dhiyanesh</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Sakthivel</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Radha</surname></string-name> and <string-name><given-names>S. S.</given-names> <surname>Kumar</surname></string-name></person-group>, &#x201C;<article-title>Threshold based DDoS mitigation with fog layer in cloud environment</article-title>,&#x201D; <source>J. Ambient Intell Human Comput</source>, vol. <volume>12</volume>, pp. <fpage>7039</fpage>&#x2013;<lpage>7050</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Dubey</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Agrawal</surname></string-name></person-group>, &#x201C;<article-title>QoS driven task scheduling in cloud computing</article-title>,&#x201D; <source>International Journal of Computer Applications Technology and Research</source>, vol. <volume>2</volume>, no. <issue>5</issue>, pp. <fpage>595</fpage>&#x2013;<lpage>600</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Praseed</surname></string-name> and <string-name><given-names>P. S.</given-names> <surname>Thilagam</surname></string-name></person-group>, &#x201C;<article-title>Multiplexed asymmetric attacks: Next-generation DDoS on HTTP/2 servers</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>15</volume>, pp. <fpage>1790</fpage>&#x2013;<lpage>1800</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Erhan</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Anarim</surname></string-name></person-group>, &#x201C;<article-title>Hybrid DDoS detection framework using matching pursuit algorithm</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>118912</fpage>&#x2013;<lpage>118923</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Dong</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Sarem</surname></string-name></person-group>, &#x201C;<article-title>DDoS attack detection method based on improved KNN with the degree of DDoS attack in software-defined networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>5039</fpage>&#x2013;<lpage>5048</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kasthuripriya</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Dhiyanesh</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Sakthivel</surname></string-name></person-group>, &#x201C;<article-title>LFTSM-local flow trust-based service monitoring approach for preventing the packet during data transfer in cloud</article-title>,&#x201D; <source>Asian Journal of Information Technology</source>, vol. <volume>15</volume>, pp. <fpage>3927</fpage>&#x2013;<lpage>3931</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author">A. Alsirhani, S. Sampalli and P. Bodorik</person-group>, &#x201C;<article-title>DDoS detection system: Using a set of classification algorithms controlled by fuzzy logic system in apache spark</article-title>,&#x201D; <source>IEEE Transactions on Network and Service Management</source>, vol. <volume>16</volume>, no. <issue>3</issue>, pp. <fpage>936</fpage>&#x2013;<lpage>949</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Ge</surname></string-name></person-group>, &#x201C;<article-title>Umbrella: Enabling ISPs to offer readily deployable and privacy-preserving DDoS prevention services</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>14</volume>, no. <issue>4</issue>, pp. <fpage>1098</fpage>&#x2013;<lpage>1108</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Cao</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Identifying application-layer DDoS attacks based on request rhythm matrices</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>164480</fpage>&#x2013;<lpage>164491</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author">A. Praseed and P. S. Thilagam</person-group>, &#x201C;<article-title>Modelling behavioral dynamics for asymmetric application layer DDoS detection</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>16</volume>, pp. <fpage>617</fpage>&#x2013;<lpage>626</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Dhiyanesh</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Sakthivel</surname></string-name></person-group>, &#x201C;<article-title>Secure data storage auditing service using third party auditor in cloud computing</article-title>,&#x201D; <source>IJAER International Journal of Applied Engineering Research</source>, vol. <volume>10</volume>, no. <issue>37</issue>, pp. <fpage>28037</fpage>&#x2013;<lpage>28044</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author">A. Praseed and P. S. Thilagam</person-group>, &#x201C;<article-title>DDoS attacks at the application layer: Challenges and research perspectives for safeguarding web applications</article-title>,&#x201D; <source>IEEE Communications Surveys &#x0026; Tutorials</source>, vol. <volume>21</volume>, no. <issue>1</issue>, pp. <fpage>661</fpage>&#x2013;<lpage>685</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Sood</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Xiang</surname></string-name></person-group>, &#x201C;<article-title>ERM: An accurate approach to detect DDoS attacks using entropy rate measurement</article-title>,&#x201D; <source>IEEE Communications Letters</source>, vol. <volume>23</volume>, no. <issue>10</issue>, pp. <fpage>1700</fpage>&#x2013;<lpage>1703</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Dhiyanesh</surname></string-name></person-group>, &#x201C;<article-title>Dynamic resource allocation for machine to cloud communications robotics cloud</article-title>,&#x201D; in <conf-name>2012 Int. Conf. on Emerging Trends in Electrical Engineering and Energy Management (ICETEEEM)</conf-name>, <conf-loc>Chennai, India</conf-loc>, pp. <fpage>451</fpage>&#x2013;<lpage>454</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Gu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Guo</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Semi-supervised K-means DDoS detection method using hybrid feature selection algorithm</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>64351</fpage>&#x2013;<lpage>64365</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Xiang</surname></string-name> and <string-name><given-names>Y. Y.</given-names> <surname>Tang</surname></string-name></person-group>, &#x201C;<article-title>A low-cost distributed denial-of-service attack architecture</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>42111</fpage>&#x2013;<lpage>42119</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Dhiyanesh</surname></string-name> and <string-name><given-names>K. S.</given-names> <surname>Sathiyapriya</surname></string-name></person-group>, &#x201C;<article-title>Image inpainting and image denoising in wavelet domain using fast curve evolution algorithm</article-title>,&#x201D; in <conf-name>2012 IEEE Int. Conf. on Advanced Communication Control and Computing Technologies (ICACCCT)</conf-name>, <conf-loc>Ramanathapuram, India</conf-loc>, pp. <fpage>166</fpage>&#x2013;<lpage>169</lpage>, <year>2012</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>