Related papers: M|D|$\infty$ Queue Busy Period and Busy Cycle Dist…
In this work it is proposed a parameter, {\eta}, to characterize the MGinf Queue Busy Period distribution that is a modification of the peakedness proposed in Whitt (1984). As this distribution moments centered at the origin are given, in…
We study a time-changed variant of the Erlang queue by taking the first hitting time of a mixed stable subordinator as the time-changing component. We call it the mixed time-changed Erlang queue. We derive the system of fractional…
We consider the Erlang A model, or $M/M/m+M$ queue, with Poisson arrivals, exponential service times, and $m$ parallel servers, and the property that waiting customers abandon the queue after an exponential time. The queue length process is…
We study the $G/\mathit{GI}/\infty$ queue in heavy-traffic using tempered distribution-valued processes which track the age and residual service time of each customer in the system. In both cases, we use the continuous mapping theorem…
We propose a generalization of the classical M/M/1 queue process. The resulting model is derived by applying fractional derivative operators to a system of difference-differential equations. This generalization includes both non-Markovian…
In this paper we prove a new combinatorial formula for the modified Macdonald polynomials $\widetilde{H}_\lambda(X;q,t)$, motivated by connections to the theory of interacting particle systems from statistical mechanics. The formula…
We consider the $M/G/1$ queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, as well as the unconditional distribution, in various asymptotic limits.…
This paper proposes an analytical framework for modelling resource contention in multi-robot systems, where the travel times and task durations are uncertain. It uses several approximation methods to quickly and accurately calculate the…
We consider M systems (each an electron in a long square cylinder) uniformly arranged on a ring and with Coulomb interactions. Exact straightforward numerical time-dependent perturbation calculation of a single N-level ($\lesssim 7$)…
We briefly review the use of the order parameter probability distribution function as a useful tool to obtain the critical properties of statistical mechanical models using computer Monte Carlo simulations. Some simple discrete spin…
To study gap acceptance behaviour one needs the distribution (or probability density function) of gaps in the opposing stream. Further, in these times of widespread availability of large computing powers, traffic simulation has emerged as a…
We study three non-equivalent queueing models in continuous time that each generalise the classical M/M/1 queue in a different way. Inter-event times in all models are Mittag-Leffler distributed, which is a heavy tail distribution with no…
We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the…
We consider a broad class of queueing models with random state-dependent vacation periods, which arise in the analysis of queue-based back-off algorithms in wireless random-access networks. In contrast to conventional models, the vacation…
We study the probability distribution function of the long-time values of observables being time-evolved by Hamiltonians modeling clean and disordered one-dimensional chains of many spin-1/2 particles. In particular, we analyze the return…
IIn this paper, we consider an M^X/M/c queue with state-dependent control at idle time and catastrophes. Properties of the queues which terminate when the servers become idle are firstly studied. Recurrence, equilibrium distribution and…
A single queueing system with time-dependent exponentially distributed arrival processes and exponential machine processes (Kendall notation $M_t/M_t/1$) is analyzed. Modeling the time evolution for the discrete queue-length distribution by…
We study stochastic tree fluid networks driven by a multidimensional Levy process. We are interested in (the joint distribution of) the steady-state content in each of the buffers, the busy periods, and the idle periods. To investigate…
In many applications, significant correlations between arrivals of load-generating events make the numerical evaluation of the load of a system a challenging problem. Here, we construct very accurate approximations of the workload…
The Laplace transforms of the transition probability density and distribution functions for the Ornstein-Uhlenbeck process contain the product of two parabolic cylinder functions, namely D_{v}(x)D_{v}(y) and D_{v}(x)D_{v-1}(y),…