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

A novel node selection method for wireless distributed edge storage based on SDN and a maldistributed decision model

  • Received: 26 September 2023 Revised: 20 December 2023 Accepted: 08 January 2024 Published: 29 January 2024
  • In distributed edge storage, data storage data is allocated to network edge devices to achieve low latency, high security, and flexibility. However, traditional systems for distributed edge storage only consider individual factors, such as node capacity, while overlooking the network status and the load states of the storage nodes, thereby impacting the system's read and write performance. Moreover, these systems exhibit inadequate scalability in widely adopted wireless terminal application scenarios. To overcome these challenges, this paper introduces a software-defined edge storage model and a distributed edge storage architecture grounded in software-defined networking (SDN) and the Server Message Block (SMB) protocol. A data storage node selection and distribution algorithm is formulated based on a maldistributed decision model that comprehensively considers the network and storage node load states. A system prototype is implemented in combination with 5G wireless communication technology. The experimental results demonstrate that, in comparison to conventional distributed edge storage systems, the proposed wireless distributed edge storage system exhibits significantly enhanced performance under high load conditions, demonstrating superior scalability and adaptability. This approach effectively addresses the scalability limitation, rendering it suitable for edge scenarios in mobile applications and reducing hardware deployment costs.

    Citation: Yejin Yang, Miao Ye, Qiuxiang Jiang, Peng Wen. A novel node selection method for wireless distributed edge storage based on SDN and a maldistributed decision model[J]. Electronic Research Archive, 2024, 32(2): 1160-1190. doi: 10.3934/era.2024056

    Related Papers:

    [1] Asaf Khan, Gul Zaman, Roman Ullah, Nawazish Naveed . Optimal control strategies for a heroin epidemic model with age-dependent susceptibility and recovery-age. AIMS Mathematics, 2021, 6(2): 1377-1394. doi: 10.3934/math.2021086
    [2] Tainian Zhang, Zhixue Luo . Optimal harvesting for a periodic competing system with size structure in a polluted environment. AIMS Mathematics, 2022, 7(8): 14696-14717. doi: 10.3934/math.2022808
    [3] Majid Roohi, Saeed Mirzajani, Ahmad Reza Haghighi, Andreas Basse-O'Connor . Robust stabilization of fractional-order hybrid optical system using a single-input TS-fuzzy sliding mode control strategy with input nonlinearities. AIMS Mathematics, 2024, 9(9): 25879-25907. doi: 10.3934/math.20241264
    [4] Huiling Li, Jin-E Zhang, Ailong Wu . Finite-time stabilization of nonlinear systems with partially known states via aperiodic intermittent control and event-triggered impulsive control. AIMS Mathematics, 2025, 10(2): 3269-3290. doi: 10.3934/math.2025152
    [5] Asaf Khan, Gul Zaman, Roman Ullah, Nawazish Naveed . Correction: Optimal control strategies for a heroin epidemic model with age-dependent susceptibility and recovery-age. AIMS Mathematics, 2021, 6(7): 7318-7319. doi: 10.3934/math.2021429
    [6] Jingjing Yang, Jianqiu Lu . Stabilization in distribution of hybrid stochastic differential delay equations with Lévy noise by discrete-time state feedback controls. AIMS Mathematics, 2025, 10(2): 3457-3483. doi: 10.3934/math.2025160
    [7] Luis X. Vivas-Cruz, Celia Martínez-Lázaro, Cruz Vargas-De-León . A mathematical and numerical study of an age-dependent transactivation model for dynamics of HIV infection. AIMS Mathematics, 2025, 10(6): 14560-14595. doi: 10.3934/math.2025656
    [8] Hasan Çakır . Consimilarity of hybrid number matrices and hybrid number matrix equations A˜XXB=C. AIMS Mathematics, 2025, 10(4): 8220-8234. doi: 10.3934/math.2025378
    [9] Xiaoming Su, Jiahui Wang, Adiya Bao . Stability analysis and chaos control in a discrete predator-prey system with Allee effect, fear effect, and refuge. AIMS Mathematics, 2024, 9(5): 13462-13491. doi: 10.3934/math.2024656
    [10] Huihui Liu, Yaping Wang, Linfei Nie . Dynamical analysis and optimal control of an multi-age-structured vector-borne disease model with multiple transmission pathways. AIMS Mathematics, 2024, 9(12): 36405-36443. doi: 10.3934/math.20241727
  • In distributed edge storage, data storage data is allocated to network edge devices to achieve low latency, high security, and flexibility. However, traditional systems for distributed edge storage only consider individual factors, such as node capacity, while overlooking the network status and the load states of the storage nodes, thereby impacting the system's read and write performance. Moreover, these systems exhibit inadequate scalability in widely adopted wireless terminal application scenarios. To overcome these challenges, this paper introduces a software-defined edge storage model and a distributed edge storage architecture grounded in software-defined networking (SDN) and the Server Message Block (SMB) protocol. A data storage node selection and distribution algorithm is formulated based on a maldistributed decision model that comprehensively considers the network and storage node load states. A system prototype is implemented in combination with 5G wireless communication technology. The experimental results demonstrate that, in comparison to conventional distributed edge storage systems, the proposed wireless distributed edge storage system exhibits significantly enhanced performance under high load conditions, demonstrating superior scalability and adaptability. This approach effectively addresses the scalability limitation, rendering it suitable for edge scenarios in mobile applications and reducing hardware deployment costs.



    Fractional calculus is a branch of mathematics that investigates the properties of arbitrary-order differential and integral operators to address various problems. Fractional differential equations provide a more appropriate model for describing diffusion processes, wave phenomena, and memory effects [1,2,3,4] and possess a diverse array of applications across numerous fields, encompassing stochastic equations, fluid flow, dynamical systems theory, biological and chemical engineering, and other domains[5,6,7,8,9].

    Star graph G=(V,E) consists of a finite set of nodes or vertices V(G)={v0,v1,...,vk} and a set of edges E(G)={e1=v1v0,e2=v2v0,...,ek=vkv0} connecting these nodes, where v0 is the joint point and ei is the length of li the edge connecting the nodes vi and v0, i.e., li=|viv0|.

    Graph theory is a mathematical discipline that investigates graphs and networks. It is frequently regarded as a branch of combinatorial mathematics. Graph theory has become widely applied in sociology, traffic management, telecommunications, and other fields[10,11,12].

    Differential equations on star graphs can be applied to different fields, such as chemistry, bioengineering, and so on[13,14]. Mehandiratta et al. [15] explored the fractional differential system on star graphs with n+1 nodes and n edges,

    {CDα0,xui(x)=fi(x,ui,CDβ0,xui(x)),0<x<li,i=1,2,...,k,ui(0)=0,i=1,2,...,k,ui(li)=uj(lj),i,j=1,2,...,k,ij,ki=1ui=0,i=1,2,...,k,

    where CDα0,x,CDβ0,x are the Caputo fractional derivative operator, 1<α2, 0<βα1, fi,i=1,2,...,k are continuous functions on C([0,1]×R×R). By a transformation, the equivalent fractional differential system defined on [0,1] is obtained. The author studied a nonlinear Caputo fractional boundary value problem on star graphs and established the existence and uniqueness results by fixed point theory.

    Zhang et al. [16] added a function λi(x) on the basis of the reference [15]. In addition, Wang et al. [17] discussed the existence and stability of a fractional differential equation with Hadamard derivative. For more papers on the existence of solutions to fractional differential equations, refer to [18,19,20,21]. By numerically simulating the solution of fractional differential systems, we are able to solve problems more clearly and accurately. However, numerical simulation has been rarely used to describe the solutions of fractional differential systems on graphs [22,23].

    The word chemical is used to distinguish chemical graph theory from traditional graph theory, where rigorous mathematical proofs are often preferred to the intuitive grasp of key ideas and theorems. However, graph theory is used to represent the structural features of chemical substances. Here, we introduce a novel modeling of fractional boundary value problems on the benzoic acid graph (Figure 1). The molecular structure of the benzoic acid seven carbon atoms, seven hydrogen atoms, and one oxygen atom. Benzoic acid is mainly used in the preparation of sodium benzoate preservatives, as well as in the synthesis of drugs and dyes. It is also used in the production of mordants, fungicides, and fragrances. Therefore, a thorough understanding of its properties is of utmost importance.

    Figure 1.  Molecular structure of benzoic acid.

    By this structure, we consider atoms of carbon, hydrogen, and oxygen as the vertices of the graph and also the existing chemical bonds between atoms are considered as edges of the graph. To investigate the existence of solutions for our fractional boundary value problems, we label vertices of the benzoic acid graph in the form of labeled vertices by two values, 0 or 1, and the length of each edge is fixed at e (|ei|=e,i=1,2,...,14) (Figure 2). In this case, we construct a local coordinate system on the benzoic acid graph, and the orientation of each vertex is determined by the orientation of its corresponding edge. The labels of the beginning and ending vertices are taken into account as values 0 and 1, respectively, as we move along any edge.

    Figure 2.  Benzene graphs with vertices 0 or 1.

    Motivated by the above work and relevant literature[15,16,17,18,19,20,21,22,23], we discuss a boundary value problem consisting of nonlinear fractional differential equations defined on |ei|=e,i=1,2,,14 by

    HDα1+ri(t)=ϱαiϕp(fi(s,ri(s),HDβ1+ri(s))),t[1,e],

    and the boundary conditions defined at boundary nodes e1,e2,,e14, and

    ri(1)=0,ri(e)=rj(e),i,j=1,2,,14,ij,

    together with conditions of conjunctions at 0 or 1 with

    ki=1ϱ1iri(e)=0,i=1,2,,14.

    Overall, we consider the existence and stability of solutions to the following nonlinear boundary value problem on benzoic acid graphs:

    {HDα1+ri(t)=ϱαiϕp(fi(s,ri(s),HDβ1+ri(s))),t[1,e],ri(1)=0,i=1,2,,14,ri(e)=rj(e),i,j=1,2,,14,ij,ki=1ϱ1iri(e)=0,i=1,2,,14, (1.1)

    where HDα1+,HDβ1+ represent the Hadamard fractional derivative, α(1,2],β(0,1],fiC([1,e]×R×R), ϱi is a real constant, and ϕp(s)=sgn(s)|s|p1. The existence and Hyers-Ulam stability of the solutions to the system (1.1) are discussed. Moreover, the approximate graphs of the solution are obtained.

    It is also noteworthy that solutions obtained from the problem (1.1) can be depicted in various rational applications of organic chemistry. More precisely, any solution on an arbitrary edge can be described as the amount of bond polarity, bond power, bond energy, etc. This paper lies in the integration of fractional differential equations with graph theory, utilizing the formaldehyde graph as a specific case for numerical simulation, and providing an approximate solution graph after iterations.

    In this section, for conveniently researching the problem, several properties and lemmas of fractional calculus are given, forming the indispensable premises for obtaining the main conclusions.

    Definition 2.1. [2,20] The Hadamard fractional integral of order α, for a function gLp[a,b], 0atb, is defined as

    HIqa+g(t)=1Γ(α)ta(logts)α1g(s)sds,

    and the Hadamard fractional integral is a particular case of the generalized Hattaf fractional integral introduced in [24].

    Definition 2.2. [2,20] Let [a,b]R, δ=tddt and ACnδ[a,b]={g:[a,b]R:δn1(g(t))AC[a,b]}. The Hadamard derivative of fractional order α for a function gACnδ[a,b] is defined as

    HDαa+g(t)=δn(HInαa+)(t)=1Γ(nα)(tddt)nta(logts)nα1g(s)sds,

    where n1<α<n, n=[α]+1, and [α] denotes the integer part of the real number α and log()=loge().

    Definition 2.3. [25] Completely continuous operator: A bounded linear operator f, acting from a Banach space X into another space Y, that transforms weakly-convergent sequences in X to norm-convergent sequences in Y. Equivalently, an operator f is completely-continuous if it maps every relatively weakly compact subset of X into a relatively compact subset of Y.

    Compact operator: An operator A defined on a subset M of a topological vector space X, with values in a topological vector space Y, such that every bounded subset of M is mapped by it into a pre-compact subset of Y. If, in addition, the operator A is continuous on M, then it is called completely continuous on this set. In the case when X and Y are Banach or, more generally, bornological spaces and the operator A:XY is linear, the concepts of a compact operator and of a completely-continuous operator are the same.

    Lemma 2.4. [20] For yACnδ[a,b], the following result hold

    HIα0+(HDα0+)y(t)=y(t)n1k=0ci(logta)k,

    where ciR,i=0,1,,n1.

    Lemma 2.5. [21] For p>2, x,y∣≤M, we have

    ϕp(x)ϕp(y)∣≤(p1)Mp2xy.

    Lemma 2.6. [4] Let M be a closed convex and nonempty subset of a Banach space X. Let T,S be the operators TS:MX such that

    (ⅰ) Tx+SyM whenever x,yM;

    (ⅱ) T is contraction mapping;

    (ⅲ) S is completely continuous in M.

    Then T+S has at least one fixed point in M.

    Proof. For every ZS(M), we have T(x)+z:MM. According to (ⅱ) and the Banach contraction mapping principle, Tx+z=x or zx=Tx has only one solution in M. For any z,˜zS(M), we have

    T(t(z))+z=T(z),T(t(˜z))+z=t(˜z).

    So we have

    |t(z)t(˜z)||T(t(z))T(t(˜z))|+|z˜z|ν|t(z)t(˜z)|+|z˜z|,0ν<1.

    Thus, |t(z)t(˜z)|11ν|z˜z|. It indicates that tC(S(M)). Because of S is completely continuous in M, tS is completely continuous. According to the Schauder fixed point theorem, there exists xM, such that tS(x)=x. So we have

    T(t(S(x)))+S(x)=t(S(x)),Tx+Sx=x.

    Lemma 2.7. Let hi(t)AC([1,e],R),i=1,2,,14; then the solution of the fractional differential equations

    {HDα1+ri(t)=ζi(t),t[1,e],ri(1)=0,i=1,2,,14,ri(e)=rj(e),i,j=1,2,,14,ij,ki=1ϱ1iri(e)=0,i=1,2,,14, (2.1)

    is given by

    ri(t)=1Γ(α)t1(logts)α1ζi(s)sds +logt[1Γ(α1)kj=1(ϱ1jkj=1ϱ1j)e1(loges)α2ζj(s)sds 1Γ(α)kj=1ji(ϱ1jkj=1ϱ1j)(e1(loges)α1(ζj(s)ζi(s)s))ds]. (2.2)

    Proof. By Lemma 2.4, we have

    ri(t)=HIα1+ζi(t)+c(1)i+c(2)ilogt,i=1,2,,14,

    where c(1)i,c(2)i are constants. The boundary condition ri(1)=0 gives c(1)i=0, for i=1,2,,14.

    Hence,

    ri(t)=HIα1+ζi(t)+c(2)ilogt =1Γ(α)t1(logts)α1ζ(s)sds+c(2)ilogt,i=1,2,,14. (2.3)

    Also

    ri(t)=1Γ(α1)t11t(logts)α2ζ(s)sds+1tc(2)i.

    Now, the boundary conditions ri(e)=rj(e) and ki=1ϱ1iri(e)=0 implies that c(2)i must satisfy

    1Γ(α)e1(loges)α1ζi(s)sds+c(2)i=1Γ(α)e1(loges)α1ζj(s)sds+c(2)j, (2.4)
    ki=1ϱ1i(1Γ(α1)e1(loges)α2ζi(s)sdsc(2)i)=0. (2.5)

    On solving above Eqs (2.4) and (2.5), we have

    kj=1ϱ1j(1Γ(α1)e1(loges)α2ζj(s)sds)+λ1ic(2)i=kj=1jiϱ1j[1Γ(α)e1(loges)α1ζj(s)sds1Γ(α)e1(loges)α1ζi(s)sds+c(2)i],

    which implies

    kj=1ϱ1jc(2)i=kj=1ϱ1j1Γ(α1)e1(loges)α2ζj(s)sds+kj=1jiϱ1j1Γ(α)e1(loges)α1(ζj(s)ζi(s)s)ds.

    Hence, we get

    c(2)i=1Γ(α1)kj=1(ϱ1jkj=1ϱ1j)e1(loges)α2ζj(s)sds +1Γ(α)kj=1ji(ϱ1jkj=1ϱ1j)(e1(loges)α1(ζj(s)ζi(s)s))ds. (2.6)

    Hence, inserting the values of c(2)i, we get the solution (2.2). This completes the proof.

    In this section, we discuss the existence and uniqueness of solutions of system (1.1) by using fixed point theory.

    We define the space X={r:rC([1,e],R),HDβ1+rC([1,e],R)} with the norm

    rX=r+HDβ1+u=supt[1,e]|r(t)|+supt[1,e]|HDβ1+r(t)|.

    Then, (X,.X) is a Banach space, and accordingly, the product space (Xk=X1×X2×X14,.Xk) is a Banach space with norm

    rXk=(r1,r2,,r14)X=ki=1riX,(r1,r2,,rk)Xk.

    In view of Lemma 2.7, we define the operator T:XkXk by

    T(r1,r2,,rk)(t):=(T1(r1,r2,,rk)(t),,Tk(r1,r2,,rk)(t)),

    where

    Ti(r1,r2,,rk)(t)=ϱαiΓ(α)t1(logts)α1ϕp(gi(s,ri(s),HDβ1+ri(s)))ds+logtΓ(α1)kj=1(ϱ1jkj=1ϱ1j)ϱαje1(loges)α2ϕp(gj(s,rj(s),HDβ1+rj(s)))dslogtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαje1(loges)α1ϕp(gj(s,rj(s),HDβ1+rj(s)))ds+logtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαie1(loges)α1ϕp(gi(s,ri(s),HDβ1+ri(s)))ds, (3.1)

    where ϕp(fi(s,ri(s),HDβ1+ri(s))s)=ϕp(gi(s,ri(s),HDβ1+ri(s))).

    Assume that the following conditions hold:

    (H1) gi:[1,e]×R×RR,i=1,2,,14 be continuous functions, and there exists nonnegative functions li(t)C[1,e] such that

    |gi(t,x,y)gi(t,x1,y1)|ui(t)(|xx1|+|yy1|),

    where t[1,e],(x,y),(x1,y1)R2;

    (H2) ιi=supt[1,e]|ui(t)|,i=1,2,,14;

    (H3) There exists Qi>0, such that

    |gi(t,x,y)|Qi,t[1,e],(x,y)R×R,i=1,2,,14;

    (H4)sup1tegi(t,0,0)∣=κ<,i=1,2,...,14.

    For computational convenience, we also set the following quantities:

    χi=e(p1)Qp2i(ϱαi+ϱαβi) ×[1Γ(α)+2Γ(α+1)+1Γ(αβ+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)] +ekj=1ji(ϱαj+ϱαβj)(p1)Qp2j ×[1Γ(α)+1Γ(α+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)], (3.2)
    Υi=e(p1)Qp2i(ϱαi+ϱαβi) ×[1Γ(α)+1Γ(α+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)] +ekj=1ji(ϱαj+ϱαβj)(p1)Qp2j ×[1Γ(α)+1Γ(α+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)]. (3.3)

    Theorem 3.1. Assume that (H1) and (H2) hold; then the fractional differential system (1.1) has a unique solution on [1,e] if

    (ki=1χi)(ki=1ιi)<1,

    where χi,i=1,2,,14 are given by Eq (3.2).

    Proof. Let u=(r1,r2,,r14),v=(v1,v2,,v14)Xk,t[1,e], we have

    |Tir(t)Tiv(t)|ϱαiΓ(α)t1(logts)α1|ϕp(gi(s,ri(s),HDβ1+ri(s))ϕp(gi(s,vi(s),HDβ1+vi(s))|ds+logtΓ(α1)kj=1(ϱ1jkj=1ϱ1j)ϱαje1(loges)α2[|ϕp(gj(s,rj(s),HDβ1+rj(s))ϕp(gj(s,vj(s),HDβ1+vj(s))|ds]+logtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαje1(loges)α1[|ϕp(gj(s,rj(s),HDβ1+rj(s))ϕp(gj(s,vj(s),HDβ1+vj(s))|ds]+logtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαie1(loges)α1[|ϕp(gi(s,ri(s),HDβ1+ri(s))ϕp(gi(s,vi(s),HDβ1+vi(s))|ds].

    Using Lemma 2.5, (H1) and (H2), t[1,e] and (ϱ1jkj=1ϱ1j)<1 for j=1,2,,k, we obtain

    |Tir(t)Tiv(t)|eϱαiΓ(α+1)(p1)Qp2iιirivi+eϱαβiΓ(α+1)(p1)Qp2iιiHDβ1+riHDβ1+vi+e(p1)Qp2jkj=1(ϱαjΓ(α)ιjrjvj+ϱαβjΓ(α)ιjHDβ1+rjHDβ1+vj)+e(p1)Qp2jkj=1ji(ϱαjΓ(α+1)ιjrjvj+ϱαβjΓ(α+1)ιjHDβ1+rjHDβ1+vj)+eϱαiΓ(α+1)(p1)Qp2iιirivi+eϱαβiΓ(α+1)(p1)Qp2iιiHDβ1+riHDβ1+vi2e(ϱαi+ϱαβi)Γ(α+1)(p1)Qp2iιi(rivi+HDβ1+riHDβ1+vi)+ekj=1ϱαj+ϱαβjΓ(α)(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj)+ekj=1jiϱαj+ϱαβjΓ(α+1)(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj)=e(1Γ(α)+2Γ(α+1))(ϱαi+ϱαβi)(p1)Qp2iιi(rivi+HDβ1+riHDβ1+vi)+e(1Γ(α)+1Γ(α+1))kj=1ji(ϱαj+ϱαβj)(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj).

    Hence,

    Tir(t)Tiv(t) e(1Γ(α)+2Γ(α+1))(ϱαi+ϱαβi)(p1)Qp2iιi(rivi+HDβ1+riHDβ1+vi) +e(1Γ(α)+1Γ(α+1))kj=1ji(ϱαj+ϱαβj)(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj). (3.4)

    By the formula in reference[3],

    HDβ1+(logts)β1=Γ(β)Γ(βα)(logts)βα1,β>1,

    we have

    |HDβ1+Tir(t)HDβ1+Tiv(t)|ϱαiΓ(αβ)t1(logts)αβ1|ϕp(gi(s,ri(s),HDβ1+ri(s))ϕp(gi(s,vi(s),HDβ1+vi(s))|ds+(logt)1βΓ(α1)Γ(2β)kj=1(ϱ1jkj=1ϱ1j)ϱαje1(loges)α2[|ϕp(gj(s,rj(s),HDβ1+rj(s))ϕp(gj(s,vj(s),HDβ1+vj(s))|ds]+(logt)1βΓ(α)Γ(2β)kj=1ji(ϱ1jkj=1ϱ1j)ϱαje1(loges)α1[|ϕp(gj(s,rj(s),HDβ1+rj(s))ϕp(gj(s,vj(s),HDβ1+vj(s))|ds]+(logt)1βΓ(α)Γ(2β)kj=1ji(ϱ1jkj=1ϱ1j)ϱαie1(loges)α1[|ϕp(gi(s,ri(s),HDβ1+ri(s))ϕp(gi(s,vi(s),HDβ1+vi(s))|ds].

    Using Lemma 2.5, (H1) and (H2), Γ(2β)1 and (ϱ1jkj=1ϱ1j)<1 for j=1,2,,k, we obtain

    |HDβ1+Tir(t)HDβ1+Tiv(t)|eϱαiΓ(αβ+1)(p1)Qp2iιirivi+eϱαiΓ(α+1)Γ(2β)(p1)Qp2iιirivi+eϱαβiΓ(αβ+1)(p1)Qp2iιiHDβ1+riHDβ1+vi+eϱαβiΓ(α+1)Γ(2β)(p1)Qp2iιiHDβ1+riHDβ1+vi+e(p1)Qp2jkj=1(ϱαiΓ(α)Γ(2β)ιjrjvj+ϱαβiΓ(α)Γ(2β)ιjHDβ1+rjHDβ1+vj)+e(p1)Qp2jkj=1ji(λαjΓ(α+1)ιjrjvj+ϱαβjΓ(α+1)ιjHDβ1+rjHDβ1+vj)e(ϱαi+ϱαβi)Γ(αβ+1)(p1)Qp2iιi(rivi+HDβ1+riHDβ1+vi)+ekj=1ϱαj+ϱαβjΓ(α)Γ(2β)(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj)+ekj=1jiϱαj+ϱαβjΓ(α+1)Γ(2β)(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj)+e(ϱαi+ϱαβi)Γ(α+1)Γ(2β)(p1)Qp2iιi(rivi+HDβ1+riHDβ1+vi).

    Hence,

    HDβ1+Tir(t)HDβ1+Tiv(t) e(1Γ(αβ+1)+1(Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)) ×(ϱαi+ϱαβi)(p1)Qp2iιi(rivi+HDβ1+riHDβ1+vi) +e(1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β))kj=1ji(ϱαj+ϱαβj) ×(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj). (3.5)

    From (3.4) and (3.5), we have

    Tir(t)Tiv(t)+HDβ1+Tir(t)HDβ1+Tiv(t)e(1Γ(α)+2Γ(α+1)+1Γ(αβ+1)+1(Γ(α)Γ(2β)+1Γ(α+1)Γ(2β))×(ϱαi+ϱαβi)(p1)Qp2iιi(rivi+HDβ1+riHDβ1+vi)+e(1Γ(α)+1Γ(α+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β))kj=1ji(ϱαj+ϱαβj)×(p1)Qp2jιj(rjvj+HDβ1+rjHDβ1+vj).

    Hence,

    Tir(t)Tiv(t)X e(p1)[(1Γ(α)+2Γ(α+1)+1Γ(αβ+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)) ×Qp2i(ϱαi+ϱαβi)+(1Γ(α)+1Γ(α+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)) ×Qp2jkj=1ji(ϱαj+ϱαβj)](ki=1ιi)(rjvj+HDβ1+rjHDβ1+vj) =χi(ki=1ιi)rvXk, (3.6)

    where χi,i=1,2,,k are given by (3.2).

    From the above Eq (3.6), it follows that

    TrTv)Xk=ki=1TirTivX(ki=1χi)(ki=1ιi)rvXk.

    Since

    (ki=1χi)(ki=1ιi)<1,

    we obtain that T is a contraction map. According to Banach's contraction principle, the original system (1.1) has a unique solution on [1,e].

    Theorem 3.2. Assume that (H1) and (H2) hold; then system (2.1) has at least one solution on [1,e] if

    (ki=1Υi)(ki=1ιi)<1,

    where Υi,i=1,2,,14 are given by Eq (3.3).

    By Theorem 3.1, T is defined under the consideration of Krasnoselskii's fixed point theorem as follows:

    Tμ=ϖ1μ+ϖ2μ,

    where

    ϖ1μ=ϱαiΓ(α)t1(logts)α1ϕp(gi(s,ri(s),HDβ1+ri(s)))ds,ϖ2μ=logtΓ(α1)kj=1(ϱ1jkj=1ϱ1j)ϱαje1(loges)α2ϕp(gj(s,rj(s),HDβ1+rj(s)))dslogtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαje1(loges)α1ϕp(gj(s,rj(s),HDβ1+rj(s)))ds+logtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαie1(loges)α1ϕp(gi(s,ri(s),HDβ1+ri(s)))ds.

    Proof. For any δ=(δ1,δ2,,δ14)(t), μ=(μ1,μ2,,μ14)(t)Xk, we have

    |ϖ2δ(t)ϖ2μ(t)|logtΓ(α1)kj=1(ϱ1jkj=1ϱ1j)ϱαje1(loges)α2[|ϕp(gi(s,δi(s),HDβ1+δi(s))ϕp(gi(s,μi(s),HDβ1+μi(s))|ds]+logtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαje1(loges)α1[|ϕp(gj(s,δj(s),HDβ1+δj(s))ϕp(gj(s,μj(s),HDβ1+μj(s))|ds]+logtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαie1(loges)α1[|ϕp(gi(s,δi(s),HDβ1+δi(s))ϕp(gi(s,μi(s),HDβ1+μi(s))|ds],

    which implies that

    ϖ2δ(t)ϖ2μ(t)e(p1)Qp2jkj=1(ϱαjΓ(α)uj(t)δjμj+ϱαβjΓ(α)uj(t)HDβ1+δjHDβ1+μj)+e(p1)Qp2jkj=1ji(ϱαjΓ(α+1)uj(t)δjμj+ϱαβjΓ(α+1)uj(t)HDβ1+δjHDβ1+μj)+eϱαiΓ(α+1)(p1)Qp2iui(t)δiμi+eϱαβiΓ(α+1)(p1)Qp2iui(t)HDβ1+δiHDβ1+μie(ϱαi+ϱαβi)Γ(α+1)(p1)Qp2iui(t)(δiμi+HDβ1+δiHDβ1+μi)+ekj=1ϱαj+ϱαβjΓ(α)(p1)Qp2juj(t)(δjμj+HDβ1+δjHDβ1+μj)+ekj=1jiϱαj+ϱαβjΓ(α+1)(p1)Qp2juj(t)(δjμj+HDβ1+δjHDβ1+μj)=e(1Γ(α)+1Γ(α+1))(ϱαi+ϱαβi)(p1)Qp2iui(t)(δiμi+HDβ1+δiHDβ1+μi)+e(1Γ(α)+1Γ(α+1))kj=1ji(ϱαj+ϱαβj)(p1)Qp2juj(t)(δjμj+HDβ1+δjHDβ1+μj).

    In a similar way, we get

    |HDβ1+ϖ2δ(t)HDβ1+ϖ2μ(t)|eϱαiΓ(α+1)Γ(2β)(p1)Qp2iui(t)δiμi+eϱαβiΓ(α+1)Γ(2β)(p1)Qp2iui(t)HDβ1+δiHDβ1+μi+e(p1)Qp2jkj=1(ϱαiΓ(α)Γ(2β)uj(t)δjμj+ϱαβiΓ(α)Γ(2β)uj(t)HDβ1+δjHDβ1+μj)+e(p1)Qp2jkj=1ji(ϱαjΓ(α+1)uj(t)δjμj+ϱαβjΓ(α+1)uj(t)HDβ1+δjHDβ1+μj)ekj=1ϱαj+ϱαβjΓ(α)Γ(2β)(p1)Qp2juj(t)(δjμj+HDβ1+δjHDβ1+μj)+ekj=1jiϱαj+ϱαβjΓ(α+1)Γ(2β)(p1)Qp2juj(t)(δjμj+HDβ1+δjHDβ1+μj)+e(λαi+λαβi)Γ(α+1)Γ(2β)(p1)Qp2iuj(t)(δiμi+HDβ1+δiHDβ1+μi).

    Then,

    ϖ2δ(t)ϖ2μ(t)X e(p1)[(1Γ(α)+1Γ(α+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β))Qp2i(ϱαi+ϱαβi) +(1Γ(α)+1Γ(α+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β))Qp2jkj=1ji(ϱαj+ϱαβj)] ×(ki=1ιi)(δjμj+HDβ1+δjHDβ1+μj) =Υi(ki=1ωi)δμXk. (3.7)

    Hence,

    ϖ2δ(t)ϖ2μ(t)Xk=ki=1ϖ2δϖ2μX (ki=1Υi)(ki=1ιi)δμXk. (3.8)

    It follows from (ki=1Υi)(ki=1ιi)<1 that ϖ2 is a contraction operator. In addition, we shall prove that ϖ1 is continuous and compact. For any δ=(δ1,δ2,,δ14)(t)Xk, we have

    ϖ1δ(t)ϱαiΓ(α)t1(logts)α1|ϕp(gi(s,δi(s),HDβ1+δi(s)))|dsϱαiΓ(α)t1(logts)α1|ϕp(gi(s,δi(s),HDβ1+δi(s)))ϕp(gi(s,0,0))|ds+ϱαiΓ(α)t1(logts)α1|ϕp(gi(s,0,0))|dseϱαiΓ(α+1)(p1)Qp2iιi(δi+HDβ1+δi)+eϱαiΓ(α+1)|ϕp(κ)|=eϱαiΓ(α+1)(p1)Qp2iιiδiX+eϱαiΓ(α+1)|ϕp(κ)|.

    Then,

    HDβ1+ϖ1δ(t)ϱαiΓ(αβ)t1(logts)αβ1|ϕp(gi(s,δi(s),HDβ1+δi(s))|dsϱαiΓ(αβ)t1(logts)αβ1|ϕp(gi(s,δi(s),HDβ1+δi(s)))ϕp(gi(s,0,0))|ds+ϱαiΓ(αβ)t1(logts)αβ1|ϕp(gi(s,0,0))|dseϱαiΓ(αβ+1)(p1)Qp2iιi(δi+HDβ1+δi)+eϱαiΓ(αβ+1)|ϕp(κ)|=eϱαiΓ(α+1)(p1)Qp2iιiδiX+eλαiΓ(αβ+1)|ϕp(κ)|,

    which implies

    ϖ1δ(t)X(1Γ(α+1)+1Γ(αβ+1))((p1)Qp2iιiδiX+|ϕp(κ)|). (3.9)

    Hence,

    ϖ1δ(t)Xk(1Γ(α+1)+1Γ(αβ+1))×(ki=1(p1)Qp2iιiδiX+ki=1|ϕp(κ)|)<. (3.10)

    This shows that ϖ1 is bounded. In addition, we will prove that ϖ1 is equi-continuous. Let t1, t2[1,e]; we have

    |ϖ1δ(t2)ϖ1δ(t1)| ϱαiΓ(α)t11((logt2s)α1(logt1s)α1)|ϕp(gi(s,δi(s),HDβ1+δi(s)))|ds +ϱαiΓ(α)t2t1(logt2s)α1|ϕp(gi(s,δi(s),HDβ1+δi(s)))|ds eϱαiϕp(Qi)Γ(α+1)((logt2)α(logt1)α)+ϱαiϕp(Qi)Γ(α)t2t1(logt2s)α1ds, (3.11)

    and

    |HDβ1+ϖ1δ(t2)HDβ1+ϖ1δ(t1)| ϱαiΓ(αβ)t11((logt2s)αβ1(logt1s)αβ1)|ϕp(gi(s,δi(s),HDβ1+δi(s)))|ds +ϱαiΓ(αβ)t2t1(logt2s)αβ1|ϕp(gi(s,δi(s),HDβ1+δi(s)))|ds eϱαiϕp(Qi)Γ(αβ+1)((logt2)αβ(logt1)αβ)+λαiϕp(Qi)Γ(αβ+1)t2t1(logt2s)αβ1ds. (3.12)

    Therefore, from (3.10) and (3.12), we obtain

    ϖ1δ(t2)ϖ1δ(t1)Xeϱαiϕp(Qi)Γ(αβ+1)((logt2)αβ(logt1)αβ)+ϱαiϕp(Qi)Γ(αβ+1)t2t1(logt2s)αβ1ds+eϱαiϕp(Qi)Γ(α+1)((logt2)α(logt1)α)+ϱαiϕp(Qi)Γ(α)t2t1(logt2s)α1ds. (3.13)

    This indicates that ϖ1δ(t2)ϖ1δ(t1)X0, as t2t1.Thus, ϖ1δ(t2)ϖ1δ(t1)Xk0, as t2t1. By the Arzela-Ascoli theorem, we obtain that ω1 is completely continuous. According to Lemma 2.6, system (2.1) has at least one solution on [1,e], which denotes that the original system (1.1) has at least one solution on [1,e].

    Let εi>0. Consider the following inequality

    |HDα1+ri(t)ϱαiϕp(fi(t,ri(t),HDβ1+ri(t)))|εi,t[1,e]. (4.1)

    Definition 4.1. [16] The fractional differential system (1.1) is called Hyers-Ulam stable if there is a constant cf1,f2,...,fk>0 such that for each ε=ε(ε1,ε2,...,εk)>0 and for each solution r=(r1,r2,...,rk)Xk of the inequality (4.1), there exists a solution ˉr=(ˉr1,ˉr2,...,ˉrk)Xk of (1.1) with

    rˉrXkcf1,f2,...,fkε,t[1,e].

    Definition 4.2. [16] The fractional differential system (1.1) is called generalized Hyers-Ulam stable if there exists-function ψf1,f2,...,fkC(R+,R+) with ψf1,f2,...,fk(0)=0 such that for each ε=ε(ε1,ε2,...,εk)>0, and for each solution r=(r1,r2,...,rk)Xk of the inequality (4.1), there exists a solution ˉr=(ˉr1,ˉr2,...,ˉrk)Xk of (1.1) with

    rˉrXψf1,f2,...,fk(ε),t[1,e].

    Remark 4.3. Let function r=(r1,r2,,rk)Xk,k=1,2,,14, be the solution of system (4.1). If there are functions φi:[1,e]R+ dependent on ui respectively, then

    (ⅰ) |φi(t)|εi, t[1,e], i=1,2,,14;

    (ⅱ) HDα1+ri(t)=ϱαiϕp(fi(t,ri(t),HDβ1+ri(t)))+φi(t),t[1,e],i=1,2,...,14.

    Remark 4.4. It is worth noting that Hyers-Ulam stability is different from asymptotic stability, which means that the system can gradually return to equilibrium after being disturbed. If the Lyapunov function satisfies certain conditions, the system is asymptotically stable. This stability emphasizes the behavior of the system over a long period of time, that is, as time goes on, the state of the system will return to the equilibrium state, while the error of Hyers-Ulam stability is bounded (proportional to the size of the disturbance).

    Lemma 4.5. Suppose r=(r1,r2,...,rk)Xk is the solution of inequality (4.1). Then, the following inequality holds:

    |ri(t)ri(t)|εie(1Γ(α)+2Γ(α+1))+εjekj=1ji(1Γ(α)+1Γ(α+1)),|HDβ1+ri(t)HDβ1+ri(t)|εjekj=1ji(1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β))+εie(1Γ(αβ+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)),

    where

    ri(t)=1Γ(α)t1(logts)α1zi(s)ds logtΓ(α1)kj=1(λ1jkj=1λ1j)e1(loges)α2zj(s)ds +logtΓ(α)kj=1ji(λ1jkj=1λ1j)e1(loges)α1zj(s)ds logtΓ(α)kj=1ji(λ1jkj=1λ1j)e1(loges)α1zi(s)ds,HDβ1+ri(t)=1Γ(αβ)t1(logts)αβ1zi(s)ds(logt)1βΓ(α1)Γ(2β)kj=1(λ1jkj=1λ1j)e1(loges)α2zj(s)ds+(logt)1βΓ(α)Γ(2β)kj=1ji(λ1jkj=1λ1j)e1(loges)α1zj(s)ds(logt)1βΓ(α)Γ(2β)kj=1ji(λ1jkj=1λ1j)e1(loges)α1zi(s)ds,

    and here

    zi(s)=hi(s)s,hi(s)=ϱαifi(s,ri(s),HDβ1+ri(s)),i=1,2,,14.

    Proof. From Remark 4.3, we have

    {HDα1+ri(t)=ϱαiϕp(fi(s,ri(s),HDβ1+ri(s)))+φi(t),t[1,e],ri(1)=0,i=1,2,,14,ri(e)=rj(e),i,j=1,2,,14,ij,ki=1ϱ1iri(e)=0,i=1,2,,14. (4.2)

    By Lemma 2.7, the solution of (4.2) can be given in the following form:

    ri(t)=1Γ(α)t1(logts)α1(zi(s)+φi(s)s)ds logtΓ(α1)kj=1(λ1jkj=1λ1j)e1(loges)α2(zj(s)+φj(s)s)ds +logtΓ(α)kj=1ji(λ1jkj=1λ1j)e1(loges)α1(zj(s)+φj(s)s)ds logtΓ(α)kj=1ji(λ1jkj=1λ1j)e1(loges)α1(zi(s)+φi(s)s)ds,

    and

    HDβ1+ri(t)=1Γ(αβ)t1(logts)αβ1(zi(s)+φi(s)s)ds(logt)1βΓ(α1)Γ(2β)kj=1(λ1jkj=1λ1j)e1(loges)α2(zj(s)+φj(s)s)ds+(logt)1βΓ(α)Γ(2β)kj=1ji(λ1jkj=1λ1j)e1(loges)α1(zj(s)+φj(s)s)ds(logt)1βΓ(α)Γ(2β)kj=1ji(λ1jkj=1λ1j)e1(loges)α1(zi(s)+φi(s)s)ds.

    Then, we deduce that

    |ri(t)ri(t)|εi2eΓ(α+1)+kj=1εjeΓ(α)+kj=1jiεjeΓ(α+1)=εie(1Γ(α)+2Γ(α+1))+εjekj=1ji(1Γ(α)+1Γ(α+1))

    and

    |HDβ1+ri(t)HDβ1+ri(t)|εieΓ(αβ+1)+εjeΓ(α+1)Γ(2β)+εjkj=1eΓ(α)Γ(2β)+εikj=1jieΓ(α+1)Γ(2β)=εjekj=1ji(1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β))+εie(1Γ(αβ+1)+1Γ(α)Γ(2β)+1Γ(α+1)Γ(2β)).

    Theorem 4.6. Assume that Theorem 3.1 hold; then the fractional differential system (1.1) is Hyers-Ulam stable if the eigenvalues of matrix A are in the open unit disc. There exists |λ|<1 for λC with det(λIA)=0, where

    A=(θ1(ϱα1+ϱαβ1)(p1)Qp21u1θ2(ϱα2+ϱαβ2)(p1)Qp22u2θ2(ϱα12+ϱαβ12)(p1)Qp212u14θ2(ϱα1+ϱαβ1)(p1)Qp21u1θ1(ϱα2+ϱαβ2)(p1)Qp22u2θ2(ϱα12+ϱαβ12)(p1)Qp212u14θ2(ϱα1+ϱαβ1)(p1)Qp21u1θ2(ϱα2+ϱαβ2)(p1)Qp22u2θ1(ϱα12+ϱαβ12)(p1)Qp212u14).

    Proof. Let r=(r1,r2,...,r14)Xk,k=1,2,14, be the solution of the inequality given by

    |HDα1+ri(t)ϱαiϕp(fi(t,ri(t),HDβ1+ri(t)))|εi,t[1,e],

    and ˉr=(ˉr1,ˉr2,...,ˉr14)Xk be the solution of the following system:

    {HDα1+ˉri(t)=ϱαiϕp(fi(s,ˉri(s),HDβ1+ˉri(s))),t[1,e],ˉri(1)=0,i=1,2,,14,ˉri(e)=ˉrj(e),i,j=1,2,,14,ij,ki=1ϱ1iˉri(e)=0,i=1,2,,14. (4.3)

    By Lemma 2.7, the solution of (4.3) can be given in the following form:

    ˉri(t)=ϱαiΓ(α)t1(logts)α1ϕp(gi(s,ˉri(s),HDβ1+ˉri(s)))dslogtΓ(α1)kj=1(ϱ1jkj=1ϱ1j)ϱαje1(loges)α2ϕp(gj(s,ˉrj(s),HDβ1+ˉrj(s)))ds+logtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαje1(loges)α1ϕp(gj(s,ˉrj(s),HDβ1+ˉrj(s)))dslogtΓ(α)kj=1ji(ϱ1jkj=1ϱ1j)ϱαie1(loges)α1ϕp(gi(s,ˉri(s),HDβ1+ˉri(s)))ds.

    Now, by Lemma 4.5, for t[1,e], we can get

    |ri(t)ˉri(t)||ri(t)ri(t)|+|ri(t)ˉri(t)|εie(1Γ(α)+2Γ(α+1))+εjekj=1ji(1Γ(α)+1Γ(α+1))+e(1Γ(α)+2Γ(α+1))(ϱαi+ϱαβi)(p1)Qp2iui(t)(riˉri+HDβ1+riHDβ1+ˉri)+e(1Γ(α)+1Γ(α+1))kj=1ji(ϱαj+ϱαβj)(p1)Qp2iuj(t)(rjˉrj+HDβ1+rjHDβ1+ˉrj)

    and

    Hence, we have

    where

    Then we have

    where

    Then, we can get

    Let

    Obviously, . Set , then we can get

    (4.4)

    Thus, we have derived that system (1.1) is Hyers-Ulam stable.

    Remark 4.7. Making in (4.4). We have . Then by Definition 4.2, we deduce that the fractional differential system (1.1) is generalized Hyers-Ulam stable.

    The benzoic acid graph we studied in the system (1.1) can be extended to other types of graphs. For example, star graphs and chord bipartite graphs provide a theoretical basis for physics, computer networks, and other fields. Here we only discuss the fractional differential system on the star graphs (i = 1, 2, 3). We discuss the solution of a fractional differential equation on a formaldehyde graph, and the approximate graphs of solutions are presented by using iterative methods and numerical simulation.

    Example 5.1. Consider the following fractional differential equation:

    (5.1)

    corresponding to the system (1.1), we obtain

    Figure 3 (The structure of formaldehyde) is from reference[22]. Coordinate systems with and are established, respectively, on the formaldehyde graph with 3 edges (Figure 4).

    Figure 3.  A sketch of .
    Figure 4.  Formaldehyde graph with labeled vertices.

    For

    For any , it is clear that

    So we get

    and

    Therefore, by Theorem 3.1, system (5.1) has a unique solution on .

    Meanwhile,

    Let

    so we have

    It follows from Theorem 4.6 that system (5.1) is Hyer-Ulams stable, and by Remark 4.4, it will be generalized Hyer-Ulams stable.

    Ultimately, the iterative process curve and approximate solution to the fractional differential system (5.1) are carried out by using the iterative method and numerical simulation. Let , the iteration sequence is as follows:

    The iterative sequence of and is similar to . After several iterations, the approximate solution of fractional differential system (5.1) can be obtained by using the numerical simulation. Figure 5 is the approximate graph of the solution of after iterations. Figure 6 is the approximate graph of the solution of after iterations. Figure 7 is the approximate graph of the solution of after iterations.

    Figure 5.  Approximate solution of .
    Figure 6.  Approximate solution of .
    Figure 7.  Approximate solution of .

    Using the idea of star graphs, several scholars have studied the solutions of fractional differential equations. They chose to utilize star graphs since their method required a central node connected to nearby vertices through interconnections, but there are no edges between the nodes.

    The purpose of this study was to extend the technique's applicability by introducing the concept of a benzoic acid graph, a fundamental molecule in chemistry with the formula . In this manner, we explored a network in which the vertices were either labeled with 0 or 1, and the structure of the chemical molecule benzoic acid was shown to have an effect on this network. To study whether or not there were solutions to the offered boundary value problems within the context of the Caputo fractional derivative with -Laplacian operators, we used the fixed-point theorems developed by Krasnoselskii. Meanwhile, the Hyers-Ulam stability has been considered. In conclusion, an example was given to illustrate the significance of the findings obtained from this research line.

    The following open problems are presented for the consideration of readers interested in this topic: At present, the research prospects of fractional boundary value problems and their numerical solutions on graphs are very broad, which can be extended to other graphs, such as chord bipartite graphs. The follow-up research process, especially the research on chemical graph theory, has a certain practical significance. This is because such research does not need chemical reagents and experimental equipment. In the absence of experimental conditions and reagents, the molecular structure is studied, and the same results are obtained under experimental conditions. Although the differential equation on the benzoic acid graph is studied in this paper, the molecular structure is not studied by the topological index in the research process. It can be tried later to provide a theoretical basis for the study of reverse engineering and provide new ideas for the study of mathematics, chemistry, and other fields.

    Yunzhe Zhang: Writing-original draft, formal analysis, investigation; Youhui Su: Supervision, writing-review, editing and project administration; Yongzhen Yu: Resources, editing. All authors have read and approved the final version of the manuscript for publication.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This work is supported by the Xuzhou Science and Technology Plan Project (KC23058) and the Natural Science Research Project of Jiangsu Colleges and Universities (22KJB110026).

    The author declares no conflicts of interest.



    [1] K. Cao, Y. Liu, G. Meng, Q. Sun, An overview on edge computing research, IEEE Access, 8 (2020), 85714–85728. https://doi.org/10.1109/ACCESS.2020.2991734 doi: 10.1109/ACCESS.2020.2991734
    [2] J. Xia, G. Cheng, S. Gu, D. Guo, Secure and trust-oriented edge storage for Internet of Things, IEEE Internet Things J., 7 (2019), 4049–4060. https://doi.org/10.1109/JIOT.2019.2962070 doi: 10.1109/JIOT.2019.2962070
    [3] M. U. A. Siddiqui, F. Qamar, M. Tayyab, M. N. Hindia, Q. N. Nguyen, R. Hassan, Mobility management issues and solutions in 5G-and-beyond networks: a comprehensive review, Electronics, 11 (2022), 1366. https://doi.org/10.3390/electronics11091366 doi: 10.3390/electronics11091366
    [4] P. Yang, N. Xiong, J. Ren, Data security and privacy protection for cloud storage: A survey, IEEE Access, 8 (2020), 131723–131740. https://doi.org/10.1109/ACCESS.2020.3009876 doi: 10.1109/ACCESS.2020.3009876
    [5] J. Wu, Y. Li, F. Ren, B. Yang, Robust and auditable distributed data storage with scalability in edge computing, Ad Hoc Networks, 117 (2021), 102494. https://doi.org/10.1016/j.adhoc.2021.102494 doi: 10.1016/j.adhoc.2021.102494
    [6] M. Legault, A practitioner's view on distributed storage systems: Overview, challenges and potential solutions, Technol. Innovation Manage. Rev., 11 (2021), 32–41. https://doi.org/10.22215/timreview/1448 doi: 10.22215/timreview/1448
    [7] W. Liu, Research on cloud computing security problem and strategy, in 2012 2nd International Conference on Consumer Electronics, Communications and Networks (CECNet), 8 (2012), 1216–1219. https://doi.org/10.1109/CECNet.2012.6202020
    [8] G. Zhu, D. Liu, Y. Du, C. You, J. Zhang, K. Huang, Toward an intelligent edge: Wireless communication meets machine learning, IEEE Commun. Mag., 58 (2020), 19–25. https://doi.org/10.1109/MCOM.001.1900103 doi: 10.1109/MCOM.001.1900103
    [9] J. Thompson, X. Ge, H. C. Wu, R. Irmer, H. Jiang, G. Fettweis, et al., 5G wireless communication systems: Prospects and challenges, IEEE Commun. Mag., 52 (2014), 62–64. https://doi.org/10.1109/MCOM.2014.6736744 doi: 10.1109/MCOM.2014.6736744
    [10] W. Li, Q. Li, L. Chen, F. Wu, J. Ren, A storage resource collaboration model among edge nodes in edge federation service, IEEE Trans. Veh. Technol., 71 (2022), 9212–9224. https://doi.org/10.1109/TVT.2022.3179363 doi: 10.1109/TVT.2022.3179363
    [11] C. Roy, S. Misra, J. Maiti, M. S. Obaidat, DENSE: Dynamic edge node selection for safety-as-a-service, in 2019 IEEE Global Communications Conference (GLOBECOM), 23 (2019), 1–6. https://doi.org/10.1109/globecom38437.2019.9014180
    [12] M. Abd-El-Malek, W. V. Courtright Ⅱ, C. Cranor, G. R. Ganger, J. Hendricks, A. J. Klosterman, et al., Ursa minor: Versatile cluster-based storage, FAST, 5 (2005), 5.
    [13] D. Puthal, R. Ranjan, A. Nanda, P. Nanda, P. P. Jayaraman, A. Y. Zomaya, Secure authentication and load balancing of distributed edge datacenters, J. Parallel Distrib. Comput., 124 (2019), 60–69. https://doi.org/10.1016/j.jpdc.2018.10.007 doi: 10.1016/j.jpdc.2018.10.007
    [14] Y. Zhang, S. Debroy, P. Calyam, Network measurement recommendations for performance bottleneck correlation analysis, in 2016 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN), 12 (2016), 1–7.
    [15] R. G. Clegg, M. S. Withall, A. W. Moore, I. W. Phillips, D. J. Parish, M. Rio, et al., Challenges in the capture and dissemination of measurements from high-speed networks, IET Commun., 3 (2009), 957–966. https://doi.org/10.1049/iet-com.2008.0068 doi: 10.1049/iet-com.2008.0068
    [16] S. E. Engineer, A. Engineer, Structure and Interpretation of the SMB Protocol, Springer, 2018.
    [17] K. Kirkpatrick, Software-defined networking, Commun. ACM, 56 (2013), 16–19. https://doi.org/10.1109/sta.2019.8717234 doi: 10.1109/sta.2019.8717234
    [18] T. D. Nadeau, K. Gray, SDN: Software Defined Networks: An Authoritative Review of Network Programmability Technologies, O'Reilly Media, Inc., 2013.
    [19] M. T. Rashid, D. Zhang, D. Wang, Edgestore: Towards an edge-based distributed storage system for emergency response, in 2019 IEEE 21st International Conference on High Performance Computing and Communications, 31 (2019), 2543–2550. https://doi.org/10.1109/HPCC/SmartCity/DSS.2019.00356
    [20] A. Makris, E. Psomakelis, T. Theodoropoulos, K. Tserpes, Towards a distributed storage framework for edge computing infrastructures, in Proceedings of the 2nd Workshop on Flexible Resource and Application Management on the Edge, 54 (2022), 9–14. https://doi.org/10.1145/3526059.3533617
    [21] K. Sonbol, Ö. Özkasap, I. Al-Oqily, M. Aloqaily, EdgeKV: Decentralized, scalable, and consistent storage for the edge, J. Parallel Distrib. Comput., 144 (2020), 28–40. https://doi.org/10.1016/j.jpdc.2020.05.009 doi: 10.1016/j.jpdc.2020.05.009
    [22] J. Xing, H. Dai, Z. Yu, A distributed multi-level model with dynamic replacement for the storage of smart edge computing, J. Syst. Archit., 83 (2018), 1–11. https://doi.org/10.1016/j.sysarc.2017.11.002 doi: 10.1016/j.sysarc.2017.11.002
    [23] F. Qiao, J. Wu, J. Li, A. K. Bashir, S. Mumtaz, U. Tariq, Trustworthy edge storage orchestration in intelligent transportation systems using reinforcement learning, IEEE Trans. Intell. Transp. Syst., 22 (2020), 4443–4456. https://doi.org/10.1109/TITS.2020.3003211 doi: 10.1109/TITS.2020.3003211
    [24] W. Li, J. Ji, L. Huang, L. Zhang, Global dynamics and control of malicious signal transmission in wireless sensor networks, Nonlinear Anal. Hybrid Syst., 48 (2023), 101324. https://doi.org/10.1016/j.nahs.2022.101324 doi: 10.1016/j.nahs.2022.101324
    [25] W. Li, J. Ji, L. Huang, Z. Cai, Periodic orbit analysis for a delayed model of malicious signal transmission in wireless sensor networks with discontinuous control, Math. Methods Appl. Sci., 46 (2023), 5267–5285. https://doi.org/10.1002/mma.8831 doi: 10.1002/mma.8831
    [26] K. Kontodimas, P. Soumplis, A. Kretsis, P. Kokkinos, E. Varvarigos, Secure distributed storage on cloud-edge infrastructures, in 2021 IEEE 10th International Conference on Cloud Networking, 93 (2021), 127–132. https://doi.org/10.1109/CloudNet53349.2021.9657156
    [27] C. Wu, Y. Chen, Z. Qi, H. Guan, DSPR: Secure decentralized storage with proof-of-replication for edge devices, J. Syst. Archit., 125 (2022), 102441. https://doi.org/10.1016/j.sysarc.2022.102441 doi: 10.1016/j.sysarc.2022.102441
    [28] S. Li, T. Lan, HotDedup: Managing hot data storage at network edge through optimal distributed deduplication, in IEEE INFOCOM 2020-IEEE Conference on Computer Communications, 144 (2020), 247–256. https://doi.org/10.1109/infocom41043.2020.9155233
    [29] K. He, E. Rozner, K. Agarwal, W. Felter, J. Carter, A. Akella, Presto: Edge-based load balancing for fast datacenter networks, ACM SIGCOMM Comput. Commun. Rev., 45 (2015), 465–478. https://doi.org/10.1145/2785956.2787507 doi: 10.1145/2785956.2787507
    [30] C. Hunt, TCP/IP Network Administration, O'Reilly Media, Inc., 2002.
    [31] R. Sharpe, Just what is SMB?, Oct, 8 (2002), 9.
    [32] S. Khan, A. Gani, A. W. A. Wahab, M. Guizani, M. K. Khan, Topology discovery in software defined networks: Threats, taxonomy, and state-of-the-art, IEEE Commun. Surv. Tutorials, 19 (2016), 303–324. https://doi.org/10.1109/COMST.2016.2597193 doi: 10.1109/COMST.2016.2597193
    [33] A. Bianco, R. Birke, L. Giraudo, M. Palacin, Openflow switching: Data plane performance, in 2010 IEEE International Conference on Communications, 18 (2010), 1–5.
    [34] A. Jalili, H. Nazari, S. Namvarasl, M. Keshtgari, A comprehensive analysis on control plane deployment in SDN: In-band versus out-of-band solutions, in 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI), 89 (2017), 1025–1031. https://doi.org/10.1109/KBEI.2017.8324949
    [35] F. Hu, Q. Hao, K. Bao, A survey on software-defined network and openflow: From concept to implementation, IEEE Commun. Surv. Tutorials, 16 (2014), 2181–2206. https://doi.org/10.1109/COMST.2014.2326417 doi: 10.1109/COMST.2014.2326417
    [36] M. Noto, H. Sato, A method for the shortest path search by extended Dijkstra algorithm, in SMC 2000 Conference Proceedings. 2000 IEEE International Conference on Systems, Man and Cybernetics, 3 (2000), 2316–2320. https://doi.org/10.1109/ICSMC.2000.886462
    [37] S. Syamsudin, R. Rahim, Study approach technique for order of preference by similarity to ideal solution (TOPSIS), Int. J. Recent Trends Eng. Res., 3 (2017), 268–285.
    [38] R. Rohith, M. Moharir, G. Shobha, SCAPY-A powerful interactive packet manipulation program, in 2018 International Conference on Networking, Embedded and Wireless Systems (ICNEWS), 52 (2018), 1–5. https://doi.org/10.1109/ICNEWS.2018.8903954
    [39] C. E. Palazzi, M. Brunati, M. Roccetti, An OpenWRT solution for future wireless homes, in 2010 IEEE International Conference on Multimedia and Expo, 74 (2010), 1701–1706. https://doi.org/10.1109/ICME.2010.5583223
    [40] B. Pfaff, J. Pettit, T. Koponen, E. Jackson, A. Zhou, J. Rajahalme, et al., The design and implementation of open vSwitch, in 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15), 261 (2015), 117–130.
    [41] W. Donat, W. Donat, Introducing the Raspberry Pi, in Learn Raspberry Pi Programming with Python: Learn to Program on the World's Most Popular Tiny Computer, 16 (2018), 1–26.
    [42] S. Vidya, R. Bhaskaran, ARP storm detection and prevention measures, Int. J. Comput. Sci. Issues, 8 (2011), 456.
    [43] V. Rajaravivarma, Virtual local area network technology and applications, in Proceedings the Twenty-Ninth Southeastern Symposium on System Theory, 18 (1997), 49–52. https://doi.org/10.1109/SSST.1997.581577
    [44] W. Li, J. Ji, L. Huang, Global dynamics analysis of a water hyacinth fish ecological system under impulsive control, J. Franklin Inst., 359 (2022), 10628–10652. https://doi.org/10.1016/j.jfranklin.2022.09.030 doi: 10.1016/j.jfranklin.2022.09.030
    [45] A. Tridgell, Samba protocol, Available from: https://www.samba.org/.
  • Reader Comments
  • © 2024 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(1515) PDF downloads(45) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog