Abstract:We introduce a fractional generalization of the Erlang Queues M/E k /1. Such process is obtained through a time-change via inverse stable subordinator of the classical queue process. We first exploit the (fractional) Kolmogorov forward equation for such process, then we use such equation to obtain an interpretation of this process in the queuing theory context. Then we also exploit the transient state probabilities and some features of this fractional queue model, such as the mean queue length, the distributio… Show more
“…Comparing (3) with (10), it is clear that σ α (1) ∼ S α, 1, cos 1 α π 2 α , 0 . The latter observation can be used to state the following lemma (see also [23] Proof. Let σ α be an α-stable subordinator independent of Y.…”
Section: Simulation Of the M/m/1(λ µ; α)mentioning
confidence: 99%
“…Together with a purely mathematical interest, let us stress that this procedure leads also to some interesting applications (see, for instance, [18] in economics, [19] in computing and [20] in computational neurosciences). In the context of queueing theory, this has been first done in [4], in the case of the M/M/1 queue, and then extended in [21,22] to the case of M/M/1 queues with catastrophes, [23] in the case of Erlang queues and [24] for the M/M/∞ queues.…”
Several queueing systems in heavy traffic regimes are shown to admit a diffusive approximation in terms of the Reflected Brownian Motion. The latter is defined by solving the Skorokhod reflection problem on the trajectories of a standard Brownian motion. In recent years, fractional queueing systems have been introduced to model a class of queueing systems with heavy-tailed interarrival and service times. In this paper, we consider a subdiffusive approximation for such processes in the heavy traffic regime. To do this, we introduce the Delayed Reflected Brownian Motion by either solving the Skorohod reflection problem on the trajectories of the delayed Brownian motion or by composing the Reflected Brownian Motion with an inverse stable subordinator. The heavy traffic limit is achieved via the continuous mapping theorem. As a further interesting consequence, we obtain a simulation algorithm for the Delayed Reflected Brownian Motion via a continuous-time random walk approximation.
“…Comparing (3) with (10), it is clear that σ α (1) ∼ S α, 1, cos 1 α π 2 α , 0 . The latter observation can be used to state the following lemma (see also [23] Proof. Let σ α be an α-stable subordinator independent of Y.…”
Section: Simulation Of the M/m/1(λ µ; α)mentioning
confidence: 99%
“…Together with a purely mathematical interest, let us stress that this procedure leads also to some interesting applications (see, for instance, [18] in economics, [19] in computing and [20] in computational neurosciences). In the context of queueing theory, this has been first done in [4], in the case of the M/M/1 queue, and then extended in [21,22] to the case of M/M/1 queues with catastrophes, [23] in the case of Erlang queues and [24] for the M/M/∞ queues.…”
Several queueing systems in heavy traffic regimes are shown to admit a diffusive approximation in terms of the Reflected Brownian Motion. The latter is defined by solving the Skorokhod reflection problem on the trajectories of a standard Brownian motion. In recent years, fractional queueing systems have been introduced to model a class of queueing systems with heavy-tailed interarrival and service times. In this paper, we consider a subdiffusive approximation for such processes in the heavy traffic regime. To do this, we introduce the Delayed Reflected Brownian Motion by either solving the Skorohod reflection problem on the trajectories of the delayed Brownian motion or by composing the Reflected Brownian Motion with an inverse stable subordinator. The heavy traffic limit is achieved via the continuous mapping theorem. As a further interesting consequence, we obtain a simulation algorithm for the Delayed Reflected Brownian Motion via a continuous-time random walk approximation.
“…With the same approach, some classes of fractional birth-death processes have been introduced and studied [37][38][39]: in these papers, properties of these processes are deduced from a fractional version of their Kolmogorov forward equation. Let us recall that fractional processes are shown to be interesting in different application contexts, as, for instance, queueing theory ( [4,5,11]). Here, following the approach of [25], we show the existence of strong solutions for the time-fractional counterpart of the Kolmogorov backward and forward equations of immigration-death processes with the aid of Charlier polynomials and link them to a time-changed immigration-death process.…”
Ascio n e, Gi a c o m o, Le o n e n k o, My kol a a n d Pi r ozzi, E n ric a 2 0 2 1. F r a c tio n al i m mi g r a tio n-d e a t h p r o c e s s e s . Jou r n al of M a t h e m a ti c al An alysis a n d Applic a tio n s 4 9 5 (2) ,
“…The same approach has been used to study the case of fractional immigration-death processes in [5]. Let us also stress out that this approach can be used to study a fractional M/M/∞ queue or a fractional M/M/1 queue with acceleration of service (for some models of fractional queues, we refer to [4,6,15]). However, one could consider a time-change with a different inverse subordinator.…”
In this paper we study strong solutions of some non-local differencedifferential equations linked to a class of birth-death processes arising as discrete approximations of Pearson diffusions by means of a spectral decomposition in terms of orthogonal polynomials and eigenfunctions of some non-local derivatives. Moreover, we give a stochastic representation of such solutions in terms of time-changed birth-death processes and study their invariant and their limit distribution. Finally, we describe the correlation structure of the aforementioned time-changed birth-death processes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.