Loading [MathJax]/jax/output/SVG/jax.js
Research article

Dynamic analysis of the M/G/1 queueing system with multiple phases of operation

  • Received: 06 September 2024 Revised: 21 October 2024 Accepted: 28 October 2024 Published: 31 October 2024
  • In this paper, we considered the M/G/1 queueing system with multiple phases of operation. First, we have proven the existence and uniqueness of the time-evolving solution for this queueing system. Second, by calculating the spectral distribution of the system operator, we proved that the solution converged at most strongly to its steady-state (static) solution. We also discussed the compactness of the system's corresponding semigroup. Additionally, we investigated the asymptotic behavior of dynamic indicators. Finally, to demonstrate the exponential convergence of the solution, we conducted some numerical analysis.

    Citation: Nurehemaiti Yiming. Dynamic analysis of the M/G/1 queueing system with multiple phases of operation[J]. Networks and Heterogeneous Media, 2024, 19(3): 1231-1261. doi: 10.3934/nhm.2024053

    Related Papers:

    [1] Nurehemaiti Yiming . Spectral distribution and semigroup properties of a queueing model with exceptional service time. Networks and Heterogeneous Media, 2024, 19(2): 800-821. doi: 10.3934/nhm.2024036
    [2] Dirk Helbing, Jan Siegmeier, Stefan Lämmer . Self-organized network flows. Networks and Heterogeneous Media, 2007, 2(2): 193-210. doi: 10.3934/nhm.2007.2.193
    [3] Ciro D'Apice, Peter I. Kogut, Rosanna Manzo . On relaxation of state constrained optimal control problem for a PDE-ODE model of supply chains. Networks and Heterogeneous Media, 2014, 9(3): 501-518. doi: 10.3934/nhm.2014.9.501
    [4] Zhong-Jie Han, Gen-Qi Xu . Spectrum and dynamical behavior of a kind of planar network of non-uniform strings with non-collocated feedbacks. Networks and Heterogeneous Media, 2010, 5(2): 315-334. doi: 10.3934/nhm.2010.5.315
    [5] Alberto Bressan, Khai T. Nguyen . Conservation law models for traffic flow on a network of roads. Networks and Heterogeneous Media, 2015, 10(2): 255-293. doi: 10.3934/nhm.2015.10.255
    [6] Leah Anderson, Thomas Pumir, Dimitrios Triantafyllos, Alexandre M. Bayen . Stability and implementation of a cycle-based max pressure controller for signalized traffic networks. Networks and Heterogeneous Media, 2018, 13(2): 241-260. doi: 10.3934/nhm.2018011
    [7] Caihong Gu, Yanbin Tang . Global solution to the Cauchy problem of fractional drift diffusion system with power-law nonlinearity. Networks and Heterogeneous Media, 2023, 18(1): 109-139. doi: 10.3934/nhm.2023005
    [8] Gabriela Jaramillo . Inhomogeneities in 3 dimensional oscillatory media. Networks and Heterogeneous Media, 2015, 10(2): 387-399. doi: 10.3934/nhm.2015.10.387
    [9] Mauro Garavello, Benedetto Piccoli . On fluido-dynamic models for urban traffic. Networks and Heterogeneous Media, 2009, 4(1): 107-126. doi: 10.3934/nhm.2009.4.107
    [10] Yongqiang Zhao, Yanbin Tang . Approximation of solutions to integro-differential time fractional wave equations in $ L^{p}- $space. Networks and Heterogeneous Media, 2023, 18(3): 1024-1058. doi: 10.3934/nhm.2023045
  • In this paper, we considered the M/G/1 queueing system with multiple phases of operation. First, we have proven the existence and uniqueness of the time-evolving solution for this queueing system. Second, by calculating the spectral distribution of the system operator, we proved that the solution converged at most strongly to its steady-state (static) solution. We also discussed the compactness of the system's corresponding semigroup. Additionally, we investigated the asymptotic behavior of dynamic indicators. Finally, to demonstrate the exponential convergence of the solution, we conducted some numerical analysis.



    Queueing systems with multiple phases of operation are very useful in manufacturing systems, transportation systems, financial systems, etc.; see [1,2,3,4]. For example, in automobile manufacturing, raw materials first enter the stamping workshop for stamping and forming. Continuing with the welding assembly in the welding workshop is the second stage, then carry out surface treatment such as painting, is the third stage. Finally, the final assembly and quality inspection are carried out. In the airport boarding process, passengers first queue up at the check-in counter to complete check-in procedures, including checking in luggage. Then, queue up through the security checkpoint for security checks, is the second stage. Finally, they queue up at the boarding gate to wait for boarding. In hospital medical systems, patients first queue up at the registration counter to register. Then, the second stage is to go to the waiting area of the corresponding department to queue up for the doctor's diagnosis. If further examinations are needed, such as blood tests, X-rays, etc., one needs to queue outside the examination department to wait for the examination, which is the third stage. Finally, they take the examination results and return to the doctor for diagnosis or treatment, such as prescribing medication, intravenous infusion, etc.

    In this paper, we consider the M/G/1 queueing system with multiple phases of operation, where M means that customer arrival follows a Poisson process, G represents the service rate of the server follows a general distribution, 1 indicates the number of servers in the system. Therefore, the M/G/1 queue is a single-server queue where customers arrive according to a Poisson process, and service times are independent and identically distributed general random variables. The process of establishing a mathematical model for the queuing system is as follows:

    There are n+1 phases in this system, 0 is the idle period, and s(s=1,2,,n) are the operational phases. We assume that N(t) denotes the number of customers in the system at time t, J(t) denotes the phase in which the system operates at time t, Rs(t)(s=1,2,,n) represents the elapsed service time of the customer currently receiving service during phase s, Fs(x)=Prob{Rs(t)x}(s=1,2,,n) denotes the probability distribution function corresponding to Rs(t), and μs(x)dx is the service completion rate of the server in the interval (x,x+dx] if the system is in phase s and satisfies μs(x)0 and 0μs(x)dx=. The service time of the any two phases of service are mutually independent. Based on the properties of conditional probability and differentiation, we have

    μs(x)dx=Prob{x<Rs(t)x+dx|Rs(t)>x}=d(1Fs(x))1Fs(x).

    Then, from this and Fs(0)=0, we obtain the probability distribution function of the service time of the server in the phase s,

    Fs(x)=1ex0μs(τ)dτ.

    According to the definition of probability distribution function, we know that Fs(x)0 and limxFs(x)=1. Therefore,

    μs(x)0,0μs(x)dx=.

    We assume that, in phase s, the arrivals occur according to a Poisson process of rate λs>0. In the idle period, the Poisson arrival rate is λ0>0; upon arrival, the system moves to some operative phase s with probability qs, and the customer service upon arrival begins immediately, where qs>0 and ns=1qs=1. Then, according to the definition of Poisson process and exponential distribution, we have

    Prob{N(t)=k,J(t)=s}=(λst)kk!eλst,t0,k0,s=0,1,,n, (1.1a)
    Prob{arriving one customer within the  Δt  time in phase  s}=λsΔt+o(Δt),s=1,2,,n, (1.1b)
    Prob{arriving two or more customers within the   Δt   time in phase  s}=o(Δt),s=1,2,,n, (1.1c)
    Prob{the server completing one service within the   Δt  time in phase   s}=μs(x)Δt+o(Δt),s=1,2,,n, (1.1d)
    Prob{the server completing two or more services within the  Δt  time in phase  s}=o(Δt),s=1,2,,n, (1.1e)

    where o(Δt) denotes the infinitesimal quantity of Δt. Clearly, the process {(N(t),J(t),Rs(t)):t0} is a continuous-time Markov process with state space

    Γ={(0,0)}{(k,s,x)|k=1,2,;s=1,2,,n,x0}.

    We define

    p0,0(t)=Prob{N(t)=0,J(t)=0}, (1.2a)
    pk,s(x,t)dx=Prob{N(t)=k,J(t)=s,xRs(t)<x+dx}. (1.2b)

    Then, consider the changes in the system during Δt time. Based on the formula of total probability, the properties of Markov processes, and the above Eqs (1.1a)–(1.2b), we have (for convenience, assuming Δx is the same as Δt)

    p0,0(t+Δt)=Prob{within the   t+Δt,no customers in the system and the service desk being idle}=Prob{at time  t,no customers in the system, during Δt no customers arriving and the system is idle}+Prob{at time   t  there is one customer in the system,  during  Δt  no customers arriving, server completing one service within   Δt  in phase 1}+Prob{at time   t   there is one customer in the system,  during  Δt  no customers arriving, server completing one service within   Δt   in phase 2}++Prob{at time   t  there is one customer in the system,  during   Δt   no customers arriving, server completing one service within  Δt   in phase n}+o(Δt)=p0,0(t)(1λ0Δt)+0p1,1(x,t)μ1(x)dxΔt(1λ1Δt)+0p1,2(x,t)μ2(x)dxΔt(1λ2Δt)++0p1,n(x,t)μn(x)dxΔt(1λnΔt)+o(Δt), (1.3a)
    p1,s(x+Δt,t+Δt)=Prob{at time  t+Δt, there is one customer in the system, the elapsed service time of the customer currently receiving service during phase  s   is  x+Δt}=Prob{at time   t,there is one customer in the system and the servicetime that has passed is  x,  no customers arrived withinΔt  and the server did not complete the service in phase  s}+o(Δt)=p1,s(x,t)(1λsΔt)(1μs(x)Δt)+o(Δt),,1sn, (1.3b)
    pk,s(x+Δt,t+Δt)=Prob{at time t+\Delta t , there are k customers in the system, the elapsed service time of the customer currently receiving service during phase   s  is   x+Δt}=Prob{at time  t,there are  k  customers in the system and the servicetime that has passed is   x,no customers arrived withinΔt   and the server did not complete the service in phase  s}+Prob{at time  t,there are   k1  customers in the system and the service time that has passed is   x,one customer arrived inΔt   and the server did not complete the service in phases}+o(Δt)=pk,s(x,t)(1λsΔt)(1μs(x)Δt)+pk1,s(x,t)λsΔt(1μs(x)Δt)+o(Δt),s=1,2,,n;k2. (1.3c)

    We consider the boundary conditions as follows:

    p1,s(0,t+Δt)Δt=Prob{at time  t+Δt,there is one customer in the systemin phase  s   and the service has not started yet}=Prob{at time  t,the system is in idle state, buthas just reached one customer and the system has jumped from idle state to phase   s}+Prob{at time  t,there are two customers in the system in phase   s and the server has just completed one service within   Δt}+o(Δt)=p0,0(t)qsΔt+0p2,s(x,t)μs(x)dxΔt+o(Δt),,1sn, (1.4a)
    pk,s(0,t+Δt)Δt=Prob{at time   t+Δt,there are  k  customers in the systemin phase  s  and the service has not yet started}=Prob{at time   t,there are   k+1  customersin the system in phase s and the serverjust completes one service within   Δt   time}+o(Δt)=0pk+1,s(x,t)μs(x)dxΔt+o(Δt),,1sn. (1.4b)

    Assume that the initial values

    p0,0(0)=g0,00,andpk,s(x,0)=gk,s(x)0,k1,s=1,2,,n, (1.5)

    satisfy

    g0,0+ns=1k=10gk,s(x)dx=1.

    Based on Eqs (1.2a)–(1.5) and the definition of partial differential derivatives, we obtain the following integro-partial differential equations [3]:

    {dp0,0(t)dt=λ0p0,0(t)+ns=10p1,s(x,t)μs(x)dx,tp1,s(x,t)+xp1,s(x,t)=[λs+μs(x)]p1,s(x,t),tpk,s(x,t)+xpk,s(x,t)=[λs+μs(x)]pk,s(x,t)+λspk1,s(x,t),k2,p1,s(0,t)=qsλ0p0,0(t)+0p2,s(x,t)μs(x)dx,pk,s(0,t)=0pk+1,s(x,t)μs(x)dx,k2,p0,0(0)=g0,00,pk,s(x,0)=gk,s(x)0,k1,1sn. (1.6)

    In [3], several static indices for the system (1.6) such as the static queue length and static sojourn time distribution of an arbitrary customer were developed under the following static hypothesis:

    limtp0,0(t)=p0,0,

    limtpk,s(,t)=pk,s(),k1,1sn.

    From the perspective of partial differential equations, the above hypothesis implies the following two hypotheses:

    ● (H1): The system (1.6) admits a time-evolving solution.

    ● (H2): The aforementioned time-evolving solution converges to its static.

    In this article, we investigate the aforementioned static hypothesis, that is, (H1) and (H2), and consider the asymptotic behavior of the dynamic indices of the system (1.6). It is worth noting that when n=1, system (1.6) becomes the classical M/G/1 queuing system [5], and a detailed dynamic analysis of this classical queuing system was conducted in [6,7,8,9,10]. Gupur et al. [6] studied the well-posedness of the queueing system [5] and obtained the strong convergence of the solution of the system when the service rate is constant. When the service rate is a bounded function, similar results to [6] are obtained by [7]. In [8,9,10], the exponential convergence of the solution of the queueing system [5] was studied. Therefore, our results include the above findings.

    In the study of partial differential equations, many solutions of partial differential equations can function as semigroups in Banach space. By studying the properties of semigroups, important properties such as the existence, uniqueness, and stability of solutions to partial differential equations can be obtained; see [11,12,13,14,15]. In this article, first, we convert the system (1.6) into an abstract Cauchy problem in a natural state Banach space. Then, using the semigroup theory on Banach spaces, we show that the system operator generates a positive C0semigroup of contractions on the state space. Consequently, we verify that the system (1.6) admits a unique positive time-evolving solution, which shows that (H1) holds under certain conditions.

    Second, we investigate the asymptotic behavior of the solution. To this aim, we need to know the spectrum of the system operator; see [16,17,18]. For example, in order to study the asymptotic stability of multilayer thermal wave systems, Avalos et al. [16] conducted spectral analysis on the system and found that the system operator had no spectral points on the imaginary axis. Drogoul and Veltz [17] proved that 0 is the unique spectral point of the spike neural network operator on the imaginary axis, thus obtaining the exponential stability of the system. In [18], it was proved that 0 is the point spectrum of the system operator of the queuing system and is the unique spectral point, thus obtaining the solution corresponding to this queuing system that strongly converges to its static solution.

    Moreover, it is a challenge to find spectrum on the imaginary axis. Here, we apply Greiner's [19] boundary perturbation method to fully describe the spectral distribution of the system operator on the imaginary axis. If the service rates are constants, then we obtain that the system operator of the system (1.6) has uncountable eigenvalues on the left-half complex plane. Consequently, these spectral results imply that the time-evolving solution of system (1.6) at most strongly converges to its static solution. In other words, (H2) holds only in the context of strong convergence.

    Finally, we discuss the asymptotic behavior of the dynamic indices of the system (1.6). By using cone theory and positive operator theory, we prove that the time-evolving queue length of the system (1.6) converges to its static queue length under some conditions. This asymptotic result includes the result of [3].

    The remaining part of this article is organized as follows. In the next section, we rewrite the system (1.6) as an abstract Cauchy problem in a Banach space and provide the well-posedness. In Section 3, we provide a complete asymptotic behavior of the solution of system (1.6). In Section 4, we discuss the dynamic indices of the system (1.6). To demonstrate the exponential convergence of the solution, we conduct some numerical analysis in Section 5. We conclude this article in the last section.

    We choose the state Banach space of system (1.6) as follows:

    X={(p1,p2,,pn)|p1=(p0,0,p1,1,p2,1,),ps=(p1,s,p2,s,),2sn,p0,0R,pk,sL1[0,),(p1,p2,,pn)=|p0,0|+ns=1k=1pk,sL1[0,)<}.

    Define the maximal operator of the system (1.6) by

    Am(p1,p2,,pn)=((λ0p0,0+ns=1φsp1,sB1p1,1λ1p1,1+B1p2,1λ1p2,1+B1p3,1),(B2p1,2λ2p1,2+B2p2,2λ2p2,2+B2p3,2λ2p3,2+B2p4,2),,(Bnp1,nλnp1,n+Bnp2,nλnp2,n+Bnp3,nλnp3,n+Bnp4,n)),

    with domain

    D(Am)={(p1,p2,,pn)Xdpk,sdxL1[0,),ns=1k=1dpk,sdxL1[0,)<},

    where pk,s are absolutely continuous functions, k1,1sn, and

    {Bsv=dv(x)dx[λs+μs(x)]v(x),vW1,1[0,),φsf=0f(x)μs(x)dx,fL1[0,).

    We choose the boundary space as X=l1×l1××l1n and define boundary operators Ψ,Φ:D(Am)X of the system (1.1a) by

    Ψ(p1,p2,,pn)=((p1,1(0)p2,1(0)),(p1,2(0)p2,2(0)),,(p1,n(0)p2,n(0))),
    Φ(p1,p2,,pn)=((q1λ0p0,0+φ1p2,1φ1p3,1φ1p4,1),(q2λ0p0,0+φ2p2,2φ2p3,2φ2p4,2),,(qnλ0p0,0+φnp2,nφnp3,nφnp4,n)).

    Now, we introduce the system operator (AΦ,D(AΦ)) of the system (1.6) by

    {AΦ(p1,p2,,pn)=Am(p1,p2,,pn),D(AΦ)={(p1,p2,,pn)D(Am)|Ψ(p1,p2,,pn)=Φ(p1,p2,,pn)}. (2.1)

    Then, the system (1.6) can be written as an abstract Cauchy problem in the Banach space X:

    {d(p1,p2,,pn)(,t)dt=AΦ(p1,p2,,pn)(,t),t(0,),(p1,p2,,pn)(,0)=(g1(),g2(),,gn()), (2.2)

    where g1()=(g0,0,g1,1(),g2,1(),),gs()=(g1,s(),g2,s(),),s=2,3,,n.

    Theorem 2.1. Let AΦ be defined by Eq (2.1). If μs(x)¯μs=supx[0,)μs(x)<(1sn), then AΦ generates a positive C0semigroup eAΦt of contractions on X.

    Proof. For self contained and conciseness, we only sketch the proof of Theorem 2.1. To start, we divided operator AΦ into three parts AΦ=A+U+E, where

    A(p1,,pn)=((λ0p0,0dp1,1dxdp2,1dx),(dp1,2(x)dxdp2,2(x)dxdp3,2(x)dx),,(dp1,n(x)dxdp2,n(x)dxdp3,n(x)dx)),
    D(A)={(p1,,pn)X|dpk,s(x)dxL1[0,),pk,s(x)are absolutelycontinuous functions andps(0)=Γ0,sp1+0Γ1,spsdx,k1;1sn},

    where

    Γ1,1=(ex000q1λ0ex0μ10000μ1),
    Γ0,s=(qsλ00000),Γ1,s=(0μs000μs000),2sn.
    U(p1,,pn)=((0(λ1+μ1)p1,1(x)(λ1+μ1)p2,1(x)+λ1p1,1(x)(λ1+μ1)p3,1(x)+λ1p2,1(x)),((λ2+μ2)p1,2(x)(λ2+μ2)p2,2(x)+λ2p1,2(x)(λ2+μ2)p3,2(x)+λ2p2,2(x)),,((λn+μn)p1,n(x)(λn+μn)p2,n(x)+λnp1,n(x)(λn+μn)p3,n(x)+λnp2,n(x))),
    E(p1,,pn)=(ns=1μs0p1,s(x)dx0),
    D(U)=X,D(E)=X.

    We can verify that (γIA)1<1γM0 for all γ>M0=max{¯μ1,¯μ2,,¯μn}, where I represents the identity operator. Moreover, it is easy to prove that D(A) is dense in X. Then, using the Helle-Yosida theorem (see [20,Theorem 4.20]), we obtain that A generates a C0semigroup. Due to the operators U and E being linear bounded, with perturbation theory of the semigroup, we know that AΦ generates a C0semigroup eAΦt. Thus, we complete the proof of this theorem.

    Next, we investigate the isometry of eAΦt. It is easy to obtain that X, the dual space of X, is as follows:

    X={(p1,,pn)|p1=(p0,0,p1,1,p2,1,),ps=(p1,s,p2,s,),2sn,p0,0R,pk,sL[0,),(p1,,pn)=sup{sup|p0,0|,supk11snpk,sL[0,)}<}.

    If we take a set X+={(p1,p2,,pn)Xp0,00,pk,s()0,k1,1sn} in X, then, Theorem 2.1 ensures eAΦtX+X+. Now, for any (p1,p2,,pn)D(AΦ)X+, we choose

    (p1,p2,,pn)=(p1,p2,,pn)((1),(1),,(1)).

    It is not difficult to calculate that for (p1,p2,,pn)X and (p1,p2,,pn)X+, we have

    (p1,p2,,pn),(p1,p2,,pn)=(p1,p2,,pn)[p0,0+ns=1k=10pk,s(x)dx]=(p1,p2,,pn)2.

    This shows that (p1,p2,,pn)Q(p1,p2,,pn), where

    Q(p1,p2,,pn)={(p1,p2,,pn)X|(p1,p2,,pn),(p1,p2,,pn)=(p1,p2,,pn)2=(p1,p2,,pn)2}.

    In addition, we obtain for (p1,p2,,pn)D(AΦ) and (p1,p2,,pn)Q(p1,p2,,pn) that

    AΦ(p1,p2,,pn),(p1,p2,,pn)=(p1,p2,,pn)×{λ0p0,0+ns=10p1,s(x)μs(x)dx+ns=1k=20λspk1,s(x)dx+ns=1k=10[dpk,s(x)dx(λs+μs(x))pk,s(x)]dx}=0. (2.3)

    Then, Eq (2.3) implies that AΦ is conservative with respect to Q(). Theorem 3.6.1 of [21] stated that: Assume that AΦ is densely defined, conservative with respect to Q():D(AΦ)X and (γIAΦ)D(AΦ)=X for some γ>0. Then, for some gD((AΦ)2), the corresponding semigroup to Cauchy problem (2.2) is isometric. Hence, we obtain the following result.

    Theorem 2.2. Let μs() satisfy μs(x)supx[0,)μs(x)<,1sn. If the initial value (p1,p2,,pn)(,0)=(g1(),g2(),,gn()) of the system (2.2) belongs to D(A2Φ), then semigroup eAΦt is isometric for (g1(),g2(),,gn()). That is,

    eAΦt(g1(),g2(),,gn())=(g1(),g2(),,gn()),t[0,). (2.6)

    By combining Theorems 2.1 and 2.2, we obtain the main result in this section.

    Theorem 2.3. Let μs() satisfy μs(x)supx[0,)μs(x)<,1sn. If the initial value (g1(),g2(),,gn()) of system (2.2) belongs to D(A2Φ), then system (2.2) admits a unique positive time-evolving solution (p1(,t),p2(,t),,pn(,t)) which satisfies

    (p1(,t),p2(,t),,pn(,t))=1,t[0,). (2.7)

    Proof. Due to (g1(),g2(),,gn())D(A2Φ) and (g1(),g2(),,gn())X+, it is easy to see that (g1(),g2(),,gn())D(A2Φ)X+. By Theorem 1.81 of [12], we see that the system (1.6) has a unique positive time-evolving solution (p1(,t),p2(,t),,pn(,t)), which can be expressed as

    (p1(,t),p2(,t),,pn(,t))=eAΦt(g1(),g2(),,gn()),t[0,). (2.8)

    From this together with Eq (2.7), we obtain

    (p1(,t),p2(,t),,pn(,t))=eAΦt(g1(),g2(),,gn())=1,t[0,). (2.9)

    This illustrates the physical meaning of (p1(,),p2(,),,pn(,)).

    In this section, our main objective is to address the issue of asymptotic behavior of the time-evolving solution that we stated in Eq (2.8). In this regard, we prove that the time-evolving solution of the system (1.6) strongly converges but not exponentially converges to its static solution. In other words, hypothesis (H2) holds only in the context of strong convergence.

    The main result of this subsection is given by the following Theorem 3.1.

    Theorem 3.1. Let μs(x):[0,)[0,) be a measurable function that satisfies

    0<infx[0,)μs(x)μs(x)supx[0,)μs(x)<,1sn.

    Then, the time-evolving solution of the system (2.2) strongly converges to its static solution. In other words,

    limt(p1,p2,,pn)(,t)(p1,p2,,pn),(g1,g2,,gn)(p1,p2,,pn)()=0,

    where (p1,p2,,pn) and (p1,p2,,pn) are the eigenvectors associated to zero, respectively.

    To prove the above Theorem 3.1, we need to find the spectra of AΦ along the imaginary axis. For this, we first provide the following seven lemmas.

    Lemma 3.1. Let AΦ be defined by Eq (2.1). If μs(x):[0,)[0,) is measurable function that satisfies

    0<μ_s=infx[0,)μs(x)μs(x)¯μs=supx[0,)μs(x)<,1sn,

    then, zero is an eigenvalue of AΦ with geometric multiplicity one.

    Proof. We need to solve AΦ(p1,p2,,pn)=0 for unknown (p1,p2,,pn). This equation is equivalent to

    λ0p0,0=ns=10p1,s(x)μs(x)dx, (3.1a)
    dp1,s(x)dx=[λs+μs(x)]p1,s(x), (3.1b)
    dpk,s(x)dx=[λs+μs(x)]pk,s(x)+λspk1,s(x),k2, (3.1c)
    p1,s(0)=qsλ0p0,0+0p2,s(x)μs(x)dx, (3.1d)
    pk,s(0)=0pk+1,s(x)μs(x)dx,k2. (3.1e)

    Solve Eqs (3.1b) and (3.1c) to obtain

    pk,s(x)=eλsxx0μs(τ)dτkj=1(λsx)j1(j1)!pkj+1,s(0),k1. (3.2)

    If we take pk,s(0)=2(k+1)p1,s(0),p1,s(0)=qsλ0p0,0>0 and define

    ck,s:=0(λsx)kk!eλsxx0μs(τ)dτdx,dk,s:=0μs(x)(λsx)kk!eλsxx0μs(τ)dτdx,k1,

    then pk,s(0)=2(k+1)p1,s(0) satisfies the boundary conditions (3.1d) and (3.1e). Therefore, since the Cauchy product of series, the formula 0μs(x)ex0μs(ξ)dξdx=1, and

    ns=1k=1pk,s(0)=λ0q0,0,k=1ck,s=0ex0μs(τ)dτdx,k=1dk,s=1,

    we have

    ns=1k=10|pk,s(x)|dx=ns=1k=1kj=1cj,spkj+1,s(0)=λ0p0,00ex0μs(τ)dτdxλ0μ_sp0,0<. (3.3)

    Eq (3.3) means that zero is an eigenvalue of AΦ. Moreover, by Eqs (3.1a) and (3.1d)–(3.2), we see that the geometric multiplicity of zero is one.

    Now, we use the idea of [19] to describe the other spectrum of AΦ along the imaginary axis. For this objective, we define the operator (A0,D(A0)) by

    {A0(p1,p2,,pn)=Am(p1,p2,,pn),D(A0)={(p1,p2,,pn)D(Am)|Ψ(p1,p2,,pn)=0}.

    and discuss the inverse of A0.

    For given (y1,y2,,yn)X, consider (γIA0)(p1,p2,,pn)=(y1,y2,,yn) of unknown (p1,p2,,pn)D(A0). This equation can be equivalently written as the following system of equations

    (γ+λ0)p0,0=y0,0+ns=10p1,s(x)μs(x)dx, (3.4a)
    dp1,s(x)dx=[γ+λs+μs(x)]p1,s(x)+y1,s(x), (3.4b)
    dpk,s(x)dx=[γ+λs+μs(x)]pk,s(x)+λspk1,s(x)+yk,s(x),k2, (3.4c)
    pk,s(0)=0,k1;1sn. (3.4d)

    By solving Eqs (3.4a)–(3.4c) and using Eq (3.4d), we obtain

    p1,s(x)=e(γ+λs)xx0μs(τ)dτx0y1,s(τ)e(γ+λs)τ+τ0μs(ξ)dξdτ, (3.5a)
    pk,s(x)=e(γ+λs)xx0μs(τ)dτx0yk,s(τ)e(γ+λs)τ+τ0μs(ξ)dξdτ+λse(γ+λs)xx0μs(τ)dτx0pk1,s(τ)e(γ+λs)τ+τ0μs(ξ)dξdτ,k2, (3.5b)
    p0,0=1γ+λ0y0,0+1γ+λ0ns=10p1,s(x)μs(x)dx=1γ+λ0y0,0+1γ+λ0ns=10μs(x)×[e(γ+λs)xx0μs(τ)dτx0y1,s(τ)e(γ+λs)τ+τ0μs(ξ)dξdτ]dx. (3.5c)

    Denoting by

    Esf(x)=e(γ+λs)xx0μs(τ)dτx0f(τ)e(γ+λs)τ+τ0μs(ξ)dξdτ,fL1[0,), (3.6)

    then the Eqs (3.5a)–(3.5c) and φsf(x)=0f(x)μs(x)dx,fL1[0,) give, if the resolvent of A0 exists,

    (γIA0)1(y1,y2,,yn)=((1γ+λ0ns=1φsEsy1,s(x)0)+(1γ+λ00000E1000λ1E21E100λ21E31λ1E21E1)(y0,0y1,1(x)y2,1(x)y3,1(x)),(E200λ2E22E20λ22E32λ2E22E2)(y1,2(x)y2,2(x)y3,2(x)),,(En00λnE2nEn0λ2nE3nλnE2nEn)(y1,n(x)y2,n(x)y3,n(x))). (3.7)

    The following Lemma 3.2 indicates the resolvent set ρ(A0) of A0.

    Lemma 3.2. Let μs(x):[0,)[0,) be a measurable function that satisfies

    0<μ_s=infx[0,)μs(x)μs(x)¯μs=supx[0,)μs(x)<,1sn.

    Then, {γCRe(γ)+λ0>0,Re(γ)+μ_s>0}ρ(A0).

    Proof. For all fL1[0,), by performing integration by parts to Eq (3.6), it is easy to obtain that Es satisfies the following inequality:

    Es1Re(γ)+λs+μ_s.

    Then, using the inequality φssupx[0,)μs(x), we calculate for any (y1,y2,,yn)X that

    (γIA0)1(y1,y2,,yn)1Re(γ)+λ0|y0,0|+1Re(γ)+λ0ns=1φsEsy1,sL1[0,)+k=1λk11E1kj=1yj,1L1[0,)+k=1λk12E2kj=1yj,2L1[0,)++k=1λk1nEnkj=1yj,nL1[0,)1Re(γ)+λ0|y0,0|+1Re(γ)+λ0ns=1¯μsRe(γ)+λs+μ_sy1,mL1[0,)+1Re(γ)+λ1+μ_1k=1(λ1Re(γ)+λ1+μ_1)k1j=1yj,1L1[0,)+1Re(γ)+λ2+μ_2k=1(λ2Re(γ)+λ2+μ_2)k1j=1yj,2L1[0,)++1Re(γ)+λn+μ_nk=1(λnRe(γ)+λn+μ_n)k1j=1yj,nL1[0,)=1Re(γ)+λ0|y0,0|+1Re(γ)+λ0ns=1¯μsRe(γ)+λs+μ_sy1,sL1[0,)+ns=11Re(γ)+μ_sj=1yj,sL1[0,)sup{1Re(γ)+λ0+1Re(γ)+λ0¯μ1Re(γ)+λ1+μ_1+1Re(γ)+μ_1,1Re(γ)+λ0¯μ2Re(γ)+λ2+μ_2+1Re(γ)+μ_2,,1Re(γ)+λ0¯μnRe(γ)+λn+μ_n+1Re(γ)+μ_n}(y1,y2,,yn). (3.8)

    That is, inequality (3.8) means that the result of this lemma is correct.

    Next, we use the following Lemma 3.3 to provide a specific expression for the Dirichlet operator.

    Lemma 3.3. Let γ{γCRe(γ)+λ0>0,Re(γ)+μ_s>0}. Then, we have (p1,p2,,pn)ker(γIAm) if, and only if,

    p0,0=1γ+λ0ns=1p1,s(0)0μs(x)e(γ+λs)xx0μs(τ)dτdx, (3.9a)
    pk,s(x)=e(γ+λs)x0μs(τ)dτkj=1(λsx)j1(j1)!pkj+1,s(0),k1, (3.9b)
    ps(0)=(p1,s(0),p2,s(0),p3,s(0),)l1,1sn. (3.9c)

    Proof. If (p1,p2,,pn)ker(γIAm), then (γIAm)(p1,p2,,pn)=0, that is,

    (γ+λ0)p0,0=ns=10p1,s(x)μs(x)dx, (3.10a)
    dp1,s(x)dx=[γ+λs+μs(x)]p1,s(x), (3.10b)
    dpk,s(x)dx=[γ+λs+μs(x)]pk,s(x)+λspk1,s(x). (3.10c)

    By solving Eqs (3.10a)–(3.10c), we obtain

    pk,s(x)=e(γ+λs)xx0μs(τ)dτkj=1(λsx)j1(j1)!pkj+1,s(0),k1, (3.11a)
    p0,0=1γ+λ0ns=1p1,s(0)0μs(x)e(γ+λs)xx0μs(τ)dτdx. (3.11b)

    Since (p1,p2,,pn)ker(γIAm), according to the Sobolev embedding theorem [22], we can easily obtain

    k=1|pk,s(0)|k=1pk,sL[0,)k=1(pk,sL1[0,)+dpk,sdxL1[0,))<. (3.12)

    Hence, Eqs (3.11a)–(3.12) show that Eqs (3.9a)–(3.9c) are true.

    On the other hand, if Eqs (3.9a)–(3.9c) hold, due to the formula

    0ecxxkdx=c(k+1)k!

    it holds true for any c>0 and positive integer k1, and performing integration by parts, we deduce

    pk,sL1[0,)0e(Re(γ)+λs)xx0μs(τ)dτkj=1(λsx)j1(j1)!|pkj+1,s(0)|dxkj=1λj1s(j1)!|pkj+1,s(0)|0xj1e[Re(γ)+λs+infx[0,)μs(x)]xdx=kj=1λj1s[Re(γ)+λs+μ_s]j|pkj+1,s(0)|.

    Then, by the Cauchy product of series, we calculate that

    k=1pk,sL1[0,)k=1kj=1λj1s[Re(γ)+λs+μ_s]j|pkj+1,s(0)|=1Re(γ)+λs+μ_sj=1(λsRe(γ)+λs+μ_s)j1k=1|pk,s(0)|=1Re(γ)+μ_sk=1|pk,s(0)|<, (3.13)

    for any γ>μ_s. Inequalities (3.12) and (3.13) show that (p1,p2,,pn)X. In addition, by Eq (3.9b), we have

    dp1,s(x)dx=[γ+λs+μs(x)]p1,s(0)e(γ+λs)xx0μs(τ)dτ=[γ+λs+μs(x)]p1,s(x), (3.14a)
    dpk,s(x)dx=[γ+λs+μs(x)]e(γ+λs)xx0μs(τ)dτkj=1(λsx)j1(j1)!pkj+1,s(0)+λse(γ+λs)xx0μs(τ)dτk1j=1(λsx)j1(j1)!pkj,s(0)=[γ+λs+μs(x)]pk,s(x)+λspk1,s(x),k2. (3.14b)

    Combining the above Eqs (3.14a) and (3.14b) with inequality (3.13), we obtain

    k=1dpk,sdxL1[0,)(|γ|+2λs+supx[0,)μs(x))k=1pk,sL1[0,)<.

    This inequality implies that

    ns=1k=1dpk,sdxL1[0,)<. (3.15)

    Hence, Eqs (3.13)–(3.15) indicate that (p1,p2,,pn)D(Am) and

    (γIAm)(p1,p2,,pn)=0.

    Clearly, by the definition it is not difficult to show that the boundary operator Ψ is surjective. In addition, for all γρ(A0), the operator

    Ψ|ker(γIAm):ker(γIAm)X,

    is invertible. Now, for any γρ(A0), we introduce the Dirichlet operator by

    Dγ:=(Ψ|ker(γIAm))1:Xker(γIAm).

    Then, using Lemma 3.3, for any γρ(A0), we can obtain the following specific expression for Dγ:

    Dγ(p1(0),p2(0),,pn(0))=((1γ+λ0ns=1p1,s(0)φsε1,s000)+(0000ε1,1000ε2,1ε1,100ε3,1ε2,1ε1,10)(p1,1(0)p2,1(0)p3,1(0)p4,1(0)),(ε1,200ε2,2ε1,20ε3,2ε2,2ε1,2)(p1,2(0)p2,2(0)p3,2(0)),,(ε1,n00ε2,nε1,n0ε3,nε2,nε1,n)(p1,n(0)p2,n(0)p3,n(0))), (3.16)

    where

    εj,s=(λsx)j1(j1)!e(γ+λs)xx0μs(τ)dτ,j1,1sn.

    Finally, using the expression of Dirichlet operator (3.16) and the boundary operator Φ, we can calculate the specific expression of ΦDγ as follows:

    ΦDγ(p1(0),p2(0),,pn(0))=(J1,J2,,Jn)(p1(0),p2(0),,pn(0)), (3.17)

    where

    Jk=(qkλ0γ+λ0ns=1p1,s(0)φsε1,s00)+(φkε2,kφkε1,k0φkε3,kφkε2,kφkε1,kφkε4,kφkε3,kφkε2,k)(p1,k(0)p2,k(0)p3,k(0)),1kn.

    The following Lemma 3.4 was found in [23], and we use this lemma along with the above results in this subsection to provide spectrum σ(AΦ) of AΦ on the imaginary axis.

    Lemma 3.4. Assume γρ(A0). If there exists γ0 that satisfies 1σ(ΦDγ0), then γσ(AΦ) if, and only if, 1σ(ΦDγ).

    Lemma 3.5. Let AΦ be defined by Eq (2.1). If μs(x):[0,)[0,) is a measurable function that satisfies

    0<infx[0,)μs(x)μs(x)supx[0,)μs(x)<,1sn,

    then, we have iRσ(AΦ)={0},i2=1.

    Proof. If we take γ=ib,i2=1,bR{0}, then applying the Riemann-Lebesgue lemma, we obtain that there exists M>0 that satisfies

    |0μs(x)(λsx)k1(k1)!e(ib+λs)xx0μs(τ)dτdx|<0μs(x)(λsx)k1(k1)!eλsxx0μs(τ)dτdx, (3.18)

    for all |b|>M. Hence, using inequality (3.18) and the formulas ns=1qs=1 and

    0μs(x)ex0μs(τ)dτdx=1,

    we calculate for ps(0)=(p1,s(0),p2,s(0),p3,s(0),)l1{0} that

    ΦDib(p1(0),p2(0),,pn(0))λ0b2+λ20ns=1|p1,s(0)||φsε1,s|+ns=1k=2|φsεk,s||p1,s(0)|+ns=1k=1|φsεk,s|j=2|pj,s(0)|<ns=1k=1|φsεk,s|j=1|pj,s(0)|=ns=1k=1|0μs(x)(λsx)k1(k1)!e(ib+λs)xx0μs(τ)dτdx|j=1|pj,s(0)|<ns=1k=10μs(x)(λsx)k1(k1)!eλsxx0μs(τ)dτdxj=1|pj,s(0)|=ns=10μs(x)k=1(λsx)k1(k1)!eλsxx0μs(τ)dτdxj=1|pj,s(0)|=ns=10μs(x)ex0μs(τ)dτdxj=1|pj,s(0)|=ns=1j=1|pj,s(0)|=(p1(0),p2(0),,pn(0)). (3.19)

    That is, ΦDib<1 for all |b|>M. Since λ0>0 and μ_s>0, there exists γ1=min{λ0,μ_s}>0 such that {γCRe(γ)>γ1}ρ(A0). This means that γ=ibρ(A0). Then, by the above inequality (3.31), we know that the spectral radius r(ΦDib) of operator ΦDib satisfies r(ΦDib)ΦDib<1 if |b|>M. In other words, 1σ(ΦDib) for |b|>M. This indicates that there must be γ0=2|b| satisfying 1σ(ΦDγ0). Consequently, using Lemma 3.4, we obtain γ=ibσ(AΦ) for |b|>M, i.e.,

    {ib||b|>M}ρ(AΦ) and{ib||b|M}σ(AΦ)iR.

    On the other hand, since eAΦt is a positive uniformly bounded semigroup (Theorem 2.1), using Corollary 2.3 of [24], we obtain that σ(AΦ)iR is imaginary additively cyclic, which states that ibσ(AΦ)iR, and we deduce that ibkσ(AΦ)iR for every integer k. Therefore, combining the above discussion with the inclusion relationship {ib||b|M}σ(AΦ)iR and Lemma 3.1, we have σ(AΦ)iR={0}.

    Lemma 3.6. The specific expression of the adjoint operator AΦ of AΦ is as follows:

    AΦ(p1,p2,,pn)=((λ0ns=1qsp1,s(0)0μ1(x)p1,1(0)μ1(x)p2,1(0))+(λ0000μ1(x)ϕ1λ1000ϕ1λ1000ϕ1)(p0,0p1,1(x)p2,1(x)p3,1(x)),(μ2(x)p0,0μ2(x)p1,2(0)μ2(x)p2,2(0))+(ϕ2λ2000ϕ2λ2000ϕ2λ2)(p1,2(x)p2,2(x)p3,2(x)),,(μn(x)p0,0μn(x)p1,n(0)μn(x)p2,n(0))+(ϕnλn000ϕnλn000ϕnλn)(p1,n(x)p2,n(x)p3,n(x))),

    with domain D(AΦ)={(p1,p2,,pn)Xdpk,s(x)dxexisting andpk,s()=h}, where ϕs=ddx[λs+μs(x)] and h is a positive constant that is independent of k and s.

    Proof. For (p1,p2,,pn)D(AΦ) and (p1,p2,,pn)D(AΦ), using integration by parts, we calculate that

    AΦ(p1,p2,,pn),(p1,p2,,pn)=[λ0p0,0+ns=10p1,s(x)μs(x)dx]p0,0+ns=1{k=10[dpk,s(x)dx(λs+μs(x))pk,s(x)]pk,s(x)dx+k=20λspk1,s(x)pk,s(x)dx}=λ0p0,0p0,0+p0,0ns=10p1,s(x)μs(x)dx+ns=1k=1pk,s(0)pk,s(0)+ns=1k=10pk,s(x)[dpk,s(x)dx(λs+μs(x))pk,s(x)]dx+λsns=1k=10pk,s(x)pk+1,s(x)dx=λ0p0,0p0,0+p0,0ns=10p1,s(x)μs(x)dx+ns=1(qsλ0p0,0+0p2,s(x)μs(x)dx)p1,s(0)+ns=1k=20pk+1,s(x)μs(x)dxpk,s(0)+ns=1k=10pk,s(x)[dpk,s(x)dx(λs+μs(x))pk,s(x)]dx+ns=1λsk=10pk,s(x)pk+1,s(x)dx=λ0p0,0p0,0+p0,0ns=10p1,s(x)μs(x)dx+λ0p0,0ns=1qsp1,s(0)+ns=1k=10pk+1,s(x)μs(x)dxpk,s(0)+ns=1k=10pk,s(x)[dpk,s(x)dx(λs+μs(x))pk,s(x)]dx+ns=1λsk=10pk,s(x)pk+1,s(x)dx=(p0,p1,,pn),AΦ(p0,p1,,pn). (3.20)

    Then, from the last equation of the above Eq (3.20), we can obtain AΦ.

    Lemma 3.7. The zero is an eigenvalue of AΦ with geometric multiplicity one.

    Proof. We consider AΦ(p1,p2,,pn)=0. This equation is equivalent to

    λ0p0,0+λ0ns=1qsp1,s(0)=0, (3.21a)
    dp1,s(x)dx[λs+μs(x)]p1,s(x)+λsp2,s(x)+μs(x)p0,0=0, (3.21b)
    dpk,s(x)dx[λs+μs(x)]pk,s(x)+λspk+1,s(x)+μs(x)pk1,s(0)=0,k2, (3.21c)
    pk,s()=h,k1,1sn. (3.21d)

    By the above equations, it is easy to investigate that

    (p1,p2,,pn)(h):=((h),(h),,(h))D(AΦ),

    is a positive solution of Eqs (3.21a)–(3.21d). In addition, Eqs (3.21a)–(3.21d) are equivalent to

    p0,0=ns=1qsp1,s(0), (3.22a)
    p2,s(x)=1λs[dp1,s(x)dx+(λs+μs(x))p1,s(x)μs(x)p0,0], (3.22b)
    pk+1,s(x)=1λs[dpk,s(x)dx+(λs+μs(x))pk,s(x)μs(x)pk1,s(0)],k2. (3.22c)

    Clearly, Eqs (3.22a)–(3.22c) imply that the geometric multiplicity of zero is one.

    Proof of Theorem 3.1: Theorem 2.1 shows that semigroup eAΦt is a uniformly bounded C0semigroup on Banach space X. In addition, using Lemmas 3.1, 3.5, and 3.7, we obtain that σp(AΦ)iR=σp(AΦ)iR={0} and {γCγ=ib,b0,bR}ρ(AΦ), and zero is an eigenvalue of AΦ with algebraic multiplicity one. Hence, due to Theorem 1.96 of [12], we obtain that the time-evolving solution of system (2.2) converges strongly to its static solution. In other words,

    limt(p1,p2,,pn)(,t)(p1,p2,,pn),(g1,g2,,gn)(p1,p2,,pn)()=0,

    where (p1,p2,,pn) and (p1,p2,,pn) are the eigenvectors associated to zero in Lemmas 3.7 and 3.1, respectively.

    To prove the exponential convergence of the time-evolving solution, we need to find the spectral distribution of AΦ on the left-half complex plane. For this objective, we first provide the following Lemma 3.8.

    Lemma 3.8. If λs<μs,1sn, then each point in

    Λ:={γC||γ+λs+μs±(γ+λs+μs)24λsμs|<2μs,Re(γ)+μs>0}{0},

    is an eigenvalue of AΦ with geometric multiplicity one, in particular

    (min1sn{μs},min1sn{2λsμsλsμs})[max1sn{2λsμsλsμs},0]σ(AΦ).

    Proof. For each γΛ, we consider the equation AΦ(p1,p2,,pn)=γ(p1,p2,,pn) of unknown (p1,p2,,pn)D(AΦ). This is equivalent to the following system:

    (γ+λ0)p0,0=ns=1μs0p1,s(x)dx, (3.23a)
    dp1,s(x)dx=(γ+λs+μs)p1,s(x), (3.23b)
    dpk,s(x)dx=(γ+λs+μs)pk,s(x)+λspk1,s(x),k2, (3.23c)
    p1,s(0)=qsλ0p0,0+μs0p2,s(x)dx, (3.23d)
    pk,s(0)=μs0pk+1,s(x)dx,k2. (3.23e)

    Solving Eqs (3.23b) and (3.23c), we have

    pk,s(x)=e(γ+λs+μs)xkj=1(λsx)kj(kj)!pj,s(0),k1;1sn. (3.24)

    From this together with the formula

    0xkje(γ+λs+μs)xdx=(kj)!(γ+λs+μs)k+1j,Re(γ)+λs+μs>0,

    we obtain

    0pk,s(x)dx=kj=1λkjs(γ+λs+μs)k+1jpj,s(0),k1. (3.25)

    We can thus combine Eqs (3.23e) and (3.25) to obtain

    pk,s(0)=μsk+1j=1λk+1js(γ+λs+μs)k+2jpj,s(0),k2. (3.26)

    This yields

    pk+1,s(0)λsγ+λs+μspk,s(0)=μsγ+λs+μspk+2,s(0),k2.

    Clearly, the above equation is equivalent to

    pk+2,s(0)=γ+λs+μsμspk+1,s(0)λsμspk,s(0),k2. (3.27)

    For any complex number ξs and ηs,1sn, if we set

    pk+2,s(0)ξspk+1,s(0)=ηs[pk+1,s(0)ξspk,s(0)],k2, (3.28)

    then it is easy to see that ξs and ηs satisfy the following two equations:

    ξs+ηs=γ+λs+μsμs,ξsηs=λsμs. (3.29)

    From Eq (3.29), it is easy to determine that

    ξs=γ+λs+μs+(γ+λs+μs)24λsμs2μs, (3.30a)
    ηs=γ+λs+μs(γ+λs+μs)24λsμs2μs. (3.30b)

    Note that from Eq (3.28), we observe that

    pk+2,s(0)ξspk+1,s(0)=ηk1s[p3,s(0)ξsp2,s(0)],k2. (3.31)

    Then, by reusing the above equations and organizing it, we obtain

    pk+2,s(0)=ξspk+1,s(0)ξs[pk+1,s(0)ξspk,s(0)]ξ2s[pk,s(0)ξspk1,s(0)]ξ3s[pk1,s(0)ξspk2,s(0)]ξk2s[p4,s(0)ξsp3,s(0)]=[ηk1s+ξsηk2s++ξk2sηs+ξk1s]p3,s(0)[ηk2s+ξsηk3s++ξk3sηs+ξk2s]ξsηsp2,s(0),k2. (3.32)

    If ξs=ηs, then Eq (3.32) is simplified as

    pk+2,s(0)=kξk1sp3,s(0)(k1)ξksp2,s(0),k2.

    The inequality |pk+2,s(0)|k|ξs|k1|p3,s(0)|+(k1)|ξs|k|p2,s(0)| can be obtained by taking the absolute value of the above equation. Then, taking the sum of k=2 to for this inequality, we obtain

    k=2|pk+2,s(0)||p3,s(0)|k=2k|ξs|k1+|p2,s(0)|k=2(k1)|ξs|k. (3.33)

    If ξsηs, then Eq (3.32) can be written as

    pk+2,s(0)=p3,s(0)ηsp2,s(0)ξsηsξksp3,s(0)ξsp2,s(0)ξsηsηks.

    This means that

    k=2|pk+2,s(0)||p3,s(0)ηsp2,s(0)ξsηs|k=2|ξs|k+|p3,s(0)ξsp2,s(0)ξsηs|k=2|ηs|k. (3.34)

    Moreover, take the L1[0,)norm on both sides of Eq (3.34), and using the formula

    0xkje(Re(γ)+λs+μs)xdx=(kj)!(Re(γ)+λs+μs)k+1j,

    for all Re(γ)+μs>0, we have

    pk,sL1[0,)kj=1λkjs(kj)!|pj,s(0)|0xkje(Re(γ)+λs+μs)xdx=1Re(γ)+λs+μskj=1(λsRe(γ)+λs+μs)kj|pj,s(0)|. (3.35)

    Therefore, for all Re(γ)+μs>0, by the above inequalities and Cauchy product of series, we obtain

    k=1pk,sL1[0,)1Re(γ)+λs+μsk=1kj=1(λsRe(γ)+λs+μs)kj|pj,s(0)|=1Re(γ)+λs+μsk=1|pk,s(0)|j=1(λsRe(γ)+λs+μs)j1=1Re(γ)+μsk=1|pk,s(0)|. (3.36)

    In addition, from Eqs (3.23a), (3.25), (3.23d), and (3.26), it is easy to calculate that

    p0,0=1γ+λ0ns=1μsγ+λs+μsp1,s(0), (3.37a)
    p1,s(0)=qsλ0p0,0+μs[λs(γ+λs+μs)2p1,s(0)+1γ+λs+μsp2,s(0)], (3.37b)
    p2,s(0)=(γ+λs+μs)2λsμsμs(γ+λs+μs)p1,s(0)(γ+λs+μs)qsλ0μsp0,0, (3.37c)
    p3,s(0)=(γ+λs+μs)2λsμsμs(γ+λs+μs)p2,s(0)(λsγ+λs+μs)2p1,s(0). (3.37d)

    Finally, by Eqs (3.30a) and (3.30b), it is easy to see that γΛ if, and only if, Re(γ)+μs>0 and |ξs|<1,|ηs|<1,1sn. Therefore, if γΛ, then from Eqs (3.36), (3.33), (3.34), (3.37a), and (3.37d), we obtain

    (p1,p2,,pn)=|p0,0|+ns=1k=1pk,sL1[0,)<. (3.38)

    The Eq (3.38) shows that for any γ in Λ is an eigenvalue of AΦ. Moreover, Eqs (3.24), (3.26), (3.32), (3.37a), and (3.37d) mean that the geometric multiplicity of every γΛ is one.

    Next, we observe the case γR. Since Theorem 2.3 implies that (0,)ρ(AΦ), the real spectrum of AΦ in the interval (,0] exists. We discuss the real spectrum of AΦ in the following three cases.

    Case 1: (γ+λs+μs)2>4λsμs if, and only if, |γ+λs+μs|>2λsμs. Since γ+μs>0 and γ+λs+μs>2λsμs, we have γ>2λsμsλsμs. From this together with λs<μs and γ+μs>0, it is easy to calculate that

    γ<04μs(γ+λs)4λsμs<0(γ+λs)2+2μs(γ+λs)+μ2s4λsμs<(γ+λs)22μs(γ+λs)+μ2s(γ+λs+μs)24λsμs<(γ+λsμs)γ+λs+μs+(γ+λs+μs)24λsμs<2μs0<ξs=γ+λs+μs+(γ+λs+μs)24λsμs2μs<1,0<ηs=γ+λs+μs(γ+λs+μs)24λsμs2μs<ξs<1. (3.39)

    This implies (max1sn{2λsμsλsμs},0)σ(AΦ). Then, from this together with Lemma 3.1, we obtain

    (max1sn{2λsμsλsμs},0]σ(AΦ).

    Case 2: (γ+λs+μs)2=4λsμs if, and only if, |γ+λs+μs|=2λsμs. Since γ+μs>0 and γ+λs+μs=2λsμs, we deduce γ=2λsμsλsμs. Then, using λs<μs and γ+μs>0, we have

    0<ξs=ηs=γ+λs+μs2μs=2λsμs2μs=λsμs<1.

    This shows that max{2λ1μ1λ1μ1,,2λnμnλnμn} is an eigenvalue of AΦ.

    Case 3: (γ+λs+μs)2<4λsμs if, and only if, 2λsμs<γ+λs+μs<2λsμs. Since γ+μs>0 and 0<γ+λs+μs<2λsμs, we obtain γ<2λsμsλsμs. Then, from this together with λs<μs, γ+μs>0, and i2=1, we have

    ξs,ηs=γ+λs+μs±i4λsμs(γ+λs+μs)22μs.

    Therefore,

    |ξs|=|ηs|=(γ+λs+μs)2+4λsμs(γ+λs+μs)22μs=λsμs<1. (3.40)

    Hence, this implies that

    (min1sn{μs},min1sn{2λsμsλsμs})σ(AΦ).

    Consequently, by summing up the above three cases, we obtain

    (min1sn{μs},min1sn{2λsμsλsμs})[max1sn{2λsμsλsμs},0]σ(AΦ).

    Let ω0(AΦ), ωess(AΦ), s(AΦ) represent the growth bound, the essential growth bound, and spectral bound of AΦ, respectively. The spectral mapping theorem [11] means that

    σp(eAΦt)=etσp(AΦ){0},

    Hence, from this property and Lemma 3.8, we obtain that eAΦt has uncountable eigenvalues. Therefore, eAΦt is not compact and it is not eventually compact by Corollary V.3.2 of [11].

    Additionally, due to eAΦt being a C0semigroup on X with generator AΦ, using Corollary IV.2.11 of [11], we know that ω0=max{ωess,s(AΦ)} and σ(AΦ){γC|Re(γ)w} is finite for every w>ωess. Using Lemma 3.8, we can obtain that the spectrum determined condition ω0=s(AΦ) holds and ω0=s(AΦ)=0 (we suggest that readers refer to the proof of Theorem 4.1 in [25] for similar proofs in this part). Hence, using the aforementioned discussions, we have ωess=0. Then, by Proposition 3.5 of [11], we derive that eAΦt is not quasi-compact.

    The main result of this subsection is given by the following Theorem 3.2.

    Theorem 3.2. Let μs():=μs be a constant and λs<μs,1sn. Then, the time-evolving solution of the system (2.2) cannot exponentially converge to its static solution. That is to say, there are no constants M>0 and ε>0 such that

    eAΦt((p1,p2,,pn)(0)+AΦ(p1,p2,,pn))(p1,p2,,pn)(0)Meεt(p1,p2,,pn),

    for any t0 and (p1,p2,,pn)D(AΦ), where (p1,p2,,pn)(0) is the eigenvector associated to zero.

    Proof. Assume that (p1,p2,,pn)(0) and (p1,p2,,pn)(r) are the eigenvectors of 0 and

    rmax1sn{2λsμsλsμs}:=rβs,

    in Lemma 3.8, respectively, for any r(0,1). Hence, using AΦ(p1,p2,,pn)(0)=0 and AΦ(p1,p2,,pn)(r)=rβs(p1,p2,,pn)(r), we have

    eAΦt[(p1,p2,,pn)(0)+AΦ(p1,p2,,pn)(r)]=eAΦt(p1,p2,,pn)(0)+eAΦtAΦ(p1,p2,,pn)(r)=(p1,p2,,pn)(0)+eAΦtrβs(p1,p2,,pn)(δ)=(p1,p2,,pn)(0)+rβserβst(p1,p2,,pn)(r). (3.41)

    Therefore,

    eAΦt((p1,p2,,pn)(0)+AΦ(p1,p2,,pn)(r))(p1,p2,,pn)(0)=r|βs|erβst(p1,p2,,pn)(r),t0,r(0,1). (3.42)

    That is, there are no constants M>0 and ε>0 such that

    eAΦt((p1,p2,,pn)(0)+AΦ(p1,p2,,pn))(p1,p2,,pn)(0)Meεt(p1,p2,,pn).

    for any t0 and (p1,p2,,pn)D(AΦ).

    In neural network [17] and reliability model [12], it has been proven that the semigroup corresponding to these systems is a quasi-compact strongly continuous semigroup, thus they obtain the dynamic solution of the corresponding system that strongly converges to its steady-state solution. Therefore, the result of Theorem 3.2 is significantly different from those in [12,17].

    Define the time-evolving queue length of system (1.6) by

    L(t)=p0,0(t)+ns=1k=10pk,s(x,t)dx.

    Then, by combining Theorems 2.1, 2.3 and 3.1 and Lemma 3.1, we can obtain the asymptotic behavior of L(t).

    Theorem 4.1. Let μs(x):[0,)[0,) be a measurable function that satisfies

    0<infx[0,)μs(x)μs(x)supx[0,)μs(x)<,1sn.

    If the initial value (g1(),g2(),,gn()) of the system (1.6) and the eigenvector (˜p1(),˜p2(),,˜pn()) corresponding to zero satisfying ˜ps()us(), then time-evolving queue length L() of system (1.6) converges to its static queue length. That is to say,

    limtL(t)=˜p0,0+ns=1k=10˜pk,s(x)dx.

    Proof. For any (p1,p2,,pn) and (y1,y2,,yn) in X, we introduce an order relation "" by

    (p1,p2,,pn)(y1,y2,,yn)psys,1snp0,0y0,0andpk,s(x)yk,s(x),x[0,),k1,1sn.

    Then, it is not difficult to show that "" is a partial order relation in X. Therefore, (X,) is a poset. Let (˜p1,˜p2,,˜pn) be the positive eigenvector associated to zero of AΦ (Lemma 3.1). Let (˜p1,˜p2,,˜pn) and the initial value (g1,g2,,gn) of the system (2.2) satisfy the aforementioned partial order relation

    ˜p0,0g0,0,˜pk,s(x)gk,s(x),x[0,),k1,1sn.

    That is, (˜p1,˜p2,,˜pn)(g1,g2,,gn). Due to eAΦt being a positive linear operator (Theorem 2.1), it is a monotone increasing operator. In addition, by Theorem 2.3 and Lemma 3.1, we know that

    {(p1(,t),p2(,t),,pn(,t))=eAΦt(g1(),g2(),,gn()),t0,eAΦt(˜p1(),˜p2(),,˜pn())=(˜p1(),˜p2(),,˜pn()),t0.

    Therefore, from this together with the partial order relation (˜p1,˜p2,,˜pn)(g1,g2,,gn), we have

    eAΦt(˜p1(),˜p2(),,˜pn())eAΦt(g1(),g2(),,gn())(˜p1(),˜p2(),,˜pn())(p1(,t),p2(,t),,pn(,t))˜p0,0p0,0(t),˜pk,s()pk,s(,t),k1,>˜p0,0+ns=1k=10˜pk,s(x)dxp0,0(t)+ns=1k=10pk,s(x,t)dx,t0.

    Theorem 3.1 includes the following result:

    limt[|p0,0(t)˜p0,0|+ns=1k=10|pk,s(x,t)˜pk,s(x)|dx]=0.

    Hence, by Lemma 3.1 and the Lebesgue theorem, we obtain

    limt|L(t)[˜p0,0+ns=1k=10˜pk,s(x)dx]|limt[|p0,0(t)˜p0,0|+ns=1k=10|pk,s(x,t)˜pk,s(x)|dx]=0.

    This inequality shows that

    limtL(t)=˜p0,0+ns=1k=10˜pk,s(x)dx.

    Remark 4.1. In Theorem 4.1, the static queue length is obtained by using the eigenvector that related to zero (Lemma 3.1). This is the same as the result obtained by introducing probability generating functions in [3].

    Similarly, we can obtain the other time-evolving indicators of system (1.6) such as the convergence of the time-evolving average number of customers to its static average number of customers.

    To prove the correctness of the exponential convergence results in this article, we perform numerical analysis on the spectral results in Lemma 3.8. The numerical analysis results are shown in Figures 1 and 2. We obtain these numerical results using Matlab.

    Figure 1.  For Lemma 3.8.
    Figure 2.  For Lemma 3.8.

    In Figure 1(a), we consider that system (1.6) only has the idle period and one operational phase, that is, n=1 in system (1.6). In other words, we consider the classical queuing model [5], and the point spectrum results of the system operator AΦ of this queueing model [5] are obtained in detail in [8,9,10]. If we take λ1=0.1,μ1=0.9, then it is easy to see that λ1μ1=0.10.9<1 and 2λ1μ1λ1μ1=0.4. In addition, Figure 1(a) means that 0<ξ1<1 and 0<η1<1 for all γ(0.4,0). Hence, by Eqs (3.34) and (3.36), we see that every γ(0.4,0) is the point spectrum of AΦ.

    In Figure 1(b), we consider that system (1.6) only has the idle period and two operational phases, that is, n=2 in system (1.6). In this case, we take λ1=0.1,μ1=0.9 and λ2=0.2,μ2=0.8. Then, these values satisfy λ1μ1=19,λ2μ2=14, and maxs=1,2{2λsμsλsμs}=0.2. Moreover, when γ(0.2,0), from Figure 1(b) we see that ξ1,ξ2,η1, and η2 satisfy 0<ξn<1 and 0<ηn<1. Therefore, by Eqs (3.34) and (3.36), we know that all γ(0.2,0) are the point spectrum of AΦ. Figure 1 means that the point spectrum results in Lemma 3.8 are correct if λs<μs,s=1,2. Therefore, the exponential convergence result of Theorem 3.2 is valid.

    In the following, we check whether the condition λs<μs,1sn in Lemma 3.8 is necessary. In Figure 2, we consider that system (1.6) only has the idle period and two operational phases, that is, n=2 in system (1.6). If we take λ1=0.1,μ1=0.9 and λ2=0.8,μ2=0.2, then we have λ1<μ1 and λ2>μ2. In this case, Figure 2(a) means that 0<ξ1<1,0<η1<1, and ξ2>1,η2>1 for all γ(0.2,0).

    If we take λ1=0.9,μ1=0.1 and λ2=0.8,μ2=0.2, then we have λn>μn. In this case, Figure 2(b) implies that ξn>1 and ηn>1 for all γ(0.2,0). Of course, we can choose some different λn and μn, at least one of which satisfies λs0>μs0 for some s0=1,2,,n, to obtain the same conclusion. As a result, Figure 2 means that we cannot obtain whether it is γσp(AΦ), or even whether it is γσ(AΦ) under the above circumstances, where γ(max1sn{2λsμsλsμs},0). Therefore, in Lemma 3.8 (or in Theorem 3.2), we must consider the condition λs<μs. This condition is also the stability condition obtained for system (1.6) in reference [3].

    In this article, we conduct a dynamic analysis of the M/G/1 queueing system with multiple phases of operation. Using operator semigroup theory, we prove that there exists a unique time-evolving solution for this system. We obtain the spectral distribution of the system operator on the imaginary axis and prove that the system operator has an infinite number of eigenvalues on the left-half of the complex plane. As a result, the above solution converges at most strongly to its static solution. We also discuss the compactness of the system's corresponding semigroup by using these spectral results. However, we have not obtained the complete spectrum of the system operator on the left-half of the complex plane. This is the work we will continue to do in the future. Additionally, we obtain that the dynamic queue length of the model strongly converges to its static queue length.

    The method described in this article can only be applied to queuing systems established using the supplementary variable method and described by partial differential equations. For example, we cannot use the method proposed in this paper for the queuing systems in [1,26,27].

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

    We are grateful to the anonymous referees, who read carefully the manuscript and made valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China (No: 12301150) and Natural Science Foundation of Xinjiang Uygur Autonomous Region (No: 2024D01C229).

    The authors declare there is no conflict of interest.



    [1] R. G. Askin, G. J. Hanumantha, Queueing network models for analysis of nonstationary manufacturing systems, Int. J. Prod. Res., 56 (2018), 22–42. https://doi.org/10.1080/00207543.2017.1398432 doi: 10.1080/00207543.2017.1398432
    [2] R. Ibrahim, Managing queueing systems where capacity is random and customers are impatient, Prod. Oper. Manag., 27 (2018), 234–250. https://doi.org/10.1111/poms.12796 doi: 10.1111/poms.12796
    [3] J. J. Li, L. W. Liu, T. Jiang, Analysis of an M/G/1 queue with vacation and multiple phases of operation, Math. Methods Oper. Res., 87 (2018), 51–72. https://doi.org/10.1007/s00186-017-0606-0 doi: 10.1007/s00186-017-0606-0
    [4] N. Paz, U. Yechiali, An M/M/1 queue in random environment with disasters, Asia-Pac. J. Oper. Res., 31 (2014), 1450016. https://doi.org/10.1142/S021759591450016X doi: 10.1142/S021759591450016X
    [5] D. R. Cox, The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables, Math. Proc. Cambridge Philos. Soc., 51 (1955), 433–441. https://doi.org/10.1017/S0305004100030437 doi: 10.1017/S0305004100030437
    [6] G. Gupur, X. Z. Li, G. T. Zhu, Functional Analysis Method in Queueing Theory, Research Information Limited, Herdfortshire, 2001.
    [7] G. Gupur, Advances in queueing models' research, Acta Anal. Funct. Appl., 13 (2011), 225–245.
    [8] G. Gupur, On eigenvalues of the generator of a C0semigroup appearing in queueing theory, Abstr. Appl. Anal., 2014 (2014), 896342. https://doi.org/10.1155/2014/896342 doi: 10.1155/2014/896342
    [9] E. Kasim, G. Gupur, Other eigenvalues of the M/M/1 operator, Acta Anal. Funct. Appl., 13 (2011), 45–53.
    [10] L. Zhang, G. Gupur, Another eigenvalue of the M/M/1 operator, Acta Anal. Funct. Appl., 10 (2008), 81–91.
    [11] K. J. Engel, R. Nagel, One-Parameter Semigroups for Linear Evolution Equations, Springer-Verlag, New York, 2000. https://doi.org/10.1007/b97696
    [12] G. Gupur, Functional Analysis Methods for Reliability Models, Springer-Verlag, Basel, 2011. https://doi.org/10.1007/978-3-0348-0101-0
    [13] J. L. D. Palencia, Semigroup theory and asymptotic profiles of solutions for a higher-order Fisher-KPP problem in RN, Electron. J. Differ. Equations, 2023 (2023), 1–17. https://doi.org/10.58997/ejde.2023.04 doi: 10.58997/ejde.2023.04
    [14] J. L. D. Palencia, Semigroup theory and analysis of solutions for a higher order non-Lipschitz problem with advection RN, Math. Methods Appl. Sci., (2024), 1–17. https://doi.org/10.1002/mma.9902
    [15] J. L. D. Palencia, S. U. Rahman, A. N. Redondo, Heterogeneous diffusion and nonlinear advection in a one-dimensional Fisher-KPP problem, Entropy, 24 (2022), 915. https://doi.org/10.3390/e24070915 doi: 10.3390/e24070915
    [16] G. Avalos, P. G. Geredeli, B. Muha, Wellposedness, spectral analysis and asymptotic stability of a multilayered heat-wave-wave system, J. Differ. Equations, 269 (2020), 7129–7156. https://doi.org/10.1016/j.jde.2020.05.035 doi: 10.1016/j.jde.2020.05.035
    [17] A. Drogoul, R. Veltz, Exponential stability of the stationary distribution of a mean field of spiking neural network, J. Differ. Equations, 270 (2021), 809–842. https://doi.org/10.1016/j.jde.2020.08.001 doi: 10.1016/j.jde.2020.08.001
    [18] N. Yiming, G. Gupur, Well-posedness and asymptotic behavior of the time-dependent solution of an M/G/1 queueing model, J. Pseudo-Differ. Oper. Appl., 10 (2019), 49–92. https://doi.org/10.1007/s11868-018-0256-x doi: 10.1007/s11868-018-0256-x
    [19] G. Greiner, Perturbing the boundary conditions of a generator, Houst. J. Math., 13 (1987), 213–229.
    [20] D. Mugnolo, Semigroup Methods for Evolution Equations on Networks, Springer, 2014. https://doi.org/10.1007/978-3-319-04621-1
    [21] H. O. Fattorini, The Cauchy Problem, Cambridge University Press, 1983.
    [22] R. A. Adams, J. J. F. Fournier, Sobolev Spaces, Elsevier, Oxford, 2003.
    [23] A. Haji, A. Radl, Asymptotic stability of the solution of the M/MB/1 queueing model, Comput. Math. Appl., 53 (2007), 1411–1420. https://doi.org/10.1016/j.camwa.2006.12.005 doi: 10.1016/j.camwa.2006.12.005
    [24] W. Arendt, A. Grabosch, G. Greiner, U. Moustakas, R. Nagel, U. Schlotterbeck, et al., One-Parameter Semigroups of Positive Operators, Springer, Berlin, 1986.
    [25] N. Yiming, Spectral distribution and semigroup properties of a queueing model with exceptional service time, Networks Heterogen. Media, 19 (2024), 800–821. https://doi.org/10.3934/nhm.2024036 doi: 10.3934/nhm.2024036
    [26] A. Dudin, S. Dudin, R. Manzo, L. Raritˊa, Analysis of multi-server priority queueing system with hysteresis strategy of server reservation and retrials, Mathematics, 10 (2022), 3747. https://doi.org/10.3390/math10203747 doi: 10.3390/math10203747
    [27] A. Dudin, S. Dudin, R. Manzo, L. Raritˊa, Queueing system with batch arrival of heterogeneous orders, flexible limited processor sharing and dynamical change of priorities, AIMS Math., 9 (2024), 12144–12169. https://doi.org/10.3934/math.2024593 doi: 10.3934/math.2024593
  • 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(536) PDF downloads(45) Cited by(0)

Figures and Tables

Figures(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog