<?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" xml:lang="en" 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">62413</article-id>
<article-id pub-id-type="doi">10.32604/csse.2025.062413</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Evaluation and Benchmarking of Cybersecurity DDoS Attacks Detection Models through the Integration of FWZIC and MABAC Methods</article-title>
<alt-title alt-title-type="left-running-head">Evaluation and Benchmarking of Cybersecurity DDoS Attacks Detection Models through the Integration of FWZIC and MABAC Methods</alt-title>
<alt-title alt-title-type="right-running-head">Evaluation and Benchmarking of Cybersecurity DDoS Attacks Detection Models through the Integration of FWZIC and MABAC Methods</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Mahmood</surname><given-names>Alaa</given-names></name></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Avc&#x0131;</surname><given-names>&#x0130;sa</given-names></name><email>isaavci@karabuk.edu.tr</email></contrib>
<aff id="aff-1">
<institution>Department of Computer Engineering, Karabuk University</institution>, <addr-line>Karabuk, 78000</addr-line>, <country>T&#x000FC;rkiye</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: &#x0130;sa Avc&#x0131;. Email: <email>isaavci@karabuk.edu.tr</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year></pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>25</day>
<month>04</month>
<year>2025</year></pub-date>
<volume>49</volume>
<issue>1</issue>
<fpage>401</fpage>
<lpage>417</lpage>
<history>
<date date-type="received">
<day>18</day>
<month>12</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>01</day>
<month>4</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</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_62413.pdf"></self-uri>
<abstract>
<p>A Distributed Denial-of-Service (DDoS) attack poses a significant challenge in the digital age, disrupting online services with operational and financial consequences. Detecting such attacks requires innovative and effective solutions. The primary challenge lies in selecting the best among several DDoS detection models. This study presents a framework that combines several DDoS detection models and Multiple-Criteria Decision-Making (MCDM) techniques to compare and select the most effective models. The framework integrates a decision matrix from training several models on the CiC-DDOS2019 dataset with Fuzzy Weighted Zero Inconsistency Criterion (FWZIC) and Multi-Attribute Boundary Approximation Area Comparison (MABAC) methodologies. FWZIC assigns weights to evaluate criteria, while MABAC compares detection models based on the assessed criteria. The results indicate that the FWZIC approach assigns weights to criteria reliably, with time complexity receiving the highest weight (0.2585) and F1 score receiving the lowest weight (0.14644). Among the models evaluated using the MABAC approach, the Support Vector Machine (SVM) ranked first with a score of 0.0444, making it the most suitable for this work. In contrast, Naive Bayes (NB) ranked lowest with a score of 0.0018. Objective validation and sensitivity analysis proved the reliability of the framework. This study provides a practical approach and insights for cybersecurity practitioners and researchers to evaluate DDoS detection models.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Cybersecurity attack</kwd>
<kwd>DDoS attacks</kwd>
<kwd>DDoS detection</kwd>
<kwd>MABAC</kwd>
<kwd>FWZIC</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Distributed denial of service (DDoS) attacks have become a pervasive and disruptive threat in the digital landscape. The DDoS attacks are designed to overwhelm and incapacitate targeted systems, rendering them inaccessible to legitimate users. By flooding a network, website, or online service with overwhelming traffic or malicious requests, DDoS attacks disrupt normal operations, causing significant downtime, financial losses, and damage to an organization&#x2019;s reputation [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. DDoS attacks come in multiple forms [<xref ref-type="bibr" rid="ref-3">3</xref>&#x2013;<xref ref-type="bibr" rid="ref-5">5</xref>]: protocol, volumetric, and application layer attacks.</p>
<p>The DDoS attack model is continually evolving to keep pace with technological advancements. Attackers constantly devise new methods to circumvent service providers&#x2019; defenses, driven by the evolution of distributed Denial of Service (DoS) techniques [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-7">7</xref>]. As the sophistication and scale of DDoS attacks continue to evolve, organizations must implement robust and proactive defense mechanisms [<xref ref-type="bibr" rid="ref-8">8</xref>]. These mechanisms include implementing traffic monitoring and anomaly detection systems, utilizing mitigation techniques such as rate limiting and traffic filtering, and leveraging the services of specialized DDoS mitigation providers [<xref ref-type="bibr" rid="ref-9">9</xref>]. Moreover, the effective identification and mitigation of DDoS attacks heavily rely on cooperation and the exchange of information among various entities, including organizations, Internet Service Providers (ISPs), and security communities [<xref ref-type="bibr" rid="ref-10">10</xref>&#x2013;<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>Many efforts were made to evaluate the DDoS detection model. A study by [<xref ref-type="bibr" rid="ref-13">13</xref>] used True Positive (TP), False Positive (FP), True Negative (TN), False Negative (FN), and F-measures to evaluate the DDoS detection model [<xref ref-type="bibr" rid="ref-14">14</xref>]. The main factors the DDoS model should provide are accuracy, False Acceptance Rate (FAR), sensitivity, and specificity. Measurement and accuracy are the main requirements for DDoS detection models [<xref ref-type="bibr" rid="ref-15">15</xref>]. The study in [<xref ref-type="bibr" rid="ref-16">16</xref>] used accuracy as a key indicator for comparison among the DDoS detection models. While the study by [<xref ref-type="bibr" rid="ref-17">17</xref>] relied on the misclassification rate to determine the best DDoS detection models [<xref ref-type="bibr" rid="ref-18">18</xref>], the detection rate and FP rate were used to assess and benchmark these models. It is challenging to compare DDoS detection models across multiple evaluation criteria simultaneously, and the benchmarking process is hindered by the difficulty of comparing different criteria that involve trade-offs and disputes [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>Two primary factors must be considered when assessing the effectiveness of DDoS detection models: reliability and computational complexity [<xref ref-type="bibr" rid="ref-19">19</xref>]. Nevertheless, the existing method of comparing the proposed model with previous models in the reviewed studies fails to consider all evaluation and benchmarking criteria. Instead, it focuses solely on one review aspect, overlooking the others. This approach lacks flexibility in addressing the conflict or tradeoff between the requirements [<xref ref-type="bibr" rid="ref-20">20</xref>,<xref ref-type="bibr" rid="ref-21">21</xref>]. The contradictory nature of the situation and the tradeoff involved are the primary challenges encountered while evaluating and measuring DDoS detection methods [<xref ref-type="bibr" rid="ref-22">22</xref>&#x2013;<xref ref-type="bibr" rid="ref-24">24</xref>].</p>
<p>The second problem that impacted the evaluation and benchmarking process was the significance of each criterion. When evaluating DDoS detection models, multiple criteria are considered, and the relevance of each criterion varies depending on the specific objectives of the model. However, the significance of one evaluation criterion may be heightened while reducing the importance of another criterion, depending on the model&#x2019;s aims [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>]. Hence, a necessary compromise and clash will arise between assessment and benchmarking standards due to the varying significance of each criterion in distinct models [<xref ref-type="bibr" rid="ref-26">26</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>]. A challenge occurs during the benchmarking process of DDoS detection models when many criteria and sub-criteria are considered simultaneously [<xref ref-type="bibr" rid="ref-28">28</xref>,<xref ref-type="bibr" rid="ref-29">29</xref>]. This challenge is attributed to the tradeoff between the requirements, each of which holds varying degrees of importance [<xref ref-type="bibr" rid="ref-30">30</xref>&#x2013;<xref ref-type="bibr" rid="ref-33">33</xref>]. Previously, Multi-Criteria Decision-Making (MCDM) may have been considered appropriate for these purposes [<xref ref-type="bibr" rid="ref-34">34</xref>,<xref ref-type="bibr" rid="ref-35">35</xref>]. Various techniques can be used to manage MCDM and solve practical problems. These methods help structure issues for Decision Makers (DMs) and analyze, rank, sort, and score many alternatives [<xref ref-type="bibr" rid="ref-36">36</xref>&#x2013;<xref ref-type="bibr" rid="ref-39">39</xref>].</p>
<p>This study employed the Fuzzy Weighted Zero Inconsistency Criterion (FWZIC) to calculate the weights of evaluation criteria, as it yields more consistent results than the Analytical Hierarchy Process (AHP) and other MCDM weighting methods. Additionally, benchmarking and ranking alternatives were performed using the Multi-Attributive Border Approximation Area Comparison (MABAC) method, one of the most widely applied methods for solving MCDM problems [<xref ref-type="bibr" rid="ref-39">39</xref>]. Additionally, MABAC ranks accurately and quickly, enabling the selection of optimal options with precision. Much of the research reviewed demonstrated that FWZIC yields satisfactory utility values when combined with MABAC because both methods can effectively handle uncertainties related to the problem statement. Neither FWZIC nor MABAC requires much user experience, even for those unfamiliar with MCDM literature. It is recommended that MABAC be employed in conjunction with various scenarios, such as individual and group situations [<xref ref-type="bibr" rid="ref-35">35</xref>]. Two primary decision-making situations are emphasized: the first scenario involves a single decision-maker. Group Decision-Making (GDM) involves multiple decision-makers [<xref ref-type="bibr" rid="ref-40">40</xref>]. GDM refers to a situation in which individuals collaboratively select choices from a set of options. No member of the group is affected by the decision. Individual and group dynamics, including social factors, influence the outcome. The methodologies employed in collective decision-making systematically collect and incorporate elements from experts, encompassing their expertise across multiple areas. Regarding group cases, each expert is presented with judgment criteria that require subjective assessment.</p>
<p>Furthermore, as shown before, the expert assigns a specific weight to each criterion. Ultimately, the assessment and comparison of DDoS detection models indicate a requirement to incorporate FWZIC and MABAC methods. The proposal entails assigning weights to criteria (reliability, time complexity rate).</p>
<p>The motivation is that attacks require detection efficiency. Many classifiers work to detect attacks. However, selecting the most suitable classifier based on several criteria is challenging. Choosing the best is considered one of the primary motivations for this study; this selection will undoubtedly contribute to improving the speed and accuracy of detection.</p>
<p>The primary aim of this study is to propose a framework for enhancing, evaluating, and benchmarking DDoS detection classifiers. This study is organized into four sections. <xref ref-type="sec" rid="s1">Section 1</xref> establishes the theoretical framework, including the proposed solution. <xref ref-type="sec" rid="s2">Section 2</xref> offers evaluation and benchmarking procedures. <xref ref-type="sec" rid="s3">Section 3</xref> analyzes the findings, validates them, and discusses the proposed methodology. <xref ref-type="sec" rid="s4">Section 4</xref> provides a brief overview of the research.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Materials and Methods</title>
<p><xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the components of the proposed framework.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The proposed framework</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_62413-fig-1.tif"/>
</fig>
<p>The proposed framework <xref ref-type="fig" rid="fig-1">Fig. 1</xref> is divided into three parts: the decision matrix, the FWZIC method, and the MABAC method. They will be explained in detail below.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Evaluation and Benchmarking of DDOS Attack Detection Classifiers through the Integration of FWZIC and MABAC Methods</title>
<p>The evaluation and benchmarking framework that was developed relies on MCDM techniques. This study&#x2019;s strategy is formulated by combining FWZIC to assign weights and MABAC for ranking, enabling the identification of optimal alternatives within the suggested decision matrix. The literature analysis on MCDM techniques highlights FWZIC and MABAC as suitable methods for benchmarking and ranking DDoS detection models. The mathematical model of MABAC is proposed for addressing specific issues, such as simultaneously handling multiple evaluation criteria within the suggested decision matrix, even in cases of conflict among the requirements. Furthermore, FWZIC is utilized to assign weights to criteria, addressing the understanding of the significance of these criteria within the proposed decision matrix. Therefore, integrating FWZIC and MABAC methodologies is suitable for assessing and comparing DDoS detection models and their hierarchical ranking.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Suggested Decision Matrix</title>
<p><xref ref-type="table" rid="table-1">Table 1</xref> shows the suggested decision matrix. The rows represent the classifier&#x2019;s metrics (criteria), while the columns represent the classifiers (alternatives). The values of this matrix are obtained after executing the first part of <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>The decision matrix</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Alternatives</th>
<th>C1</th>
<th>C2</th>
<th>Cn</th>
</tr>
</thead>
<tbody>
<tr>
<td>A1</td>
<td>(A1, C1)</td>
<td>(A1, C2)</td>
<td>(A1, Cn)</td>
</tr>
<tr>
<td>A2</td>
<td>(A2, C1)</td>
<td>(A2, C2)</td>
<td>(A2, Cn)</td>
</tr>
<tr>
<td>An</td>
<td>(An, C1)</td>
<td>(An, C2)</td>
<td>(An, Cn)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>To get the decision matrix. The CiC-DDoS2019 dataset has been used. Preprocessing this dataset may reveal irregularities, missing values, outliers, and similar issues that necessitate correction before analysis or modeling endeavors (see <xref ref-type="fig" rid="fig-2">Fig. 2</xref>). After processing the dataset, it was divided into two parts: 80% for training and 20% for testing.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Steps to obtain the suggested decision matrix</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_62413-fig-2.tif"/>
</fig>
<p>Different five machine learning algorithms, DPRCT, SVM, LR, NB, KNN, and Stacked Classifiers (SCs), were used to train and test the CiC-DDoS2019 dataset; SC is an ensemble technique that aims at improving the accuracy of results in models by combining multiple classifiers instead of using a single classifier [<xref ref-type="bibr" rid="ref-35">35</xref>]. After that, a set of metrics (ACC, REC, F1, and T) was applied to the classifiers to assess their quality and performance criteria. The decision matrix can be constructed from the measurements obtained. All work was done using Python.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Applying the FWZIC Method for Assigning Criteria Weights</title>
<p>The second part of <xref ref-type="fig" rid="fig-1">Fig. 1</xref> represents the implementation of the FWZIC method, which can be summarized in five steps as follows:
<list list-type="simple">
<list-item><label>1.</label><p>Collection of evaluation criteria (from the decision matrix)
<list list-type="simple">
<list-item><label>&#x2022;</label>
<p>Examination of the pre-agreed set of evaluation criteria.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Classify all the criteria, sub-criteria, and relevant indicators based on their behavioral patterns and the assessment employed.</p></list-item>
</list></p></list-item>
<list-item><label>2.</label><p>The technique of Structured Expert Judgment (SEJ)
<list list-type="simple">
<list-item><label>&#x2022;</label>
<p>Identify Experts: The term &#x2018;expert&#x2019; cannot be defined by any quantitative measure of resident knowledge. In this context, the term &#x2018;expert in a given subject&#x2019; refers to an individual who possesses specialized knowledge in a specific field and is recognized by others as an authority.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Select Experts: Following the identification of the collection of experts, the selection process for the experts to be utilized in the study is undertaken. Broadly speaking, selecting at least four specialists for a specific subject is necessary.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Develop the Evaluation Form: Creating an assessment form is essential, as it is a tool for gathering expert consensus.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Experts are identified and selected in the relevant subject domains (e.g., DDoS detection models) to evaluate and determine the importance of the criteria. A SEJ panel has been created, and a form has been designed to gather the collective agreement of all SEJ panelists for each criterion.</p></list-item>
</list></p></list-item>
</list></p>
<p>Transforming a language scale into a corresponding numerical scale is necessary to facilitate further research. Therefore, during this stage, the experts reported that the level of importance or significance for each criterion on the Likert linguistic scale is transformed into a corresponding numerical scale, as depicted in <xref ref-type="table" rid="table-2">Table 2</xref>. The Likert scale is predicated on the notion that varying levels of relevance are associated with the evaluation criteria. The spectrum of importance levels spans from the lowest to the highest.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>The criteria&#x2019;s importance</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Numerical scoring scale</th>
<th>Linguistic scoring scale</th>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>Not important</td>
</tr>
<tr>
<td>2</td>
<td>Slightly important</td>
</tr>
<tr>
<td>3</td>
<td>Moderately important</td>
</tr>
<tr>
<td>4</td>
<td>Important</td>
</tr>
<tr>
<td>5</td>
<td>Very important</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><list list-type="simple">
<list-item><label>3.</label><p>Constructing the evaluation decision matrix</p></list-item>
</list></p>
<p>During this process, the evaluation decision matrix is fabricated. <xref ref-type="table" rid="table-3">Table 3</xref> presents the fundamental components of this matrix, including the criteria and alternatives.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>The evaluation decision matrix</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Experts</th>
<th colspan="3">Criteria</th>
</tr>
<tr>
<th>C1</th>
<th>C2</th>
<th>Cn</th>
</tr>
</thead>
<tbody>
<tr>
<td>E1</td>
<td>Imp&#x002A;(E1/C1)</td>
<td>Imp(E1/C2)</td>
<td>Imp(E1/Cn)</td>
</tr>
<tr>
<td>E2</td>
<td>Imp(E2/C1)</td>
<td>Imp(E2/C2)</td>
<td>Imp(E2/Cn)</td>
</tr>
<tr>
<td>E3</td>
<td>Imp(E3/C1)</td>
<td>Imp(E3/C2)</td>
<td>Imp(E3/Cn)</td>
</tr>
<tr>
<td>Em</td>
<td>Imp(Em/C1)</td>
<td>Imp(Em/C2)</td>
<td>Imp(Em/Cn)</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-3fn1" fn-type="other">
<p>Note: &#x002A; The variable &#x201C;Imp&#x201D; denotes the level of importance.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p><list list-type="simple">
<list-item><label>4.</label><p>Utilization of a decentralized membership function</p></list-item>
</list></p>
<p>The fuzzy membership function is applied to the data of the previous step, followed by a defuzzification procedure. This transformation aims to enhance precision and facilitate further data analysis. The fuzzy technique offers the benefit of handling unclear situations by employing ambiguous numbers instead of crisp ones to ascertain the relative value of the criteria. Due to their conceptual and computational simplicity, the primary type of fuzzy number used in fuzzy MCDM is the Triangular Fuzzy Number (TFN). The TFNs are represented as A &#x003D; (a, b, c), as shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The triangular fuzzy numbers (TFNs)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_62413-fig-3.tif"/>
</fig>
<p>The TFN membership function <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is defined as:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mtext>A</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mtd><mml:mtd /></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>b</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>b</mml:mtext></mml:mrow></mml:mtd><mml:mtd /></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>b</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>b</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;where</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>b</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow></mml:mtd><mml:mtd /></mml:mtr><mml:mtr><mml:mtd /><mml:mtd /></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Based on the findings shown in <xref ref-type="table" rid="table-4">Table 4</xref>, it is recommended that all linguistic variables be converted into triangular fuzzy numbers. This translation assumes that the fuzzy number is equivalent to the variable linked to each criterion for expert K.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Linguistic terms and their equivalent (TFNs)</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Linguistic terms</th>
<th>TFNs</th>
</tr>
</thead>
<tbody>
<tr>
<td>Not important</td>
<td>(0.00, 0.10, 0.30)</td>
</tr>
<tr>
<td>Slight important</td>
<td>(0.10, 0.30, 0.50)</td>
</tr>
<tr>
<td>Moderately important</td>
<td>(0.30, 0.50, 0.75)</td>
</tr>
<tr>
<td>Important</td>
<td>(0.50, 0.75, 0.90)</td>
</tr>
<tr>
<td>Very important</td>
<td>(0.75, 0.90, 1.00)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><list list-type="simple">
<list-item><label>5.</label><p>Make the weight coefficients associated with the evaluation criteria ultimate values</p></list-item>
</list></p>
<p>The weight coefficients for the evaluation criteria <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are concluded using the fuzzification data acquired in the preceding step. The ratio of fuzzification data can be calculated using <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>, which is commonly employed in conjunction with TFNs, as illustrated in <xref ref-type="table" rid="table-5">Table 5</xref>.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Fuzzy expert decision matrix</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Experts</th>
<th colspan="3">Criteria</th>
</tr>
<tr>
<th><inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mrow><mml:mtext mathvariant="bold">1</mml:mtext></mml:mrow></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mrow><mml:mtext mathvariant="bold">2</mml:mtext></mml:mrow></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td>E1</td>
<td><inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
</tr>
<tr>
<td>E2</td>
<td><inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
</tr>
<tr>
<td>Em</td>
<td><inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mtext>Imp</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>E</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p><italic>k</italic> is the number of criteria, <italic>m</italic> &#x003D; 1, 2, 3 (the current expert), <italic>n</italic> &#x003D; 1, 2, 3 (the current criteria).</p>
<p>The mean values must be found to get the values of the evaluation criteria&#x2019;s weight coefficients <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mo stretchy="false">(</mml:mo><mml:mi>w</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. Each column in the fuzzy expert decision matrix in <xref ref-type="table" rid="table-5">Table 5</xref> has its elements added together, and the sum is divided by the number of experts. For instance, <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:math></inline-formula> will represent the final fuzzy weight of the criteria <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:math></inline-formula>.</p>

