Loading [MathJax]/jax/element/mml/optable/BasicLatin.js
Research article Special Issues

A collaborative prediction approach to defend against amplified reflection and exploitation attacks

  • Received: 10 April 2023 Revised: 17 August 2023 Accepted: 23 August 2023 Published: 07 September 2023
  • An amplified reflection and exploitation-based distributed denial of service (DDoS) attack allows an attacker to launch a volumetric attack on the target server or network. These attacks exploit network protocols to generate amplified service responses through spoofed requests. Spoofing the source addresses allows attackers to redirect all of the service responses to the victim's device, overwhelming it and rendering it unresponsive to legitimate users. Mitigating amplified reflection and exploitation attacks requires robust defense mechanisms that are capable of promptly identifying and countering the attack traffic while maintaining the availability and integrity of the targeted systems. This paper presents a collaborative prediction approach based on machine learning to mitigate amplified reflection and exploitation attacks. The proposed approach introduces a novel feature selection technique called closeness index of features (CIF) calculation, which filters out less important features and ranks them to identify reduced feature sets. Further, by combining different machine learning classifiers, a voting-based collaborative prediction approach is employed to predict network traffic accurately. To evaluate the proposed technique's effectiveness, experiments were conducted on CICDDoS2019 datasets. The results showed impressive performance, achieving an average accuracy, precision, recall and F1 score of 99.99%, 99.65%, 99.28% and 99.46%, respectively. Furthermore, evaluations were conducted by using AUC-ROC curve analysis and the Matthews correlation coefficient (MCC) statistical rate to analyze the approach's effectiveness on class imbalance datasets. The findings demonstrated that the proposed approach outperforms recent approaches in terms of performance. Overall, the proposed approach presents a robust machine learning-based solution to defend against amplified reflection and exploitation attacks, showcasing significant improvements in prediction accuracy and effectiveness compared to existing approaches.

    Citation: Arvind Prasad, Shalini Chandra, Ibrahim Atoum, Naved Ahmad, Yazeed Alqahhas. A collaborative prediction approach to defend against amplified reflection and exploitation attacks[J]. Electronic Research Archive, 2023, 31(10): 6045-6070. doi: 10.3934/era.2023308

    Related Papers:

    [1] Ahmed M.A. El-Sayed, Eman M.A. Hamdallah, Hameda M. A. Alama . Multiple solutions of a Sturm-Liouville boundary value problem of nonlinear differential inclusion with nonlocal integral conditions. AIMS Mathematics, 2022, 7(6): 11150-11164. doi: 10.3934/math.2022624
    [2] Murugesan Manigandan, Kannan Manikandan, Hasanen A. Hammad, Manuel De la Sen . Applying fixed point techniques to solve fractional differential inclusions under new boundary conditions. AIMS Mathematics, 2024, 9(6): 15505-15542. doi: 10.3934/math.2024750
    [3] Mouffak Benchohra, John R. Graef, Nassim Guerraiche, Samira Hamani . Nonlinear boundary value problems for fractional differential inclusions with Caputo-Hadamard derivatives on the half line. AIMS Mathematics, 2021, 6(6): 6278-6292. doi: 10.3934/math.2021368
    [4] Bashir Ahmad, Badrah Alghamdi, Ahmed Alsaedi, Sotiris K. Ntouyas . Existence results for Riemann-Liouville fractional integro-differential inclusions with fractional nonlocal integral boundary conditions. AIMS Mathematics, 2021, 6(7): 7093-7110. doi: 10.3934/math.2021416
    [5] Madeaha Alghanmi, Shahad Alqurayqiri . Existence results for a coupled system of nonlinear fractional functional differential equations with infinite delay and nonlocal integral boundary conditions. AIMS Mathematics, 2024, 9(6): 15040-15059. doi: 10.3934/math.2024729
    [6] Abdissalam Sarsenbi, Abdizhahan Sarsenbi . Boundary value problems for a second-order differential equation with involution in the second derivative and their solvability. AIMS Mathematics, 2023, 8(11): 26275-26289. doi: 10.3934/math.20231340
    [7] Adel Lachouri, Mohammed S. Abdo, Abdelouaheb Ardjouni, Bahaaeldin Abdalla, Thabet Abdeljawad . On a class of differential inclusions in the frame of generalized Hilfer fractional derivative. AIMS Mathematics, 2022, 7(3): 3477-3493. doi: 10.3934/math.2022193
    [8] Djamila Chergui, Taki Eddine Oussaeif, Merad Ahcene . Existence and uniqueness of solutions for nonlinear fractional differential equations depending on lower-order derivative with non-separated type integral boundary conditions. AIMS Mathematics, 2019, 4(1): 112-133. doi: 10.3934/Math.2019.1.112
    [9] Nayyar Mehmood, Niaz Ahmad . Existence results for fractional order boundary value problem with nonlocal non-separated type multi-point integral boundary conditions. AIMS Mathematics, 2020, 5(1): 385-398. doi: 10.3934/math.2020026
    [10] Najla Alghamdi, Bashir Ahmad, Esraa Abed Alharbi, Wafa Shammakh . Investigation of multi-term delay fractional differential equations with integro-multipoint boundary conditions. AIMS Mathematics, 2024, 9(5): 12964-12981. doi: 10.3934/math.2024632
  • An amplified reflection and exploitation-based distributed denial of service (DDoS) attack allows an attacker to launch a volumetric attack on the target server or network. These attacks exploit network protocols to generate amplified service responses through spoofed requests. Spoofing the source addresses allows attackers to redirect all of the service responses to the victim's device, overwhelming it and rendering it unresponsive to legitimate users. Mitigating amplified reflection and exploitation attacks requires robust defense mechanisms that are capable of promptly identifying and countering the attack traffic while maintaining the availability and integrity of the targeted systems. This paper presents a collaborative prediction approach based on machine learning to mitigate amplified reflection and exploitation attacks. The proposed approach introduces a novel feature selection technique called closeness index of features (CIF) calculation, which filters out less important features and ranks them to identify reduced feature sets. Further, by combining different machine learning classifiers, a voting-based collaborative prediction approach is employed to predict network traffic accurately. To evaluate the proposed technique's effectiveness, experiments were conducted on CICDDoS2019 datasets. The results showed impressive performance, achieving an average accuracy, precision, recall and F1 score of 99.99%, 99.65%, 99.28% and 99.46%, respectively. Furthermore, evaluations were conducted by using AUC-ROC curve analysis and the Matthews correlation coefficient (MCC) statistical rate to analyze the approach's effectiveness on class imbalance datasets. The findings demonstrated that the proposed approach outperforms recent approaches in terms of performance. Overall, the proposed approach presents a robust machine learning-based solution to defend against amplified reflection and exploitation attacks, showcasing significant improvements in prediction accuracy and effectiveness compared to existing approaches.



    The models of the differential and integral equations have been appeared in different applications (see [1,2,3,4,6,7,9,12,13,14,15,16,17,18,19,20]).

    Boundary value problems involving fractional differential equations arise in physical sciences and applied mathematics. In some of these problems, subsidiary conditions are imposed locally. In some other cases, nonlocal conditions are imposed. It is sometimes better to impose nonlocal conditions since the measurements needed by a nonlocal condition may be more precise than the measurement given by a local condition. Consequently, a variety of excellent results on fractional boundary value problems (abbreviated BVPs) with resonant conditions have been achieved. For instance, Bai [4] studied a type of fractional differential equations with m-points boundary conditions. The existence of nontrivial solutions was established by using coincidence degree theory. Applying the same method, Kosmatov [17] investigated the fractional order three points BVP with resonant case.

    Although the study of fractional BVPs at resonance has acquired fruitful achievements, it should be noted that such problems with Riemann-Stieltjes integrals are very scarce, so it is worthy of further explorations. Riemann-Stieltjes integral has been considered as both multipoint and integral in a single framework, which is more common, see the relevant works due to Ahmad et al. [1].

    The boundary value problems with nonlocal, integral and infinite points boundary conditions have been studied by some authors (see, for example [8,10,11,12]).

    Here, we discuss the boundary value problem of the nonlinear differential inclusions of arbitrary (fractional) orders

    dxdtF1(t,x(t),Iγf2(t,Dαx(t))),α,γ(0,1]t(0,1) (1.1)

    with the nonlocal boundary condition

    mk=1akx(τk)=x0,ak>0τk[0,1], (1.2)

    the integral condition

    10x(s)dg(s)=x0 (1.3)

    and the infinite point boundary condition

    k=1akx(τk)=x0,ak>0andτk[0,1]. (1.4)

    We study the existence of solutions xC[0,1] of the problems (1.1) and (1.2), and deduce the existence of solutions of the problem of (1.1) with the conditions (1.3) and (1.4). Then the existence of the maximal and minimal solutions will be proved. The sufficient condition for the uniqueness and continuous dependence of the solution will be studied.

    This paper is organised as: In Section 2, we prove the existence of continuous solutions of the problems (1.1) and (1.2), and deduce the existence of solutions of the problem of (1.1) with the conditions (1.3) and (1.4). In Section 3, the existence of the maximal and minimal solutions is proved. In Section 4, the sufficient condition for the uniqueness and continuous dependence of the solution are studied. Next, in Section 5, we extend our results to the nonlocal problems (1.3) and (2.1). Finally, some existence results is proved for the nonlocal problems (1.4) and (2.1) in Section 6.

    Consider the following assumptions:

    (I) (i) The set F1(t,x,y) is nonempty, closed and convex for all (t,x,y)[0,1]×R×R.

    (ii) F1(t,x,y) is measurable in t[0,1] for every x,yR.

    (iii) F1(t,x,y) is upper semicontinuous in x and y for every t[0,1].

    (iv) There exist a bounded measurable function a1:[0,1]R and a positive constant K1, such that

    F1(t,x,y)=sup{|f1|:f1F1(t,x,y)}|a1(t)|+K1(|x|+|y|).

    Remark 2.1. From the assumptions (i)–(iv) we can deduce that (see [3,6,7,13]) there exists f1F1(t,x,y), such that

    (v) f1:[0,1]×R×RR is measurable in t for every x,yR and continuous in x,y for t[0,1], and there exist a bounded measurable function a1:[0,1]R and a positive constant K1>0 such that

    |f1(t,x,y)||a1(t)|+K1(|x|+|y|),

    and the functional f1 satisfies the differential equation

    dxdt=f1(t,x(t),Iγf2(t,Dαx(t))),α,γ(0,1]andt(0,1]. (2.1)

    (II) f2:[0,1]×RR is measurable in t for any xR and continuous in x for t[0,1], and there exist a bounded measurable function a2:[0,1]R and a positive constant K2>0 such that

    |f2(t,x)||a2(t)|+K2|x|,t[0,1]andxR

    and

    supt[0,1]|ai(t)|ai,i=1,2.

    (III) 2K1γ+K1K2α<αγΓ(2α),α,γ(0,1].

    Remark 2.2. From (I) and (v) we can deduce that every solution of (1.1) is a solution of (2.1). Now, we shall prove the following lemma.

    Lemma 2.1. If the solution of the problems (1.2)–(2.1) exists then it can be expressed by the integral equation

    y(t)=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(ϕ,y(θ))dθ)ds. (2.2)

    Proof. Consider the boundary value problems (1.2)–(2.1) be satisfied. Operating by I1α on both sides of (2.1) we can obtain

    Dαx(t)=I1αdxdt=I1αf1(t,x(t),Iγf2(t,Dαx(t))). (2.3)

    Taking

    Dαx(t)=y(t), (2.4)

    then we obtain

    x(t)=x(0)+Iαy(t). (2.5)

    Putting t=τ and multiplying (2.5) by Σmk=1ak, then we get

    Σmk=1akx(τk)=Σmk=1akx(0)+Σmk=1akIαy(τk), (2.6)
    x0=Σmk=1akx(0)+Σmk=1akIαy(τk) (2.7)

    and

    x(0)=1Σmk=1ak[x0Σmk=1akIαy(τk)]. (2.8)

    Then

    x(t)=1Σmk=1ak[x0Σmk=1akIαy(τk)]+Iαy(t). (2.9)

    Substituting (2.8) and (2.9) in (2.5), which completes the proof.

    Theorem 2.1. Let assumptions (I)–(III) be satisfied. Then the integral equation (2.2) has at least one continuous solution.

    Proof. Define a set Qr as

    Qr={yC[0,1]:yr},
    r=Γ(γ+1)[a1+K1A|x0|]+k1a2αγΓ(2α)[2K1α+K1K2γ],(mk=1ak)1=A,

    and the operator F by

    Fy(t)=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ))dθ)ds.

    For yQr, then

    |Fy(t)|=|t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ))dθ)ds|K1t0(ts)αΓ(1α)[|x0|mk=1ak+mk=1akτk0(τkθ)α1Γ(α)|y(θ)|dθmk=1ak+s0(sθ)α1Γ(α)|y(θ)|dθ+s0(sϕ)γ1Γ(γ)(K2|y(θ)|+|a2(t)|)dθ]+|a1(t)|)ds1Γ(2α)[K1A|x0|+K1yΓ(α+1)+K1yΓ(α+1)+K1K2yΓ(γ+1)+K1a2Γ(γ+1)+a1]1Γ(2α)[K1A|x0|+K1rΓ(α+1)+K1rΓ(α+1)+K1K2rΓ(γ+1)+K1a2Γ(γ+1)+a1]1Γ(2α)[K1A|x0|+2K1rΓ(α+1)+K1K2rΓ(γ+1)+K1a2Γ(γ+1)+a1]r.

    Thus, the class of functions {Fy} is uniformly bounded on Qr and F:QrQr. Let yQr and t1,t2[0,1] such that |t2t1|<δ, then

    |Fy(t2)Fy(t1)|=|t20(t2s)αΓ(1α)(f1(s,x(s),Iγf2(s,y(s)))dst10(t1s)αΓ(1α)(f1(s,x(s),Iγf2(s,y(s)))ds||t20(t2s)αΓ(1α)(f1(s,x(s),Iγf2(s,y(s)))dst10(t2s)αΓ(1α)(f1(s,x(s),Iγf2(s,y(s)))ds+t10(t2s)αΓ(1α)(f1(s,x(s),Iγf2(s,y(s)))dst10(t1s)αΓ(1α)(f1(s,x(s),Iγf2(s,y(s)))ds|t2t1(t2s)αΓ(1α)|(f1(s,x(s),Iγf2(s,y(s)))|ds+t10(t2s)α(t1s)αΓ(1α)|(f1(s,x(s),Iγf2(s,y(s)))ds|t2t1(t2s)αΓ(1α)|(f1(s,x(s),Iγf2(s,y(s)))|ds+t10(t2s)α(t1s)αΓ(1α)(t2s)α(t1s)α.|(f1(s,x(s),Iγf2(s,y(s)))|ds.

    Thus, the class of functions {Fy} is equicontinuous on Qr and {Fy} is compact operator by the Arzela-Ascoli Theorem [5].

    Now we prove that F is continuous operator. Let ynQr be convergent sequence such that yny, then

    Fyn(t)=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yn(θ)dθ]+s0(sθ)α1Γ(α)yn(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,yn(θ)))ds.

    Using Lebesgue dominated convergence Theorem [5] and assumptions (iv)–(II) we have

    limnFyn(t)=limnt0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yn(θ)dθ]+s0(sθ)α1Γ(α)yn(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,yn(θ)))ds=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)limnyn(θ)dθ]+s0(sθ)α1Γ(α)limnyn(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,limnyn(θ)))ds=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ)))ds=Fy(t).

    Then F:QrQr is continuous, and by Schauder Fixed Point Theorem[5] there exists at least one solution yC[0,1] of (2.2). Now

    dxdt=ddt[x(0)+Iαy(t)]=ddtIαI1αf1(t,x(t),Iγf2(t,y(t)))=ddtIf1(t,x(t),Iγf2(t,y(t)))=f1(t,x(t),Iγf2(t,y(t))).

    Putting t=τ and using (2.9), we obtain

    x(t)=1Σmk=1ak[x0Σmk=1akIαy(τk)]+Iαy(t),Σmk=1akx(τk)=Σmk=1ak1Σmk=1ak[x0Σmk=1akIαy(τk)]+Σmk=1akIαy(τk),

    then

    Σmk=1akx(τk)=x0,ak>0andτk[0,1].

    This proves the equivalence between the problems (1.2)–(2.1) and the integral equation (2.2). Then there exists at least one solution yC[0,1] of the problems (1.2)–(2.1).

    Here, we shall study the maximal and minimal solutions for the problems (1.2) and (2.1). Let y(t) be any solution of (2.2), let u(t) be a solution of (2.2), then u(t) is said to be a maximal solution of (2.2) if it satisfies the inequality

    y(t)u(t),t[0,1].

    A minimal solution can be defined by similar way by reversing the above inequality.

    Lemma 3.1. Let the assumptions of Theorem 2.1 be satisfied. Assume that x(t) and y(t) are two continuous functions on [0,1] satisfying

    y(t)t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ)))dst[0,1],x(t)t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)x(θ)dθ]+s0(sθ)α1Γ(α)x(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,x(θ)))dst[0,1],

    where one of them is strict.

    Let functions f1 and f2 be monotonic nondecreasing in y, then

    y(t)<x(t),t>0. (3.1)

    Proof. Let the conclusion (3.1) be not true, then there exists t1 with

    y(t1)<x(t1),t1>0andy(t)<x(t),0<t<t1.

    Since f1 and f2 are monotonic functions in y, then we have

    y(t1)t10(t1s)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ)))ds<t10(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)x(θ)dθ]+s0(sθ)α1Γ(α)x(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,x(θ)))ds<x(t1),t1[0,1].

    This contradicts the fact that y(t1)=x(t1), then y(t)<x(t). This completes the proof.

    For the existence of the continuous maximal and minimal solutions for (2.1), we have the following theorem.

    Theorem 3.1. Let the assumptions of Theorem 2.1 be hold. Moreover, if f1 and f2 are monotonic nondecreasing functions in y for each t[0,1], then Eq (2.1) has maximal and minimal solutions.

    Proof. First, we should demonstrate the existence of the maximal solution of (2.1). Let ϵ>0 be given. Now consider the integral equation

    yϵ(t)=t0(ts)αΓ(1α)f1,ϵ(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵ(θ)dθ]+s0(sθ)α1Γ(α)yϵ(θ)dθ,s0(sθ)γ1Γ(γ)f2,ϵ(θ,yϵ(θ))dθ)ds,t[0,1],

    where

    f1,ϵ(s,xϵ(s),yϵ(s))=f1(s,xϵ(s),yϵ(s))+ϵ,
    f2,ϵ(s,xϵ(s))=f2(s,xϵ(s))+ϵ.

    For ϵ2>ϵ1, we have

    yϵ2(t)=t0(ts)αΓ(1α)f1,ϵ2(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵ2(θ)dθ]+s0(sθ)α1Γ(α)yϵ2(θ)dθ,s0(sθ)γ1Γ(γ)f2,ϵ2(θ,yϵ2(θ))dθ)ds,t[0,1],
    yϵ2(t)=t0(ts)αΓ(1α)[f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵ2(θ)dθ]+s0(sθ)α1Γ(α)yϵ2(θ)dθ,s0(sθ)γ1Γ(γ)(f2(θ,yϵ2(θ))+ϵ2)dθ)+ϵ2]ds,t[0,1].

    Also

    yϵ1(t)=t0(ts)αΓ(1α)f1,ϵ1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵ1(θ)dθ]+s0(sθ)α1Γ(α)yϵ1(θ)dθ,s0(sθ)γ1Γ(γ)f2,ϵ1(θ,yϵ1(θ))dθ)ds,yϵ1(t)=t0(ts)αΓ(1α)[f1(s,1mk=1ak[x0mk=1akτk0(τkϕ)α1Γ(α)yϵ1(θ)dθ]+s0(sθ)α1Γ(α)yϵ1(θ)dθ,s0(sθ)γ1Γ(γ)(f2(θ,yϵ1(θ))+ϵ1)dθ)+ϵ1]ds>t0(ts)αΓ(1α)[f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵ2(θ)dθ]+s0(sθ)α1Γ(α)yϵ2(θ)dθ,s0(sθ)γ1Γ(γ)(f2(θ,yϵ2(τ))+ϵ2)dθ)+ϵ2]ds.

    Applying Lemma 3.1, we obtain

    yϵ2<yϵ1,t[0,1].

    As shown before, the family of function yϵ(t) is equi-continuous and uniformly bounded, then by Arzela Theorem, there exist decreasing sequence ϵn, such that ϵn0 as n, and u(t)=limnyϵn(t) exists uniformly in [0,1] and denote this limit by u(t). From the continuity of the functions, f2,ϵn(t,yϵn(t)), we get f2,ϵn(t,yϵn(t))f2(t,y(t)) as n and

    u(t)=limnyϵn(t)=t0(ts)αΓ(1α)[f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵn(θ)dθ]+s0(sθ)α1Γ(α)yϵn(θ)dθ,s0(sθ)γ1Γ(γ)(f2(θ,yϵn(θ))+ϵn))+ϵn]ds,t[0,1].

    Now we prove that u(t) is the maximal solution of (2.1). To do this, let y(t) be any solution of (2.1), then

    y(t)=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ))dθ)ds,yϵ(t)=t0(ts)αΓ(1α)[f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵ(θ)dθ]+s0(sθ)α1Γ(α)yϵ(θ)dθ,s0(sθ)γ1Γ(γ)(f2(θ,yϵ(θ))+ϵ)dθ)+ϵ]ds

    and

    yϵ(t)>t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)yϵ(θ)dθ]+s0(sθ)α1Γ(α)yϵ(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,yϵ(θ)))ds.

    Applying Lemma 3.1, we obtain

    y(t)<yϵ(t),t[0,1].

    From the uniqueness of the maximal solution it clear that yϵ(t) tends to u(t) uniformly in [0,1] as ϵ0.

    By a similar way as done above, we can prove the existence of the minimal solution.

    Here, we study the sufficient condition for the uniqueness of the solution yC[0,1] of problems (1.2) and (2.1). Consider the following assumptions:

    (I) (i) The set F1(t,x,y) is nonempty, closed and convex for all (t,x,y)[0,1]×R×R.

    (ii) F1(t,x,y) is measurable in t[0,1] for every x,yR.

    (iii) F1 satisfies the Lipschitz condition with a positive constant K1 such that

    H(F1(t,x1,y1),F1(t,x2,y2)|K1(|x1x2|+|y1y2|),

    where H(A,B) is the Hausdorff metric between the two subsets A,B[0,1]×E.

    Remark 4.1. From this assumptions we can deduce that there exists a function f1F1(t,x,y), such that

    (iv) f1:[0,1]×R×RR is measurable in t[0,1] for every x,yR and satisfies Lipschitz condition with a positive constant K1 such that (see [3,7])

    |f1(t,x1,y1)f1(t,x2,y2)|K1(|x1x2|+|y1y2|).

    (II)f2:[0,1]×RR is measurable in t[0,T] and satisfies Lipschitz condition with positive constant K2, such that

    |f2(t,x)f2(t,y)|K2|xy|.

    From the assumption (I), we have

    |f1(t,x,y)||f1(t,0,0)||f1(t,x,y)f1(t,0,0)|K1(|x|+|y|).

    Then

    |f1(t,x,y)|K1(|x|+|y|)+|f1(t,0,0)|K1(|x|+|y|)+a1(t),

    where |a1(t)|=suptI|f1(t,0,0)|.

    From the assumption (II), we have

    |f2(t,y)||f2(t,0)||f2(t,y)f2(t,0)|K2|y|.

    Then

    |f2(t,x)|K2|x|+|f2(t,0)|K2|x|+a2(t),

    where |a2(t)|=suptI|f1(t,0)|.

    Theorem 4.1. Let the assumptions (I) and (II) be satisfied. Then the solution of the problems (1.2) and (2.1) is unique.

    Proof. Let y1(t) and y2(t) be solutions of the problems (1.2) and (2.1), then

    Then

    y1y2[αγΓ(2α)(2K1α+K1K2γ)]<0.

    Since (αγΓ(2α)(2K1α+K1K2γ))<1, then y1(t)=y2(t) and the solution of (1.2) and (2.1) is unique.

    Definition 4.1. The unique solution of the problems (1.2) and (2.1) depends continuously on initial data x0, if ϵ>0, δ>0, such that

    |x0x0|δyyϵ,

    where y is the unique solution of the integral equation

    y(t)=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ))dθ)ds|.

    Theorem 4.2. Let the assumptions (I) and (II) be satisfied, then the unique solution of (1.2) and (2.1) depends continuously on x0.

    Proof. Let y(t) and y(t) be the solutions of problems (1.2) and (2.1), then

    then we obtain

    |y(t)y(t)|(AK1δ)(αγΓ(2α)(2K1α+K1K2γ))1ϵ

    and

    y(t)y(t)ϵ.

    Definition 4.2. The unique solution of the problems (1.2) and (2.1) depends continuously on initial data ak, if ϵ>0, δ>0, such that

    mk=1|akak|δyyϵ,

    where y is the unique solution of the integral equation

    y(t)=t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ))dθ)ds|.

    Theorem 4.3. Let the assumptions (I) and (II) be satisfied, then the unique solution of problems (1.2) and (2.1) depends continuously on ak.

    Proof. Let y(t) and y(t) be the solutions of problems (1.2) and (2.1) and (mk=1ak)1=A,

    |y(t)y(t)|=|t0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ))dθ)dst0(ts)αΓ(1α)f1(s,1mk=1ak[x0mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(θ,y(θ))dθ)ds|t0(ts)αΓ(1α)[|x0|(mk=1akmk=1ak)mk=1akmk=1ak+mk=1akτk0(τkθ)α1Γ(α)|y(θ)|dθmk=1akmk=1akτk0(τkθ)α1Γ(α)|y(θ)|dθmk=1ak+K1s0(sθ)α1Γ(α)|y(θ)y(θ)|dθ+K1K2s0(sθ)γ1Γ(γ)|y(ϕ)y(θ)|dθ]ds1Γ(2α)[K1|x0|mk=1|akak|mk=1akmk=1ak+K1mk=1ak(mk=1akτk0(τkθ)α1Γ(α)|y(θ)|dθmk=1akτk0(τkθ)α1Γ(α)|y(θ)|dθ)mk=1akmk=1ak+K1mk=1ak(mk=1akτk0(τkθ)α1Γ(α)|y(θ)|dθmk=1akτk0(τkθ)α1Γ(α)|y(θ)|dθ)mk=1akmk=1ak+K1s0(sθ)α1Γ(α)|y(θ)y(θ)|dθ+K1K2s0(sθ)γ1Γ(γ)|y(ϕ)y(θ)|dθ]ds1Γ(2α)[K1|x0|δmk=1akmk=1ak+K1(mk=1akδrΓ(α+1)+mk=1akδrΓ(α+1))mk=1akmk=1ak+K1yyΓ(α+1)+K1K2yyΓ(γ+1)K1δ|x0|Γ(2α)mk=1akmk=1ak+K1(mk=1akδrΓ(α+1)+mk=1akδrΓ(α+1))Γ(2α)Γ(α+1)mk=1akmk=1ak+K1yyΓ(2α)Γ(α+1)+K1K2yyΓ(γ+1)Γ(2α),

    then we obtain

    |y(t)y(t)|(AAK1δ[|x0|+r(mk=1ak+mk=1ak)]).(αγΓ(2α)(2K1α+K1K2γ))1ϵ

    and

    y(t)y(t)ϵ.

    Let yC[0,1] be the solution of the nonlocal boundary value problems (1.2) and (2.1). Let ak=(g(tk)g(tk1), g is increasing function, τk(tk1tk), 0=t0<t1<t2,...<tm=1, then, as m the nonlocal condition (1.2) will be

    mk=1(g(tk)g(tk1)y(τk)=x0.

    As the limit m, we obtain

    limmmk=1(g(tk)g(tk1)y(τk)=10y(s)dg(s)=x0.

    Theorem 5.1. Let the assumptions (I)–(III) be satisfied. If mk=1ak be convergent, then the nonlocal boundary value problems of (1.3) and (2.1) have at least one solution given by

    y(t)=t0(ts)αΓ(1α)f1(s,1g(1)g(0)[x010s0(sθ)α1Γ(α)y(θ)dθdg(s)]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(ϕ,y(θ))dθ)ds.

    Proof. As m, the solution of the nonlocal boundary value problem (2.1) will be

    limmy(t)=t0(ts)αΓ(1α)f1(s,(g(1)g(0))1x0(g(1)g(0))1.limmmk=1[g(tk)g(tk1]τk0(τkθ)α1Γ(α)y(θ)dθ+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(ϕ,y(θ))dθ)ds=t0(ts)αΓ(1α)f1(s,1g(1)g(0)[x010s0(sθ)α1Γ(α)y(θ)dθdg(s)]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(ϕ,y(θ))dθ)ds.

    Theorem 6.1. Let the assumptions (I)–(III) be satisfied, then the nonlocal boundary value problems of (1.4) and (2.1) have at least one solution given by

    y(t)=t0(ts)αΓ(1α)f1(s,1k=1ak[x0k=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(ϕ,y(θ))dθ)ds.

    Proof. Let the assumptions of Theorem 2.1 be satisfied. Let mk=1ak be convergent, then take the limit to (1.4), we have

    limmy(t)=t0(ts)αΓ(1α)f1(s,limmm1mk=1ak[x0limmmk=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(ϕ,y(θ))dθ)ds.

    Now

    |akτk0(τkθ)α1Γ(α)y(θ)dθ||ak|τk0(τkθ)α1Γ(α)|y(θ)|dθ|ak|yΓ(α+1)|ak|rΓ(α+1)

    and by the comparison test (mk=1akτk0(τkθ)α1Γ(α)y(θ)dθ) is convergent,

    y(t)=t0(ts)αΓ(1α)f1(s,1k=1ak[x0k=1akτk0(τkθ)α1Γ(α)y(θ)dθ]+s0(sθ)α1Γ(α)y(θ)dθ,s0(sθ)γ1Γ(γ)f2(ϕ,y(θ))dθ)ds.

    Furthermore, from (2.9) we have

    k=1akx(τk)=k=1ak[1k=1ak(x0k=1akτk0(τks)α1Γ(α)y(s)ds)]+τk0(τks)α1Γ(α)y(s)ds)]=x0.

    Example 6.1. Consider the following nonlinear integro-differential equation

    dxdt=t4et+x(t)t+2+13Iγ(cos(5t+1)+19[t5sinD13x(t)+e3tx(t)]) (6.1)

    with boundary condition

    mk=1[1k1k+1]x(τk)=x0,ak>0τk[0,1]. (6.2)

    Let

    f1(t,x(t),Iγf2(t,Dαx(t)))=t4et+x(t)t+2+13Iγ(cos(5t+1)+19[t5sinD13x(t)+e3tx(t)]),

    then

    |f1(t,x(t),Iγf2(t,Dαx(t)))=|t4et+x(t)2t+4+14(43Iγ(cos(5t+1)+19[t5sinD13x(t)+e3tx(t)]))|

    and also

    |Iγf2(t,Dαx(t))|14(43Iγ|cos(5t+1)+13[t5sinD13x(t)+e3tx(t)]|.

    It is clear that the assumptions (I) and (II) of Theorem 2.1 are satisfied with a1(t)=t4etL1[0,1], a2(t)=43Iγ|(cos(5t+1)|L1[0,1], and let α=13, γ=23, then 2K1γ+K1K2α=12<αγΓ(2α)=12Γ(2α). Therefore, by applying Theorem 2.1, the nonlocal problems (6.1) and (6.2) has a continuous solution.

    In this paper, we have studied a boundary value problem of fractional order differential inclusion with nonlocal, integral and infinite points boundary conditions. We have prove some existence results for that a single nonlocal boundary value problem, in of proving some existence results for a boundary value problem of fractional order differential inclusion with nonlocal, integral and infinite points boundary conditions. Next, we have proved the existence of maximal and minimal solutions. Then we have established the sufficient conditions for the uniqueness of solutions and continuous dependence of solution on some initial data and on the coefficients ak are studied. Finally, we have proved the existence of a nonlocal boundary value problem with Riemann-Stieltjes integral condition and with infinite-point boundary condition. An example is given to illustrate our results.

    The authors declare no conflict of interest.



    [1] Y. Jia, F. Zhong, A. Alrawais, B. Gong, X. Cheng, FlowGuard: An intelligent edge defense mechanism against IoT DDoS attacks, IEEE Internet Things J., 7 (2020), 9552–9562. https://doi.org/10.1109/JIOT.2020.2993782 doi: 10.1109/JIOT.2020.2993782
    [2] A. Prasad, S. Chandra, Machine learning to combat cyberattack: a survey of datasets and challenges, J. Def. Model. Simul. Appl. Methodol. Technol., 2022 (2022). https://doi.org/10.1177/15485129221094881 doi: 10.1177/15485129221094881
    [3] H. Wang, H. He, W. Zhang, W. Liu, P. Liu, A. Javadpour, Using honeypots to model botnet attacks on the internet of medical things, Comput. Electr. Eng., 102 (2022), 108212. https://doi.org/10.1016/j.compeleceng.2022.108212 doi: 10.1016/j.compeleceng.2022.108212
    [4] Y. Lee, H. Chae, K. Lee, Countermeasures against large-scale reflection DDoS attacks using exploit IoT devices, Automatika, 62 (2021), 127–136. https://doi.org/10.1080/00051144.2021.1885587 doi: 10.1080/00051144.2021.1885587
    [5] M. Anagnostopoulos, S. Lagos, G. Kambourakis, Large-scale empirical evaluation of DNS and SSDP amplification attacks, J. Inf. Secur. Appl., 66 (2022), 103168. https://doi.org/10.1016/j.jisa.2022.103168 doi: 10.1016/j.jisa.2022.103168
    [6] K. B. Dasari, N. Devarakonda, Detection of different DDoS attacks using machine learning classification algorithms, Ing. Des Syst. d Inf., 26 (2021), 461–468. https://doi.org/10.18280/isi.260505 doi: 10.18280/isi.260505
    [7] C. Rossow, Amplification hell: Revisiting network protocols for DDoS abuse, inNDSS, (2021), 1–15.
    [8] J. D. Case, M. Fedor, M. L. Schoffstall, J. Davin, Simple network management protocol (SNMP), 1989.
    [9] D. Kshirsagar, S. Sawant, A. Rathod, S. Wathore, CPU load analysis & minimization for TCP SYN flood detection, Procedia Comput. Sci., 85 (2016), 626–633. https://doi.org/10.1016/j.procs.2016.05.230 doi: 10.1016/j.procs.2016.05.230
    [10] S. Muthurajkumar, A. Geetha, S. Aravind, H. Barakath Meharajnisa, UDP flooding attack detection using entropy in software-defined networking, in Proceedings of International Conference on Communication and Computational Technologies, Springer, (2023), 549–560. https://doi.org/10.1007/978-981-19-3951-8_42
    [11] N. N. Mohamed, Y. Mohd Yussoff, M. A. Mat Isa, H. Hashim, Extending hybrid approach to secure Trivial File Transfer Protocol in M2M communication: a comparative analysis, Telecommun. Syst., 70 (2019), 511–523. https://doi.org/10.1007/s11235-018-0522-5 doi: 10.1007/s11235-018-0522-5
    [12] H. Aydın, Z. Orman, M. A. Aydın, A long short-term memory (LSTM)-based distributed denial of service (DDoS) detection and defense system design in public cloud network environment, Comput. Secur., 118 (2022), 102725. https://doi.org/10.1016/j.cose.2022.102725 doi: 10.1016/j.cose.2022.102725
    [13] S. Pundir, M. S. Obaidat, M. Wazid, A. K. Das, D. P. Singh, J. Rodrigues, MADP-IIME: malware attack detection protocol in IoT-enabled industrial multimedia environment using machine learning approach, Multimedia Syst., 29 (2023), 1785–1797. https://doi.org/10.1007/s00530-020-00743-9 doi: 10.1007/s00530-020-00743-9
    [14] M. Gallagher, N. Pitropakis, C. Chrysoulas, P. Papadopoulos, A. Mylonas, S. Katsikas, Investigating machine learning attacks on financial time series models, Comput. Secur., 123 (2022), 102933. https://doi.org/10.1016/j.cose.2022.102933 doi: 10.1016/j.cose.2022.102933
    [15] A. Prasad, S. Chandra, VMFCVD: An optimized framework to combat volumetric DDoS attacks using machine learning, Arabian J. Sci. Eng., 47 (2022), 9965–9983. https://doi.org/10.1007/s13369-021-06484-9 doi: 10.1007/s13369-021-06484-9
    [16] C. S. Kalutharage, X. Liu, C. Chrysoulas, N. Pitropakis, P. Papadopoulos, Explainable AI-based DDOS attack identification method for IoT networks, Computers, 12 (2023), 32. https://doi.org/10.3390/computers12020032 doi: 10.3390/computers12020032
    [17] A. Prasad, S. Chandra, BotDefender: A collaborative defense framework against botnet attacks using network traffic analysis and machine learning, Arabian J. Sci. Eng., (2023). https://doi.org/10.1007/s13369-023-08016-z doi: 10.1007/s13369-023-08016-z
    [18] M. Bhattacharya, S. Roy, A. K. Das, S. Chattopadhyay, S. Banerjee, A. Mitra, DDoS attack resisting authentication protocol for mobile based online social network applications, J. Inf. Secur. Appl., 65 (2022), 103115. https://doi.org/10.1016/j.jisa.2022.103115 doi: 10.1016/j.jisa.2022.103115
    [19] O. Thorat, N. Parekh, R. Mangrulkar, TaxoDaCmachine learning: Taxonomy based Divide and Conquer using machine learning approach for DDoS attack classification, Int. J. Inf. Manage. Data Insights, 1 (2021), 100048. https://doi.org/10.1016/j.jjimei.2021.100048 doi: 10.1016/j.jjimei.2021.100048
    [20] M. E. Ahmed, H. Kim, M. Park, Mitigating DNS query-based DDoS attacks with machine learning on software-defined networking, in IEEE Military Communications Conference (MILCOM), (2017), 11–16. https://doi.org/10.1109/MILCOM.2017.8170802
    [21] I. Sreeram, V. P. K. Vuppala, HTTP flood attack detection in application layer using machine learning metrics and bio inspired bat algorithm, Appl. Comput. Inf., 15 (2019), 59–66. https://doi.org/10.1016/j.aci.2017.10.003 doi: 10.1016/j.aci.2017.10.003
    [22] O. Salman, I. H. Elhajj, A. Chehab, A. Kayssi, A machine learning based framework for IoT device identification and abnormal traffic detection, Trans. Emerging Telecommun. Technol., 33 (2022). https://doi.org/10.1002/ett.3743 doi: 10.1002/ett.3743
    [23] X. Liu, L. Zheng, S. Helal, W. Zhang, C. Jia, J. Zhou, A broad learning-based comprehensive defence against SSDP reflection attacks in IoTs, Digital Commun. Networks, 2022 (2022). https://doi.org/10.1016/j.dcan.2022.02.008 doi: 10.1016/j.dcan.2022.02.008
    [24] S. Ismail, Z. El Mrabet, H. Reza, An ensemble-based machine learning approach for cyber-attacks detection in wireless sensor networks, Appl. Sci., 13 (2022), 30. https://doi.org/10.3390/app13010030 doi: 10.3390/app13010030
    [25] D. Kshirsagar, S. Kumar, A feature reduction based reflected and exploited DDoS attacks detection system, J. Ambient Intell. Hum. Comput., 13 (2022), 393–405. https://doi.org/10.1007/s12652-021-02907-5 doi: 10.1007/s12652-021-02907-5
    [26] A. Mishra, N. Gupta, B. B. Gupta, Defensive mechanism against DDoS attack based on feature selection and multi-classifier algorithms, Telecommun. Syst., 82 (2023), 229–244. https://doi.org/10.1007/s11235-022-00981-4 doi: 10.1007/s11235-022-00981-4
    [27] I. Sharafaldin, A. H. Lashkari, S. Hakak, A. A. Ghorbani, Developing realistic Distributed Denial of Service (DDoS) attack dataset and taxonomy, in International Carnahan Conference on Security Technology (ICCST), (2019), 1–8. https://doi.org/10.1109/CCST.2019.8888419
    [28] A. Prasad, S. Chandra, Defending ARP spoofing-based MitM attack using machine learning and device profiling, in 2019 International Carnahan Conference on Security Technology (ICCST), (2022), 978–982. https://doi.org/10.1109/ICCCIS56430.2022.10037723
    [29] D. Tang, L. Tang, R. Dai, J. Chen, X. Li, J. Rodrigues, MF-Adaboost: LDoS attack detection based on multi-features and improved Adaboost, Future Gener. Comput. Syst., 106 (2020), 347–359. https://doi.org/10.1016/j.future.2019.12.034 doi: 10.1016/j.future.2019.12.034
    [30] B. Sabir, M. A. Babar, R. Gaire, A. Abuadbba, Reliability and robustness analysis of machine learning based phishing URL detectors, arXiv preprint, (2022), arXiv: 2005.08454. https://doi.org/10.48550/arXiv.2005.08454
    [31] S. A. Khanday, H. Fatima, N. Rakesh, Implementation of intrusion detection model for DDoS attacks in Lightweight IoT Networks, Expert Syst. Appl., 215 (2023), 119330. https://doi.org/10.1016/j.eswa.2022.119330 doi: 10.1016/j.eswa.2022.119330
    [32] M. M. Alani, E. Damiani, XRecon: An explainbale IoT reconnaissance attack detection system based on ensemble learning, Sensors, 23 (2023), 5298. https://doi.org/10.3390/s23115298 doi: 10.3390/s23115298
    [33] R. Verma, S. Chandra, RepuTE: A soft voting ensemble learning framework for reputation-based attack detection in fog-IoT milieu, Eng. Appl. Artif. Intell., 118 (2023), 105670. https://doi.org/10.1016/j.engappai.2022.105670 doi: 10.1016/j.engappai.2022.105670
    [34] S. Pokhrel, R. Abbas, B. Aryal, IoT security: botnet detection in IoT using machine learning, arXiv preprint, (2021), arXiv: 2104.02231. https://doi.org/10.48550/arXiv.2104.02231
    [35] A. P. Bradley, The use of the area under the ROC curve in the evaluation of machine learning algorithms, Pattern Recognit., 30 (1997), 1145–1159. https://doi.org/10.1016/S0031-3203(96)00142-2 doi: 10.1016/S0031-3203(96)00142-2
    [36] D. Chicco, G. Jurman, The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation, BMC Genomics, 21 (2020), 6. https://doi.org/10.1186/s12864-019-6413-7 doi: 10.1186/s12864-019-6413-7
    [37] Md. M. Rashid, J. Kamruzzaman, M. Ahmed, N. Islam, S. Wibowo, S. Gordon, Performance enhancement of intrusion detection system using bagging ensemble technique with feature selection, in 2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE), (2020), 1–5. https://doi.org/10.1109/CSDE50874.2020.9411608
    [38] Md. Raihan-Al-Masud, H. A. Mustafa, Network intrusion detection system using voting ensemble machine learning, in 2019 IEEE International Conference on Telecommunications and Photonics (ICTP), (2019), 1–4. https://doi.org/10.1109/ICTP48844.2019.9041736
    [39] S. V. J. Rani, I. Ioannou, P. Nagaradjane, C. Christophorou, V. Vassiliou, S. Charan, et al., Detection of DDoS attacks in D2D communications using machine learning approach, Comput. Commun., 198 (2023), 32–51. https://doi.org/10.1016/j.comcom.2022.11.013 doi: 10.1016/j.comcom.2022.11.013
    [40] S. ur Rehman, M. Khaliq, S. I. Imtiaz, A. Rasool, M. Shafiq, A. R. Javed, et al., DIDDOS: An approach for detection and identification of Distributed Denial of Service (DDoS) cyberattacks using Gated Recurrent Units (GRU), Future Gener. Comput. Syst., 118 (2021), 453–466. https://doi.org/10.1016/j.future.2021.01.022 doi: 10.1016/j.future.2021.01.022
    [41] R. J. Alzahrani, A. Alzahrani, Security analysis of DDoS attacks using machine learning algorithms in networks traffic, Electronics, 10 (2021), 2919. https://doi.org/10.3390/electronics10232919 doi: 10.3390/electronics10232919
    [42] S. Sindian, S. Sindian, An enhanced deep autoencoder-based approach for DDoS attack detection, Wseas Trans. Syst. Control, 15 (2020), 716–724. https://doi.org/10.37394/23203.2020.15.72 doi: 10.37394/23203.2020.15.72
    [43] I. Ortet Lopes, D. Zou, F. A. Ruambo, S. Akbar, B. Yuan, Towards effective detection of recent DDoS attacks: A deep learning approach, Secur. Commun. Netw., 2021 (2021), 1–14. https://doi.org/10.1155/2021/5710028 doi: 10.1155/2021/5710028
    [44] D. Javeed, T. Gao, M. T. Khan, SDN-enabled hybrid DL-driven framework for the detection of emerging cyber threats in IoT, Electronics, 10 (2021), 918. https://doi.org/10.3390/electronics10080918 doi: 10.3390/electronics10080918
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2320) PDF downloads(294) Cited by(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog