اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدInfinite server queues in a random fast oscillatory environment
110
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider a $G_t/G_t/infty$ infinite server queueing model in a random environment. More specifically, the arrival rate in our server is modeled as a highly fluctuating stochastic process, which arguably takes into account some small time scale variations often observed in practice. We show a homogenization property for this system, which yields an approximation by a $M_t/G_t/infty$ queue with modified parameters. Our limiting results include the description of the number of active servers, the total accumulated input and the solution of the storage equation. Hence in the fast oscillatory context under consideration, we show how the queuing system in a random environment can be approximated by a more classical Markovian system.
قيم البحث
اقرأ أيضاً
We study infinite server queues driven by Cox processes in a fast oscillatory random environment. While exact performance analysis is difficult, we establish diffusion approximations to the (re-scaled) number-in-system process by proving functional c
entral limit theorems (FCLTs) using a stochastic homogenization framework. This framework permits the establishment of quenched and annealed limits in a unified manner. At the quantitative level, we identity two parameter regimes, termed subcritical and supercritical indicating the relative dominance between the two underlying stochasticities driving our system: the randomness in the arrival intensity and that in the serivce times. We show that while quenched FCLTs can only be established in the subcritical regime, annealed FCLTs can be proved in both cases. Furthermore, the limiting diffusions in the annealed FCLTs display qualitatively different diffusivity properties in the two regimes, even though the stochastic primitives are identical. In particular, when the service time distribution is heavy-tailed, the diffusion is sub- and super-diffusive in the sub- and super-critical cases. The results illustrate intricate interactions between the underlying driving forces of our system.
In this paper we study the number of customers in infinite-server queues with a self-exciting (Hawkes) arrival process. Initially we assume that service requirements are exponentially distributed and that the Hawkes arrival process is of a Markovian
nature. We obtain a system of differential equations that characterizes the joint distribution of the arrival intensity and the number of customers. Moreover, we provide a recursive procedure that explicitly identifies (transient and stationary) moments. Subsequently, we allow for non-Markovian Hawkes arrival processes and non-exponential service times. By viewing the Hawkes process as a branching process, we find that the probability generating function of the number of customers in the system can be expressed in terms of the solution of a fixed-point equation. We also include various asymptotic results: we derive the tail of the distribution of the number of customers for the case that the intensity jumps of the Hawkes process are heavy-tailed, and we consider a heavy-traffic regime. We conclude the paper by discussing how our results can be used computationally and by verifying the numerical results via simulations.
Exponential single server queues with state dependent arrival and service rates are considered which evolve under influences of external environments. The transitions of the queues are influenced by the environments state and the movements of the env
ironment depend on the status of the queues (bi-directional interaction). The structure of the environment is constructed in a way to encompass various models from the recent Operation Research literature, where a queue is coupled e.g. with an inventory or with reliability issues. With a Markovian joint queueing-environment process we prove separability for a large class of such interactive systems, i.e. the steady state distribution is of product form and explicitly given: The queue and the environment processes decouple asymptotically and in steady state. For non-separable systems we develop ergodicity criteria via Lyapunov functions. By examples we show principles for bounding throughputs of non-separable systems by throughputs of two separable systems as upper and lower bound.
We consider a one-dimensional recurrent random walk in random environment (RWRE). We show that the - suitably centered - empirical distributions of the RWRE converge weakly to a certain limit law which describes the stationary distribution of a rando
m walk in an infinite valley. The construction of the infinite valley goes back to Golosov. As a consequence, we show weak convergence for both the maximal local time and the self-intersection local time of the RWRE and also determine the exact constant in the almost sure upper limit of the maximal local time.
A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total number of cu
stomers in the system, as well as a measure-valued process that keeps track of the ages of customers in service, leading to a Markovian description of the dynamics. Under suitable assumptions, a functional central limit theorem is established for the sequence of (centered and scaled) state processes as the number of servers goes to infinity. The limit process describing the total number in system is shown to be an Ito diffusion with a constant diffusion coefficient that is insensitive to the service distribution. The limit of the sequence of (centered and scaled) age processes is shown to be a Hilbert space valued diffusion that can also be characterized as the unique solution of a stochastic partial differential equation that is coupled with the Ito diffusion. Furthermore, the limit processes are shown to be semimartingales and to possess a strong Markov property.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