</sec>
<sec id="s2_4">
<label>2.4</label>
<title>MABAC for Benchmarking and Ranking DDoS Detection Models</title>
<p>Compared to the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and VlseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR) methods, MABAC is a recent method introduced MABAC is grounded in the measurement of the distance of alternatives from the Border Approximation Area (BAA). It follows a systematic process with a straightforward computational procedure, making it competent in addressing real-world decision-making problems. The steps of the MABAC method are as follows:
<list list-type="simple">
<list-item><label>1.</label><p>Get the decision matrix obtained from <xref ref-type="sec" rid="s2_1">Section 2.1</xref>.</p></list-item>
<list-item><label>2.</label><p>Normalizing the decision matrix.</p>
<p><xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>. For beneficial criteria (ACC, PREC, REC, and F1):<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>z</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula>
<xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>. For non-beneficial criteria (T):
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>z</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula>
where <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula>) represents the current element of the decision matrix, while min and max represent the highest and lowest values for the same criterion.</p></list-item>
<list-item><label>3.</label><p>Determine the weighted normalized decision matrix as in <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>.
<list list-type="simple">
<list-item><label>&#x2022;</label>
<p>Assign weights <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>W</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula> to each criterion.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Compute the weighted normalized values:</p></list-item>
</list>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mi>W</mml:mi><mml:mi>j</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:math></disp-formula></p>
</list-item>
</list></p>
<p>The weight values obtained from the FWZIC method will be multiplied by the normalized decision matrix. <xref ref-type="table" rid="table-6">Table 6</xref> shows the output of the decision matrix.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Weighted normalized decision matrix [<xref ref-type="bibr" rid="ref-41">41</xref>,<xref ref-type="bibr" rid="ref-42">42</xref>]</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Alternatives</th>
<th colspan="5">Criteria</th>
</tr>
<tr>
<th>ACC</th>
<th>PREC</th>
<th>REC</th>
<th>F1</th>
<th>T</th>
</tr>
</thead>
<tbody>
<tr>
<td>DT</td>
<td>ACC (1) &#x2217; <italic>w</italic>1</td>
<td>PREC (1) &#x2217; <italic>w</italic>2</td>
<td>REC (1) &#x2217; <italic>w</italic>3</td>
<td>F1 (1) &#x2217; <italic>w</italic>4</td>
<td>T (1) &#x2217; <italic>w</italic>5</td>
</tr>
<tr>
<td>SVM</td>
<td>ACC (2) &#x2217; <italic>w</italic>1</td>
<td>PREC (2) &#x2217; <italic>w</italic>2</td>
<td>REC (2) &#x2217; <italic>w</italic>3</td>
<td>F1 (2) &#x2217; <italic>w</italic>4</td>
<td>T (2) &#x2217; <italic>w</italic>5</td>
</tr>
<tr>
<td>LR</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
</tr>
<tr>
<td>NB</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
</tr>
<tr>
<td>KNN</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
<td>&#x2013;&#x2013;</td>
</tr>
<tr>
<td>SC</td>
<td>ACC (<italic>n</italic>) &#x2217; <italic>w</italic>1</td>
<td>PREC (<italic>n</italic>) &#x2217; <italic>w</italic>2</td>
<td>REC (<italic>n</italic>) &#x2217; <italic>w</italic>3</td>
<td>F1 (<italic>n</italic>) &#x2217; <italic>w</italic>4</td>
<td>T (<italic>n</italic>) &#x2217; <italic>w</italic>5</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-6fn1" fn-type="other">
<p>Note: <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mtext>and</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>w</mml:mi><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are the weights obtained from the FWZIC method for each criterion <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>ACC</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;PRC</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;REC</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;and</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> in sequence.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p><list list-type="simple">
<list-item><label>4.</label><p>Calculate the border approximation area (BAA).</p>
<p>For simplicity, let us assume the BAA is the mean value of the weighted normalized decision matrix for each criterion by applying <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>. <xref ref-type="table" rid="table-7">Table 7</xref> shows the BAA matrix.<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>G</mml:mi><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>G</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula> represents the current element of a BAA array.</p>
<p><inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mo>&#x2211;</mml:mo><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula> The sum of elements of column j for the weighted normalized decision matrix.</p>
<p><inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>N</mml:mi></mml:math></inline-formula> The number of alternatives.</p></list-item>
<list-item><label>5.</label><p>Compute the distance of each alternative from the BAA as in <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>.</p>
<p>Calculate the distance <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>Q</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula>:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>Q</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>G</mml:mi><mml:mi>j</mml:mi></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mi>j</mml:mi></mml:math></inline-formula> represents the current element of the weighted normalized decision matrix.</p></list-item>
<list-item><label>6.</label><p>Rank the alternatives.
<list list-type="simple"><list-item><label>&#x2022;</label><p>Compute the overall performance score for each alternative.<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>Q</mml:mi><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mi>Q</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>Q</mml:mi><mml:mi>i</mml:mi></mml:math></inline-formula> represents the sum of the elements of each row in the matrix.</p></list-item></list></p></list-item>
</list></p>

