Related papers: Poly-Exp Bounds in Tandem Queues
We study a multispecies $t$-PushTASEP system on a finite ring of $n$ sites with site-dependent rates $x_1,\dots,x_n$. Let $\lambda=(\lambda_1,\dots,\lambda_n)$ be a partition whose parts represent the species of the $n$ particles on the…
Performance analysis of queueing networks is one of the most challenging areas of queueing theory. Barring very specialized models such as product-form type queueing networks, there exist very few results which provide provable…
The infinite servers queue with Poisson arrivals state transient probabilities, considering the time origin at the beginning of a busy period, mean and variance monotony as time functions is studied. These studies, for which results it is…
We consider in this paper a non work-conserving Generalized Processor Sharing (GPS) system composed of two queues with Poisson arrivals and exponential service times. Using general results due to Fayolle \emph{et al}, we first establish the…
We investigate the asymptotic behavior of the steady-state queue length distribution under generalized max-weight scheduling in the presence of heavy-tailed traffic. We consider a system consisting of two parallel queues, served by a single…
We consider a horizontal traffic queue (HTQ) on a periodic road segment, where vehicles arrive according to a spatio-temporal Poisson process, and depart after traveling a distance that is sampled independently and identically from a…
This paper considers the tail asymptotics for a cumulative process $\{B(t); t \ge 0\}$ sampled at a heavy-tailed random time $T$. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality…
In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system consisting of three M/M/1 queues with threshold policy. It turns out that the scaled queue-length of the…
The performance analysis of peer-to-peer (P2P) networks calls for a new kind of queueing model, in which jobs and service stations arrive randomly. Except in some simple special cases, in general, the queueing model with varying service…
A compound Poisson process whose randomized time is an independent Poisson process is called compound Poisson process with Poisson subordinator. We provide its probability distribution, which is expressed in terms of the Bell polynomials,…
We show how the theory of the critical behaviour of $d$-dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes. This in particular encompasses the case of a single polymer chain…
The main target of this paper is to present the Markov chain C that, not giving explicitly the queue lengths stationary probabilities, has the necessary information to its determination for open networks of queues with several classes of…
In this paper, we study the polyhedral structure of an integrated minimum-up/-down time and ramping polytope, which has broad applications in variant industries. The polytope we studied includes minimum-up/-down time, generation…
In this paper, we study the maximum waiting time $\max_{i\leq N}W_i(\cdot)$ in an $N$-server fork-join queue with heavy-tailed services as $N\to\infty$. The service times are the product of two random variables. One random variable has a…
We extend a result of Goldreich and Ron about estimating the collision probability of a hash function. Their estimate has a polynomial tail. We prove that when the load factor is greater than a certain constant, the estimator has a gaussian…
Temporal sequences of discrete events that describe natural and social processes are often driven by non-Poisson dynamics. In addition to a heavy-tailed interevent time distribution, which primarily captures the deviation from a Poisson…
We consider a status update system consisting of one source, one server, and one sink. The source generates packets according to a Poisson process and the packets are served according to a generally distributed service time. We consider a…
Extreme events and the heavy tail distributions driven by them are ubiquitous in various scientific, engineering and financial research. They are typically associated with stochastic instability caused by hidden unresolved processes.…
We study the stationary sojourn time distribution in an M/G/1 queue operating under heavy traffic. It is known that the sojourn time converges to an exponential distribution in the limit. Our focus is on obtaining pre-asymptotic,…
This paper proposes a stochastic framework to evaluate the performance of public transit systems under short random service suspensions. We aim to derive closed-form formulations of the mean and variance of the queue length and waiting…