اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدErgodicity Bounds for the Markovian Queue With Time-Varying Transition Intensities, Batch Arrivals and One Queue Skipping Policy
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we revisit the Markovian queueing system with a single server, infinite capacity queue and the special queue skipping policy. Customers arrive in batches, but are served one by one according to any conservative discipline. The size of the arriving batch becomes known upon its arrival and at any time instant the total number of customers in the system is also known. According to the adopted queue skipping policy if a batch, which size is greater than the current system size, arrives to the system, all current customers in the system are removed from it and the new batch is placed in the queue. Otherwise the new batch is lost. The distribution of the total number of customers in the system is under consideration under assumption that the arrival intensity $lambda(t)$ and/or the service intensity $mu(t)$ are non-random functions of time. We provide the method for the computation of the upper bounds for the rate of convergence of system size to the limiting regime, whenever it exists, for any bounded $lambda(t)$ and $mu(t)$ (not necessarily periodic) and any distribution of the batch size. For periodic intensities $lambda(t)$ and/or $mu(t)$ and light-tailed distribution of the batch size it is shown how the obtained bounds can be used to numerically compute the limiting distribution of the queue size with the given error. Illustrating numerical examples are provided.
قيم البحث
اقرأ أيضاً
We study a generalization of the $M/G/1$ system (denoted by $rM/G/1$) with independent and identically distributed (iid) service times and with an arrival process whose arrival rate $lambda_0f(r)$ depends on the remaining service time $r$ of the curr
ent customer being served. We derive a natural stability condition and provide a stationary analysis under it both at service completion times (of the queue length process) and in continuous time (of the queue length and the residual service time). In particular, we show that the stationary measure of queue length at service completion times is equal to that of a corresponding $M/G/1$ system. For $f > 0$ we show that the continuous time stationary measure of the $rM/G/1$ system is linked to the $M/G/1$ system via a time change. As opposed to the $M/G/1$ queue, the stationary measure of queue length of the $rM/G/1$ system at service completions differs from its marginal distribution under the continuous time stationary measure. Thus, in general, arrivals of the $rM/G/1$ system do not see time averages. We derive formulas for the average queue length, probability of an empty system and average waiting time under the continuous time stationary measure. We provide examples showing the effect of changing the reshaping function on the average waiting time.
We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a First-Come-First-Serv
e manner. We introduce a two-component infinite-dimensional Markov process that serves as a diffusion model for this network, in the regime where the number of servers goes to infinity and the load on the network scales as $1 - beta N^{-1/2}+ o(N^{-1/2})$ for some $beta > 0$. Under suitable assumptions, we characterize this process as the unique solution to a pair of stochastic evolution equations comprised of a real-valued It^{o} equation and a stochastic partial differential equation on the positive half line, which are coupled together by a nonlinear boundary condition. We construct an asymptotic (equivalent) coupling to show that this Markov process has a unique invariant distribution. This invariant distribution is shown in a companion paper [1] to be the limit of the sequence of suitably scaled and centered stationary distributions of the GI/GI/N network, thus resolving (for a large class service distributions) an open problem raised by Halfin and Whitt in 1981. The methods introduced here are more generally applicable for the analysis of a broader class of networks.
This article presents a Hawkes process model with Markovian baseline intensities for high-frequency order book data modeling. We classify intraday order book trading events into a range of categories based on their order types and the price changes a
fter their arrivals. To capture the stimulating effects between multiple types of order book events, we use the multivariate Hawkes process to model the self- and mutually-exciting event arrivals. We also integrate a Markovian baseline intensity into the event arrival dynamic, by including the impacts of order book liquidity state and time factor to the baseline intensity. A regression-based non-parametric estimation procedure is adopted to estimate the model parameters in our Hawkes+Markovian model. To eliminate redundant model parameters, LASSO regularization is incorporated in the estimation procedure. Besides, model selection method based on Akaike Information Criteria is applied to evaluate the effect of each part of the proposed model. An implementation example based on real LOB data is provided. Through the example, we study the empirical shapes of Hawkes excitement functions, the effects of liquidity state as well as time factors, the LASSO variable selection, and the explanatory power of Hawkes and Markovian elements to the dynamics of the order book.
We consider a model describing the waiting time of a server alternating between two service points. This model is described by a Lindley-type equation. We are interested in the time-dependent behaviour of this system and derive explicit expressions f
or its time-dependent waiting-time distribution, the correlation between waiting times, and the distribution of the cycle length. Since our model is closely related to Lindleys recursion, we compare our results to those derived for Lindleys recursion.
The scope of this work is twofold: On the one hand, strongly motivated by emerging engineering issues in multiple access communication systems, we investigate the performance of a slotted-time relay-assisted cooperative random access wireless network
with collisions and with join the shortest queue relay-routing protocol. For this model, we investigate the stability condition, and apply different methods to derive the joint equilibrium distribution of the queue lengths. On the other hand, using the cooperative communication system as a vehicle for illustration, we investigate and compare three different approaches for this type of multi-dimensional stochastic processes, namely the compensation approach, the power series algorithm (PSA), and the probability generating function (PGF) approach. We present an extensive numerical comparison of the compensation approach and PSA, and discuss which method performs better in terms of accuracy and computation time. We also provide details on how to compute the PGF in terms of a solution of a Riemann-Hilbert boundary value problem.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