<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>BAA matrix [<xref ref-type="bibr" rid="ref-42">42</xref>,<xref ref-type="bibr" rid="ref-43">43</xref>]</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<tbody>
<tr>
<td><inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>G</mml:mi><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>G</mml:mi><mml:mn>2</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:mi>C</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>G</mml:mi><mml:mn>3</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:mi>C</mml:mi><mml:mn>3</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>G</mml:mi><mml:mn>4</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:mi>C</mml:mi><mml:mn>4</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>G</mml:mi><mml:mn>5</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:mi>C</mml:mi><mml:mn>5</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Rank the alternatives in descending order of <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>Q</mml:mi><mml:mi>i</mml:mi></mml:math></inline-formula>, where a higher score indicates a better alternative.</p>
<p><xref ref-type="table" rid="table-8">Table 8</xref> presents the algorithm of the proposed work, which is divided into three sections. The first section explains how to obtain the decision matrix, the second section shows the FWZIC method, and the third section offers the MABAC method.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Proposed work algorithm</title>
</caption>
<table>
<colgroup>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td><bold>Step 1: Decision matrix</bold></td>
</tr>
<tr>
<td>&#x2003;1. <bold>Input:</bold> DDoS attack dataset (CiC-DDoS2019).</td>
</tr>
<tr>
<td>&#x2003;2. <bold>Preprocess</bold> the dataset to clean and structure the data.</td>
</tr>
<tr>
<td>&#x2003;3. <bold>Split</bold> the dataset into training and testing sets.</td>
</tr>
<tr>
<td>&#x2003;4. <bold>Train and test</bold> machine learning (ML) algorithms.</td>
</tr>
<tr>
<td>&#x2003;5. <bold>Evaluate</bold> criteria based on the ML model results.</td>
</tr>
<tr>
<td>&#x2003;6. <bold>Generate</bold> the decision matrix.</td>
</tr>
<tr>
<td><bold>Step 2: FWZIC</bold></td>
</tr>
<tr>
<td>&#x2003;7. <bold>Define</bold> a set of decision criteria.</td>
</tr>
<tr>
<td>&#x2003;8. <bold>Assign</bold> an expert numerical scale to the criteria.</td>
</tr>
<tr>
<td>&#x2003;9. <bold>Convert</bold> the expert numerical scale into a fuzzy scale.</td>
</tr>
<tr>
<td>&#x2003;10. <bold>Normalize</bold> the fuzzy scale values.</td>
</tr>
<tr>
<td>&#x2003;11. <bold>Compute</bold> the final weights of the criteria.</td>
</tr>
<tr>
<td><bold>Step 3: MABAC</bold></td>
</tr>
<tr>
<td>&#x2003;12. <bold>Input:</bold> Decision matrix and final weights.</td>
</tr>
<tr>
<td>&#x2003;13. <bold>Normalize</bold> the decision matrix.</td>
</tr>
<tr>
<td>&#x2003;14. <bold>Find</bold> the weighted normalized decision matrix.</td>
</tr>
<tr>
<td>&#x2003;15. <bold>Compute</bold> the border approximation area matrix.</td>
</tr>
<tr>
<td>&#x2003;16. <bold>Calculate</bold> the distance to the border approximation area.</td>
</tr>
<tr>
<td>&#x2003;17. <bold>Rank</bold> the alternatives based on computed distances.</td>
</tr>
<tr>
<td><bold>Output:</bold></td>
</tr>
<tr>
<td>&#x2003;18. <bold>Obtain</bold> ranked alternatives for decision-making.</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Results</title>
<p>The results of the suggested framework are as follows: <xref ref-type="sec" rid="s3_1">Section 3.1</xref> presents the evaluation findings of the proposed decision matrix. <xref ref-type="sec" rid="s3_2">Section 3.2</xref> presents the outcomes of the FWZIC, which are used to calculate the weight of the evaluation criteria. <xref ref-type="sec" rid="s3_3">Section 3.3</xref> presents the findings of MABAC for benchmarking and rating the outcomes of DDoS detection models.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Results of the Classifiers and the Decision Matrix</title>
<p>The current section presents the results of six classifiers evaluated according to the identified criteria in <xref ref-type="table" rid="table-9">Table 9</xref>. The numerical values in the matrix cells represent the performance values of each detection classifier, depending on the corresponding criteria.</p>
<table-wrap id="table-9">
<label>Table 9</label>
<caption>
<title>Decision matrix results</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Alternatives</th>
<th colspan="5">Criteria</th>
</tr>
<tr>
<th>ACC</th>
<th>PREC</th>
<th>REC</th>
<th>F1</th>
<th>T</th>
</tr>
</thead>
<tbody>
<tr>
<td>DT</td>
<td>93.11</td>
<td>93.12</td>
<td>93.11</td>
<td>93.11</td>
<td>15.7</td>
</tr>
<tr>
<td>SVM</td>
<td>99.32</td>
<td>99.33</td>
<td>99.32</td>
<td>99.32</td>
<td>9.1</td>
</tr>
<tr>
<td>LR</td>
<td>99.13</td>
<td>99.14</td>
<td>99.13</td>
<td>99.13</td>
<td>12.5</td>
</tr>
<tr>
<td>NB</td>
<td>76.22</td>
<td>75.25</td>
<td>76.22</td>
<td>80.02</td>
<td>4.1</td>
</tr>
<tr>
<td>KNN</td>
<td>97.82</td>
<td>97.81</td>
<td>97.82</td>
<td>97.84</td>
<td>3.9</td>
</tr>
<tr>
<td>SC</td>
<td>99.57</td>
<td>99.46</td>
<td>99.45</td>
<td>99.45</td>
<td>143.5</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The SC with the classification group (DT, SVM, LR, and KNN) outperformed all other classifiers, achieving an accuracy of 99.57%, the highest value obtained in this study. The LR appears consistently in high-performing stacks, indicating its strength across different combinations and its effectiveness in complementing other classifiers. This analysis confirms that utilizing diverse classifiers in stacking can significantly enhance accuracy, underscoring the importance of carefully selecting model combinations to achieve optimal results. Conversely, the NB single classifier was more conservative, reaching the lowest accuracy of 76.22%. The algorithms are ordered from best to worst performance, according to accuracy: SC &#x003E; SVM &#x003E; LR &#x003E; KNN &#x003E; DT &#x003E; NB.</p>
<p>Regarding execution time, the KNN algorithm was the fastest (3.9 s), whereas the SC took the longest. It takes the longest (143.5 s) because it deals with several classifiers. This time is relatively long compared with the rest of the classifier implementation times. Also, this conflicts with one of the interests of this work, in which the time factor is essential for eliminating the attack as quickly as possible.</p>
<p>The superiority of the single linear SVM classifier over the other single classifiers highlights the dataset&#x2019;s inherently linear nature. This conclusion arises from the linear SVM&#x2019;s ability to effectively establish clear boundaries among different categories via linear techniques. Therefore, classifiers based on the linear data separation technique are the best choice for this problem. In contrast, the naive Bayes (NB) single classifier, which relies on a probabilistic approach, demonstrated the lowest performance with the given problem because it is incompatible with the dataset structure. This contradiction suggests the limitations of probability-based classifiers when applied to challenges of this nature.</p>
<p>All the other mixed classifiers accuracy values except the value of the combination &#x201C;DT &#x002B; SVM &#x002B; LR &#x002B; KNN&#x201D; are less than the accuracy value of the SVM single classifier (99.32%), so the work does not rely on them; also, their implementation time is larger than the SVM implementation time due to the integration of more than one classifier in <xref ref-type="table" rid="table-10">Table 10</xref>.</p>
<table-wrap id="table-10">
<label>Table 10</label>
<caption>
<title>Stacked classifiers ACC</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Stacked classifiers</th>
<th>Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td>DT &#x002B; SVM &#x002B; LR &#x002B; KNN</td>
<td>99.57%</td>
</tr>
<tr>
<td>DT &#x002B; SVM &#x002B; LR</td>
<td>99.22%</td>
</tr>
<tr>
<td>KNN &#x002B; NB</td>
<td>97.52%</td>
</tr>
<tr>
<td>LR &#x002B; NB</td>
<td>98.78%</td>
</tr>
<tr>
<td>LR &#x002B; KNN</td>
<td>98.73%</td>
</tr>
<tr>
<td>SVM &#x002B; NB</td>
<td>99.17%</td>
</tr>
<tr>
<td>SVM &#x002B; KNN</td>
<td>99.31%</td>
</tr>
<tr>
<td>DT &#x002B; NB</td>
<td>92.86%</td>
</tr>
<tr>
<td>DT &#x002B; SVM</td>
<td>99.17%</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>FWZIC results</title>
<p>The weights of the evaluation criteria utilize the FWZIC approach. The first process begins with FWZIC by identifying the evaluation criteria (ACC, PREC, REC, F1, and T). The relevance level of each evaluation criterion is determined by gathering the viewpoints of three professional specialists using a specially designed evaluation form. The recommendations provided by experts are subsequently converted into a standardized scoring scale, as seen in <xref ref-type="table" rid="table-4">Table 4</xref>, <xref ref-type="sec" rid="s2_2">Section 2.2</xref>. Afterward, the expert decision matrix (EDM) is built, as shown in <xref ref-type="table" rid="table-11">Table 11</xref>. The numbers in <xref ref-type="table" rid="table-11">Table 11</xref> indicate the significance levels for each evaluation attribute, as determined by expert judgment. As in step four of the FWZIC steps, the EDM is transformed into a Fuzzy Matrix, as illustrated in <xref ref-type="table" rid="table-12">Table 12</xref>. The procedure involves converting crisp values into fuzzy numbers with equal values. The final weight is ultimately determined by applying it throughout the defuzzification process. <xref ref-type="table" rid="table-13">Table 13</xref> displays the ultimate weights assigned to the five evaluation criteria of the DDoS detection models.</p>
<table-wrap id="table-11">
<label>Table 11</label>
<caption>
<title>The EDM</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Expert</th>
<th>Accuracy</th>
<th>Precision</th>
<th>Recall</th>
<th>F1 score</th>
<th>Time (s)</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>E1</bold></td>
<td>5</td>
<td>4</td>
<td>4</td>
<td>2</td>
<td>2</td>
</tr>
<tr>
<td><bold>E2</bold></td>
<td>5</td>
<td>4</td>
<td>4</td>
<td>3</td>
<td>3</td>
</tr>
<tr>
<td><bold>E3</bold></td>
<td>4</td>
<td>4</td>
<td>4</td>
<td>3</td>
<td>3</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-12">
<label>Table 12</label>
<caption>
<title>Fuzzy-EDM</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Expert</th>
<th>Accuracy</th>
<th>Precision</th>
<th>Recall</th>
<th>F1 score</th>
<th>Time (s)</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>E1</bold></td>
<td>(0.75, 0.9, 1)</td>
<td>(0.5, 0.75, 0.9)</td>
<td>(0.5, 0.75, 0.9)</td>
<td>(0.1, 0.3, 0.5)</td>
<td>(0.1, 0.3, 0.5)</td>
</tr>
<tr>
<td><bold>E2</bold></td>
<td>(0.75, 0.9, 1)</td>
<td>(0.5, 0.75, 0.9)</td>
<td>(0.5, 0.75, 0.9)</td>
<td>(0.3, 0.5, 0.75)</td>
<td>(0.3, 0.5, 0.75)</td>
</tr>
<tr>
<td><bold>E3</bold></td>
<td>(0.5, 0.75, 0.9)</td>
<td>(0.5, 0.5, 0.9)</td>
<td>(0.5, 0.75, 0.9)</td>
<td>(0.3, 0.5, 0.75)</td>
<td>(0.3, 0.5, 0.75)</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-13">
<label>Table 13</label>
<caption>
<title>Final weights</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Evaluation criteria</th>
<th>Weight</th>
</tr>
</thead>
<tbody>
<tr>
<td>T</td>
<td>0.2585</td>
</tr>
<tr>
<td>ACC</td>
<td>0.22833</td>
</tr>
<tr>
<td>PREC</td>
<td>0.22027</td>
</tr>
<tr>
<td>REC</td>
<td>0.14647</td>
</tr>
<tr>
<td>F1</td>
<td>0.14644</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The final weights indicate that all experts have close opinions in <xref ref-type="table" rid="table-9">Table 9</xref>. The highest weight values correspond to time and accuracy, two crucial elements in detecting DDoS attacks. Coordination between these two criteria is essential. High accuracy is required in detecting the attacks, but the time the classifier takes during the detection is also crucial. This dispute is referred to as a &#x201C;criteria conflict&#x201D;, which involves calibrating all criteria to achieve optimal results.</p>

</sec>
<sec id="s3_3">
<label>3.3</label>
<title>MABAC Results</title>
<p>The MABAC method calculates the ranking of the DDoS detection models based on determined criteria. The MABAC results are in <xref ref-type="table" rid="table-14">Table 14</xref>. They demonstrate that the SVM algorithms achieved the best ranking among other algorithms. This algorithm is the most suitable for our work (DDoS attack detection) because it has high accuracy and a short execution time compared to other algorithms.</p>
<table-wrap id="table-14">
<label>Table 14</label>
<caption>
<title>Detection models ranking results</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Detection models</th>
<th>Score</th>
<th>Rank</th>
</tr>
</thead>
<tbody>
<tr>
<td>SVM</td>
<td>0.04440</td>
<td>6</td>
</tr>
<tr>
<td>KNN</td>
<td>0.01518</td>
<td>5</td>
</tr>
<tr>
<td>LR</td>
<td>0.01366</td>
<td>4</td>
</tr>
<tr>
<td>DT</td>
<td>0.01356</td>
<td>3</td>
</tr>
<tr>
<td>SC</td>
<td>0.01182</td>
<td>2</td>
</tr>
<tr>
<td>NB</td>
<td>0.00184</td>
<td>1</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>So after training and testing with the CiCDDoS2019 dataset, passing them to many classifiers, taking the opinions of the experts, and putting it all in MCDM, it turns out that the SVM classifier is the most ideal for working in the environment of DDoS attacks, no wonder, it has many characteristics and good compatibility between all criteria so, the sound tuning of this classifier has made it stand out from the rest. This result, in turn, does not diminish the status of the other classifiers; if the goal is high detection accuracy, then the SC classifier can be chosen, of course, provided the time factor is not a significant concern in this case.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Validation</title>
<p>Below is a description of the two methods used to verify the results.</p>
<sec id="s3_4_1">
<label>3.4.1</label>
<title>Objective Validation</title>
<p>Objective validation is a step that validates the work we have done. The classifiers were divided into two groups: Group 1, comprising SC, NB, and DT, and Group 2, consisting of LR, SVM, and KNN. The average and variance for each group were calculated. In general, the objective validation results, as presented in <xref ref-type="table" rid="table-15">Table 15</xref>, indicate that the average and variance values provide evidence supporting the validity and systematic ranking of the groups, as determined by the MABAC results of the DDoS detection models. It shows that SVM remained within the group with lower average and variance values in <xref ref-type="table" rid="table-15">Table 15</xref>.</p>
<table-wrap id="table-15">
<label>Table 15</label>
<caption>
<title>Objective validation results</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Alternatives</th>
<th>Accuracy</th>
<th>Precision</th>
<th>Recall</th>
<th>F1 score</th>
<th>Time</th>
<th></th>
<th></th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>SC</bold></td>
<td style="background:#F2F2F2;">0.995700</td>
<td style="background:#F2F2F2;">0.994600</td>
<td style="background:#F2F2F2;">0.994500</td>
<td style="background:#F2F2F2;">0.994500</td>
<td style="background:#F2F2F2;">0.996500</td>
<td></td>
<td></td>
</tr>
<tr>
<td><bold>NB</bold></td>
<td style="background:#F2F2F2;">0.765492</td>
<td style="background:#F2F2F2;">0.243414</td>
<td style="background:#F2F2F2;">0.233585</td>
<td style="background:#F2F2F2;">0.195375</td>
<td style="background:#F2F2F2;">0.028571</td>
<td></td>
<td></td>
</tr>
<tr>
<td><bold>DT</bold></td>
<td style="background:#F2F2F2;">0.935121</td>
<td style="background:#F2F2F2;">0.063744</td>
<td style="background:#F2F2F2;">0.063751</td>
<td style="background:#F2F2F2;">0.063751</td>
<td style="background:#F2F2F2;">0.109408</td>
<td></td>
<td></td>
</tr>
<tr>
<td></td>
<td>0.9002042</td>
<td>0.102386</td>
<td>0.099112</td>
<td>0.0863753</td>
<td>0.3793263</td>
<td><bold>Average</bold></td>
<td>0.3134808</td>
</tr>
<tr>
<td></td>
<td>0.1210906</td>
<td>0.126224</td>
<td>0.1207406</td>
<td>0.099633</td>
<td>0.5390366</td>
<td><bold>Variance</bold></td>
<td>0.201345</td>
</tr>
<tr>
<td><bold>LR</bold></td>
<td style="background:#F2F2F2;">0.995581</td>
<td style="background:#F2F2F2;">0.003217</td>
<td style="background:#F2F2F2;">0.003218</td>
<td style="background:#F2F2F2;">0.003218</td>
<td style="background:#F2F2F2;">0.087108</td>
<td></td>
<td></td>
</tr>
<tr>
<td><bold>SVM</bold></td>
<td style="background:#F2F2F2;">0.997489</td>
<td style="background:#F2F2F2;">0.001307</td>
<td style="background:#F2F2F2;">0.001307</td>
<td style="background:#F2F2F2;">0.001307</td>
<td style="background:#F2F2F2;">0.063415</td>
<td></td>
<td></td>
</tr>
<tr>
<td><bold>KNN</bold></td>
<td style="background:#F2F2F2;">0.982424</td>
<td style="background:#F2F2F2;">0.01659</td>
<td style="background:#F2F2F2;">0.01639</td>
<td style="background:#F2F2F2;">0.016189</td>
<td style="background:#F2F2F2;">0.027178</td>
<td></td>
<td></td>
</tr>
<tr>
<td></td>
<td>0.9918315</td>
<td>0.007038</td>
<td>0.0069717</td>
<td>0.0069047</td>
<td>0.0592337</td>
<td><bold>Average</bold></td>
<td>0.2143959</td>
</tr>
<tr>
<td></td>
<td>0.0082025</td>
<td>0.0083272</td>
<td>0.0082123</td>
<td>0.008097</td>
<td>0.030183</td>
<td><bold>Variance</bold></td>
<td>0.0126044</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_4_2">
<label>3.4.2</label>
<title>Sensitivity Analysis</title>
<p>Sensitivity Analysis examination in MCDM helps to understand the stability and robustness of the proposed solution and comprehend which parameter changes affect preferences for alternatives. It shows how various conditions influence the stability of ranking in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Sensitivity analysis</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_62413-fig-4.tif"/>
</fig>
<p>It shows the alternatives and their rankings for the proposed solution and the other three scenarios in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. As seen in all scenarios, the experts agreed that the proposed solution yielded the best result for the SVM classifier, which ranked 6th. Their opinions again agreed with our proposed solution regarding the NB classifier, which took the lowest rank (1). As for the remaining classifiers (DT, LR, KNN, and SC), the experts&#x2019; opinions varied. For instance, the rank of the DT was not fixed in all scenarios with the proposed solution; it took ranks 2, 3, and 4. The same goes for the remaining classifiers (LR, KNN, and SC). It changes in all scenarios, indicating their susceptibility to alterations in terms of criterion or weight.</p>

</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>The infected devices used in DDoS attacks act as soldiers, executing commands from an attacker simultaneously. This attack exhausts the server&#x2019;s resources, preventing legitimate users from accessing it or making it invisible. A considerable amount of research has been conducted in this field; however, selecting the appropriate classifier for the current work is challenging, particularly when multiple criteria are involved. It cannot depend on a classifier that achieves high accuracy while ignoring other criteria.</p>
<p>Therefore, the contribution of this research was to enhance the accuracy of the detection by adding the stacked classifier, benchmarking, and evaluating (choosing the best among a group of classifiers) by using two methods of the MCDM, which are FWZIC and MABAC, under the presence of several criteria (accuracy, F1 score, Precision, Recall, and Time). A questionnaire was directed at three experts with a long history in cybersecurity to set the criteria weights. Two methods were also used to verify the results: objective validation and sensitivity analysis.</p>
<p>The FWZIC and MABAC methods proved that the SVM algorithm was superior to the rest and more suitable for the current work. Objective validation divided the classifiers into two groups. The average and variance were calculated for each group, where the SVM classifier was in the group with the lowest variance and average, so it is superior to the rest. Sensitivity Analysis also yielded the highest rank for the SVM classifier in all ranking scenarios, indicating that it is superior to the rest. This progress represents the benchmarking aspect of this work, which aims to select the most suitable classifier for the current study. Another notable achievement of this work was the Stacked classifier, which demonstrated that combining these algorithms (DT, SVM, LR, and KNN) yields the best results, with a high accuracy of 99.57%, representing a significant enhancement over this work.</p>
<p>FWZIC and MABAC have demonstrated their ability to select the most suitable classifiers based on several criteria, making them the most appropriate options in this field. Stacked classifiers achieve the highest accuracy due to their ability to integrate multiple models from each classifier. The SVM classifier is more efficient and superior to the rest due to its short execution time and high accuracy. Therefore, this classifier is handy for applications on high-priority websites, such as renowned e-commerce sites or those related to national security. For other websites, where time is not a critical factor, the stacked classifier can be used with high accuracy, albeit at the expense of time.</p>
<p>This study&#x2019;s limitations are the data set and classifiers used to make it more comprehensive. Another set of datasets and classifiers can be added to make the framework more comprehensive.</p>
</sec>
</body>
<back>
<ack>
<p>This study was produced from the doctoral thesis &#x0201C;Cyber Security Defense Mechanism against Distributed Denial of Service Attacks&#x0201D; at Karab&#x000FC;k University Graduate Education Institute.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Alaa Mahmood, &#x0130;sa Avc&#x0131;; data collection: Alaa Mahmood; analysis and interpretation of results: Alaa Mahmood, &#x0130;sa Avc&#x0131;; draft manuscript preparation: Alaa Mahmood, &#x0130;sa Avc&#x0131;. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The dataset is available at <ext-link ext-link-type="uri" xlink:href="https://www.unb.ca/cic/datasets/ddos-2019.html">https://www.unb.ca/cic/datasets/ddos-2019.html</ext-link> (accessed on 1 January 2025). The University of New Brunswick in Canada is affiliated with the Canadian Institute of Cybersecurity.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<glossary content-type="abbreviations" id="glossary-1">
<title>Abbreviations</title>
<def-list>
<def-item>
<term>DDoS</term>
<def>
<p>Distributed denial of service</p>
</def>
</def-item>
<def-item>
<term>MCDM</term>
<def>
<p>Multi-criteria decision making</p>
</def>
</def-item>
<def-item>
<term>FWZIC</term>
<def>
<p>Fuzzy weighted zero inconsistency criterion</p>
</def>
</def-item>
<def-item>
<term>MABAC</term>
<def>
<p>Multi-attributive border approximation area comparison</p>
</def>
</def-item>
<def-item>
<term>EDM</term>
<def>
<p>Expert decision matrix</p>
</def>
</def-item>
<def-item>
<term>BAA</term>
<def>
<p>Border approximation area</p>
</def>
</def-item>
<def-item>
<term>ML</term>
<def>
<p>Machine learning</p>
</def>
</def-item>
<def-item>
<term>DT, SVM, LR,</term>
<def>
<p>Decision tree, support vector machine, logistic regression,</p>
</def>
</def-item>
<def-item>
<term>KNN, NB, SC</term>
<def>
<p>k-nearest neighbor, naive bayes, stacked classifier</p>
</def>
</def-item>
<def-item>
<term>ACC, PREC, REC, F1, T</term>
<def>
<p>Accuracy, precision, recall, F1 score, time</p>
</def>
</def-item>
<def-item>
<term>TOPSIS</term>
<def>
<p>Technique for Order Preference by Similarity to Ideal Solution</p>
</def>
</def-item>
<def-item>
<term>VIKOR</term>
<def>
<p>VlseKriterijumska Optimizacija I Kompromisno Resenje</p>
</def>
</def-item>
</def-list>
</glossary>
<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><surname>Wani</surname> <given-names>S</given-names></string-name>, <string-name><surname>Imthiyas</surname> <given-names>M</given-names></string-name>, <string-name><surname>Almohamedh</surname> <given-names>H</given-names></string-name>, <string-name><surname>Alhamed</surname> <given-names>KM</given-names></string-name>, <string-name><surname>Almotairi</surname> <given-names>S</given-names></string-name>, <string-name><surname>Gulzar</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Distributed denial of service (DDoS) mitigation using blockchain&#x2014;a comprehensive insight</article-title>. <source>Symmetry</source>. <year>2021</year>;<volume>13</volume>(<issue>2</issue>):<fpage>227</fpage>. doi:<pub-id pub-id-type="doi">10.3390/sym13020227</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Roopak</surname> <given-names>M</given-names></string-name>, <string-name><surname>Tian</surname> <given-names>GY</given-names></string-name>, <string-name><surname>Chambers</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Multi-objective-based feature selection for DDoS attack detection in IoT networks</article-title>. <source>IET Netw</source>. <year>2020</year>;<volume>9</volume>(<issue>3</issue>):<fpage>120</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.1049/iet-net.2018.5206</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Koca</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ali Aydin</surname> <given-names>M</given-names></string-name>, <string-name><surname>Sertba&#x015F;</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zaim</surname> <given-names>AH</given-names></string-name></person-group>. <article-title>A new distributed anomaly detection approach for log IDS management based on deep learning</article-title>. <source>Turk J Elec Eng Comp Sci</source>. <year>2021</year>;<volume>29</volume>(<issue>5</issue>):<fpage>2486</fpage>&#x2013;<lpage>501</lpage>. doi:<pub-id pub-id-type="doi">10.3906/elk-2102-89</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Mishra</surname> <given-names>A</given-names></string-name>, <string-name><surname>Gupta</surname> <given-names>BB</given-names></string-name>, <string-name><surname>Joshi</surname> <given-names>RC</given-names></string-name></person-group>. <article-title>A comparative study of distributed denial of service attacks, intrusion tolerance and mitigation techniques</article-title>. In: <conf-name>2011 European Intelligence and Security Informatics Conference</conf-name>; <year>2011 Sep 12&#x2013;14</year>; <publisher-loc>Athens, Greece</publisher-loc>. p. <fpage>286</fpage>&#x2013;<lpage>9</lpage>. doi:<pub-id pub-id-type="doi">10.1109/EISIC.2011.15</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abhishta</surname> <given-names>A</given-names></string-name>, <string-name><surname>van Heeswijk</surname> <given-names>W</given-names></string-name>, <string-name><surname>Junger</surname> <given-names>M</given-names></string-name>, <string-name><surname>Nieuwenhuis</surname> <given-names>LJ</given-names></string-name>, <string-name><surname>Joosten</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Why would we get attacked? An analysis of attacker&#x2019;s aims behind DDoS attacks</article-title>. <source>J Wirel Mob Netw Ubiquitous Comput Dependable Appl</source>. <year>2020</year>;<volume>11</volume>(<issue>2</issue>):<fpage>3</fpage>&#x2013;<lpage>22</lpage>. doi:<pub-id pub-id-type="doi">10.22667/JOWUA.2020.06.30.003</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>J</given-names></string-name></person-group>. <article-title>DDoS defense systems in large enterprises: a comprehensive review of adoption, challenges, and strategies</article-title>. <source>J Artif Intell Mach Learn Manag</source>. <year>2018</year>;<volume>2</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>21</lpage>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Singh</surname> <given-names>R</given-names></string-name>, <string-name><surname>Tanwar</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>TP</given-names></string-name></person-group>. <article-title>Utilization of blockchain for mitigating the distributed denial of service attacks</article-title>. <source>Secur Priv</source>. <year>2020</year>;<volume>3</volume>(<issue>3</issue>):<fpage>e96</fpage>. doi:<pub-id pub-id-type="doi">10.1002/spy2.96</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Guntamukalla</surname> <given-names>DVR</given-names></string-name></person-group>. <source>Mitigation against distributed-denial of service attacks using distribution and self-learning aegis system [dissertation]</source>. <publisher-loc>Kingsville, TX, USA</publisher-loc>: <publisher-name>Texas A &#x0026; M University-Kingsville</publisher-name>; <year>2017</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ahmed Issa</surname> <given-names>AS</given-names></string-name>, <string-name><surname>Albayrak</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>DDoS attack intrusion detection system based on hybridization of CNN and LSTM</article-title>. <source>Acta Polytech Hung</source>. <year>2023</year>;<volume>20</volume>(<issue>2</issue>):<fpage>105</fpage>&#x2013;<lpage>23</lpage>. doi:<pub-id pub-id-type="doi">10.12700/APH.20.2.2023.2.6</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Ali</surname> <given-names>J</given-names></string-name>, <string-name><surname>Roh</surname> <given-names>BH</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>B</given-names></string-name>, <string-name><surname>Oh</surname> <given-names>J</given-names></string-name>, <string-name><surname>Adil</surname> <given-names>M</given-names></string-name></person-group>. <article-title>A machine learning framework for prevention of software-defined networking controller from DDoS attacks and dimensionality reduction of big data</article-title>. In: <conf-name>2020 International Conference on Information and Communication Technology Convergence (ICTC)</conf-name>; <year>2020 Oct 21&#x2013;23</year>; <publisher-loc>Jeju, Republic of Korea</publisher-loc>. p. <fpage>515</fpage>&#x2013;<lpage>9</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ictc49870.2020.9289504</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Uddin</surname> <given-names>R</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>SAP</given-names></string-name>, <string-name><surname>Chamola</surname> <given-names>V</given-names></string-name></person-group>. <article-title>Denial of service attacks in edge computing layers: taxonomy, vulnerabilities, threats and solutions</article-title>. <source>Ad Hoc Netw</source>. <year>2024</year>;<volume>152</volume>(<issue>11</issue>):<fpage>103322</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.adhoc.2023.103322</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Avc&#x0131;</surname> <given-names>&#x0130;.</given-names></string-name>, <string-name><surname>Koca</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Predicting DDoS attacks using machine learning algorithms in building management systems</article-title>. <source>Electronics</source>. <year>2023</year>;<volume>12</volume>(<issue>19</issue>):<fpage>4142</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics12194142</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Suresh</surname> <given-names>M</given-names></string-name>, <string-name><surname>Anitha</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Evaluating machine learning algorithms for detecting DDoS attacks</article-title>. In: <conf-name>Advances in Network Security and Applications: 4th International Conference, CNSA 2011</conf-name>; <year>2011 Jul 15&#x2013;17</year>; <publisher-loc>Chennai, India. Berlin/Heidelberg, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>; 2011. p. <fpage>441</fpage>&#x2013;<lpage>52</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tuan</surname> <given-names>TA</given-names></string-name>, <string-name><surname>Long</surname> <given-names>HV</given-names></string-name>, <string-name><surname>Son</surname> <given-names>LH</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>R</given-names></string-name>, <string-name><surname>Priyadarshini</surname> <given-names>I</given-names></string-name>, <string-name><surname>Son</surname> <given-names>NTK</given-names></string-name></person-group>. <article-title>Performance evaluation of Botnet DDoS attack detection using machine learning</article-title>. <source>Evol Intell</source>. <year>2020</year>;<volume>13</volume>(<issue>2</issue>):<fpage>283</fpage>&#x2013;<lpage>94</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s12065-019-00310-w</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Jyoti</surname> <given-names>N</given-names></string-name>, <string-name><surname>Behal</surname> <given-names>S</given-names></string-name></person-group>. <article-title>A meta-evaluation of machine learning techniques for detection of DDoS attacks</article-title>. In: <conf-name>2021 8th Internatioanl Conference Computing for Sustainable Global Development (INDIACom)</conf-name>; <year>2021 Mar 17&#x2013;19</year>; <publisher-loc>New Delhi, India</publisher-loc>. p. <fpage>522</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Jadhav</surname> <given-names>V</given-names></string-name>, <string-name><surname>Devale</surname> <given-names>P</given-names></string-name>, <string-name><surname>Jadhav</surname> <given-names>R</given-names></string-name>, <string-name><surname>Molawade</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mohite</surname> <given-names>S</given-names></string-name>, <string-name><surname>Bidwe</surname> <given-names>RV</given-names></string-name></person-group>. <article-title>Bug predictive models based on data analytics and soft computing techniques: a survey</article-title>. In: <conf-name>2023 10th International Conference on Computing for Sustainable Global Development (INDIACom)</conf-name>; <year>2023 Mar 15&#x2013;17</year>; <publisher-loc>New Delhi, India</publisher-loc>. p. <fpage>822</fpage>&#x2013;<lpage>31</lpage>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ojugo</surname> <given-names>A</given-names></string-name>, <string-name><surname>Eboka</surname> <given-names>AO</given-names></string-name></person-group>. <article-title>An empirical evaluation on comparative machine learning techniques for detection of the distributed denial of service (DDoS) attacks</article-title>. <source>J Appl Sci Eng Technol Educ</source>. <year>2020</year>;<volume>2</volume>(<issue>1</issue>):<fpage>18</fpage>&#x2013;<lpage>27</lpage>. doi:<pub-id pub-id-type="doi">10.35877/454ri.asci2192</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Kawamoto</surname> <given-names>J</given-names></string-name>, <string-name><surname>Sakurai</surname> <given-names>K</given-names></string-name></person-group>. <article-title>A machine learning based approach for detecting DRDoS attacks and its performance evaluation</article-title>. In: <conf-name>2016 11th Asia Joint Conference on Information Security (AsiaJCIS)</conf-name>; <year>2016 Aug 4&#x2013;5</year>; <publisher-loc>Fukuoka, Japan</publisher-loc>. p. <fpage>80</fpage>&#x2013;<lpage>6</lpage>. doi:<pub-id pub-id-type="doi">10.1109/AsiaJCIS.2016.24</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Butt</surname> <given-names>HA</given-names></string-name>, <string-name><surname>Al Harthy</surname> <given-names>KS</given-names></string-name>, <string-name><surname>Ali Shah</surname> <given-names>M</given-names></string-name>, <string-name><surname>Hussain</surname> <given-names>M</given-names></string-name>, <string-name><surname>Amin</surname> <given-names>R</given-names></string-name>, <string-name><surname>Rehman</surname> <given-names>MU</given-names></string-name></person-group>. <article-title>Enhanced DDoS detection using advanced machine learning and ensemble techniques in software defined networking</article-title>. <source>Comput Mater Contin</source>. <year>2024</year>;<volume>81</volume>(<issue>2</issue>):<fpage>3003</fpage>&#x2013;<lpage>31</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2024.057185</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>&#x00D6;z&#x00E7;elik</surname> <given-names>&#x0130;</given-names></string-name>, <string-name><surname>Brooks</surname> <given-names>R</given-names></string-name></person-group>. <source>Distributed denial of service attacks: real-world detection and mitigation</source>. <publisher-loc>London, UK</publisher-loc>: <publisher-name>Chapman and Hall/CRC</publisher-name>; <year>2020</year>. doi:<pub-id pub-id-type="doi">10.1201/9781315213125</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fachkha</surname> <given-names>C</given-names></string-name>, <string-name><surname>Bou-Harb</surname> <given-names>E</given-names></string-name>, <string-name><surname>Debbabi</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Inferring distributed reflection denial of service attacks from darknet</article-title>. <source>Comput Commun</source>. <year>2015</year>;<volume>62</volume>(<issue>39</issue>):<fpage>59</fpage>&#x2013;<lpage>71</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comcom.2015.01.016</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>I</given-names></string-name></person-group>. <article-title>Emerging threats in cybersecurity: a review article</article-title>. <source>Int J Appl Nat Sci</source>. <year>2023</year>;<volume>1</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>8</lpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>H</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>YC</given-names></string-name>, <string-name><surname>Bailey</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Practical proactive DDoS-attack mitigation via endpoint-driven in-network traffic control</article-title>. <source>IEEE/ACM Trans Netw</source>. <year>2018</year>;<volume>26</volume>(<issue>4</issue>):<fpage>1948</fpage>&#x2013;<lpage>61</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TNET.2018.2854795</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Al-Omari</surname> <given-names>M</given-names></string-name>, <string-name><surname>Abu Al-Haija</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Performance analysis of machine learning-based intrusion detection with hybrid feature selection</article-title>. <source>Comput Syst Sci Eng</source>. <year>2024</year>;<volume>48</volume>(<issue>6</issue>):<fpage>1537</fpage>&#x2013;<lpage>55</lpage>. doi:<pub-id pub-id-type="doi">10.32604/csse.2024.056257</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Brooks</surname> <given-names>RR</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Ozcelik</surname> <given-names>I</given-names></string-name>, <string-name><surname>Oakley</surname> <given-names>J</given-names></string-name>, <string-name><surname>Tusing</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Distributed denial of service (DDoS): a history</article-title>. <source>IEEE Ann Hist Comput</source>. <year>2022</year>;<volume>44</volume>(<issue>2</issue>):<fpage>44</fpage>&#x2013;<lpage>54</lpage>. doi:<pub-id pub-id-type="doi">10.1109/MAHC.2021.3072582</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Karami</surname> <given-names>M</given-names></string-name>, <string-name><surname>Park</surname> <given-names>Y</given-names></string-name>, <string-name><surname>McCoy</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Stress testing the booters: understanding and undermining the business of DDoS services</article-title>. In: <conf-name>Proceedings of the 25th International Conference World Wide Web</conf-name>; <year>2016 Apr 11&#x2013;15</year>; <publisher-loc>Montreal, QC, Canada</publisher-loc>. p. <fpage>1033</fpage>&#x2013;<lpage>43</lpage>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yusof</surname> <given-names>AR</given-names></string-name>, <string-name><surname>Udzir</surname> <given-names>NI</given-names></string-name>, <string-name><surname>Selamat</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Systematic literature review and taxonomy for DDoS attack detection and prediction</article-title>. <source>Int J Digit Enterp Technol</source>. <year>2019</year>;<volume>1</volume>(<issue>3</issue>):<fpage>292</fpage>. doi:<pub-id pub-id-type="doi">10.1504/IJDET.2019.097849</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gavri&#x0107;</surname> <given-names>&#x017D;</given-names></string-name>, <string-name><surname>Simi&#x0107;</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Overview of DOS attacks on wireless sensor networks and experimental results for simulation of interference attacks</article-title>. <source>Ing Inv</source>. <year>2018</year>;<volume>38</volume>(<issue>1</issue>):<fpage>130</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.15446/ing.investig.v38n1.65453</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kalutharage</surname> <given-names>CS</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Chrysoulas</surname> <given-names>C</given-names></string-name>, <string-name><surname>Pitropakis</surname> <given-names>N</given-names></string-name>, <string-name><surname>Papadopoulos</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Explainable AI-based DDOS attack identification method for IoT networks</article-title>. <source>Computers</source>. <year>2023</year>;<volume>12</volume>(<issue>2</issue>):<fpage>32</fpage>. doi:<pub-id pub-id-type="doi">10.3390/computers12020032</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mirkovic</surname> <given-names>J</given-names></string-name>, <string-name><surname>Reiher</surname> <given-names>P</given-names></string-name></person-group>. <article-title>A taxonomy of DDoS attack and DDoS defense mechanisms</article-title>. <source>SIGCOMM Comput Commun Rev</source>. <year>2004</year>;<volume>34</volume>(<issue>2</issue>):<fpage>39</fpage>&#x2013;<lpage>53</lpage>. doi:<pub-id pub-id-type="doi">10.1145/997150.997156</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Distributed Denial of Service (DDoS) Attacks/tools</collab></person-group>. <article-title>Archived on wayback machine, 2018 May 24. [cited 2025 Jan 1]</article-title>. Available from: <ext-link ext-link-type="uri" xlink:href="https://web.archive.org/">https://web.archive.org/</ext-link>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><collab>The Spread of the Code-Red Worm (CRv2)</collab></person-group>. <article-title>Archived on wayback machine, 2017 Nov 20. [cited 2025 Jan 1]</article-title>. Available from: <ext-link ext-link-type="uri" xlink:href="https://web.archive.org/">https://web.archive.org/</ext-link>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Annamalai</surname> <given-names>M</given-names></string-name>, <string-name><surname>Dhanushiya</surname> <given-names>S</given-names></string-name>, <string-name><surname>Mythreyi</surname> <given-names>O</given-names></string-name>, <string-name><surname>Mishra</surname> <given-names>JS</given-names></string-name></person-group>. <chapter-title>Enhancing multicriteria decision-making through cryptographic security systems</chapter-title>. In: <source>Multi-criteria decision-making and optimum design with machine learning</source>. <publisher-loc>Boca Raton, FL, USA</publisher-loc>: <publisher-name>CRC Press</publisher-name>; <year>2024</year>. p. <fpage>224</fpage>&#x2013;<lpage>32</lpage>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Te&#x0161;i&#x0107;</surname> <given-names>D</given-names></string-name>, <string-name><surname>Marinkovi&#x0107;</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Application of fermatean fuzzy weight operators and MCDM model DIBR-DIBR II-NWBM-BM for efficiency-based selection of a complex combat system</article-title>. <source>J Decis Anal Int Comp</source>. <year>2023</year>;<volume>3</volume>(<issue>1</issue>):<fpage>243</fpage>&#x2013;<lpage>56</lpage>. doi:<pub-id pub-id-type="doi">10.31181/10002122023t</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Almahdi</surname> <given-names>EM</given-names></string-name>, <string-name><surname>Zaidan</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Zaidan</surname> <given-names>BB</given-names></string-name>, <string-name><surname>Alsalem</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Albahri</surname> <given-names>OS</given-names></string-name>, <string-name><surname>Albahri</surname> <given-names>AS</given-names></string-name></person-group>. <article-title>Mobile-based patient monitoring systems: a priori tisation framework using multi-criteria decision-making techniques</article-title>. <source>J Med Syst</source>. <year>2019</year>;<volume>43</volume>(<issue>7</issue>):<fpage>219</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s10916-019-1339-9</pub-id>; <pub-id pub-id-type="pmid">31172296</pub-id></mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Koca</surname> <given-names>M</given-names></string-name>, <string-name><surname>Avci</surname> <given-names>I</given-names></string-name></person-group>. <article-title>A novel hybrid model detection of security vulnerabilities in industrial control systems and IoT using GCN &#x002B; LSTM</article-title>. <source>IEEE Access</source>. <year>2024</year>;<volume>12</volume>(<issue>1</issue>):<fpage>143343</fpage>&#x2013;<lpage>51</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2024.3466391</pub-id>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Bhol</surname> <given-names>SG</given-names></string-name></person-group>. <chapter-title>Applications of multi criteria decision making methods in cyber security</chapter-title>. In: <person-group person-group-type="editor"><string-name><surname>Choudhury</surname> <given-names>A</given-names></string-name>, <string-name><surname>Kaushik</surname> <given-names>K</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>V</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>BK</given-names></string-name></person-group>, editors. <source>Cyber-physical systems security. Studies in big data</source>. Vol. <volume>154</volume>. <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2025</year>. p. <fpage>233</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-981-97-5734-3_11</pub-id>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khatari</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zaidan</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Zaidan</surname> <given-names>BB</given-names></string-name>, <string-name><surname>Albahri</surname> <given-names>OS</given-names></string-name>, <string-name><surname>Alsalem</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>Multi-criteria evaluation and benchmarking for active queue management methods: open issues, challenges and recommended pathway solutions</article-title>. <source>Int J Info Tech Dec Mak</source>. <year>2019</year>;<volume>18</volume>(<issue>4</issue>):<fpage>1187</fpage>&#x2013;<lpage>242</lpage>. doi:<pub-id pub-id-type="doi">10.1142/S0219622019300039</pub-id>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sahoo</surname> <given-names>SK</given-names></string-name>, <string-name><surname>Goswami</surname> <given-names>SS</given-names></string-name></person-group>. <article-title>A comprehensive review of multiple criteria decision-making (MCDM) methods: advancements, applications, and future directions</article-title>. <source>Decis Mak Adv</source>. <year>2023</year>;<volume>1</volume>(<issue>1</issue>):<fpage>25</fpage>&#x2013;<lpage>48</lpage>. doi:<pub-id pub-id-type="doi">10.31181/dma1120237</pub-id>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Avc&#x0131;</surname> <given-names>&#x0130;</given-names></string-name>, <string-name><surname>Koca</surname> <given-names>M</given-names></string-name></person-group>. <article-title>A novel security risk analysis using the AHP method in smart railway systems</article-title>. <source>Appl Sci</source>. <year>2024</year>;<volume>14</volume>(<issue>10</issue>):<fpage>4243</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app14104243</pub-id>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sa&#x0142;abun</surname> <given-names>W</given-names></string-name></person-group>. <article-title>How the normalization of the decision matrix influences the results in the VIKOR method?</article-title> <source>Procedia Comput Sci</source>. <year>2020</year>;<volume>176</volume>:<fpage>2222</fpage>&#x2013;<lpage>31</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.procs.2020.09.259</pub-id>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khalid</surname> <given-names>KM</given-names></string-name></person-group>. <article-title>Selection of the best village crop potential using the multi-attribute border approximation area comparison (MABAC) method</article-title>. <source>J Artif Intell Eng Appl (JAIEA)</source>. <year>2023</year>;<volume>3</volume>(<issue>1</issue>):<fpage>394</fpage>&#x2013;<lpage>407</lpage>. doi:<pub-id pub-id-type="doi">10.59934/jaiea.v3i1.341</pub-id>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rahim</surname> <given-names>N</given-names></string-name>, <string-name><surname>Abdullah</surname> <given-names>L</given-names></string-name>, <string-name><surname>Yusoff</surname> <given-names>B</given-names></string-name></person-group>. <article-title>A border approximation area approach considering bipolar neutrosophic linguistic variable for sustainable energy selection</article-title>. <source>Sustainability</source>. <year>2020</year>;<volume>12</volume>(<issue>10</issue>):<fpage>3971</fpage>. doi:<pub-id pub-id-type="doi">10.3390/su12103971</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>