Related papers: A Tandem Fluid Network with L\'evy Input in Heavy …
The present paper is concerned with the stationary workload of queues with heavy-tailed (regularly varying) characteristics. We adopt a transform perspective to illuminate a close connection between the tail asymptotics and heavy-traffic…
Theoretical advances in the study of non-equilibrium phenomena are briefly reviewed with emphasis on steady state properties of one-dimensional driven lattice gases. The presentation is focused on the totally asymmetric simple-exclusion…
We present methodology for estimating the stochastic intensity of a doubly stochastic Poisson process. Statistical and theoretical analyses of traffic traces show that these processes are appropriate models of high intensity traffic…
We analyze a specific class of random systems that are driven by a symmetric L\'{e}vy stable noise, where Langevin representation is absent. In view of the L\'{e}vy noise sensitivity to environmental inhomogeneities, the pertinent random…
As a Bayesian approach to fitting motorway traffic flow models remains rare in the literature, we explore empirically the sampling challenges this approach offers which have to do with the strong correlations and multi-modality of the…
We consider a two-node fluid network with batch arrivals of random size having a heavy-tailed distribution. We are interested in the tail asymptotics for the stationary distribution of a two-dimensional queue-length process. The tail…
Properties of systems driven by white non-Gaussian noises can be very different from these systems driven by the white Gaussian noise. We investigate stationary probability densities for systems driven by $\alpha$-stable L\'evy type noises,…
In this paper we derive a technique of obtaining limit theorems for suprema of L\'evy processes from their random walk counterparts. For each $a>0$, let $\{Y^{(a)}_n:n\ge 1\}$ be a sequence of independent and identically distributed random…
The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…
We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…
We study a sequence of single server queues with customer abandonment (GI/GI/1+GI) under heavy traffic. The patience time distributions vary with the sequence, which allows for a wider scope of applications. It is known ([20, 18]) that the…
We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to…
Following recent developments in the application of Stein's method in queueing theory, this paper is intended to be a short treatment showing how Stein's method can be developed and applied to the single server queue in heavy traffic. Here…
We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate lambda at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of…
The increasing global spread of electric vehicles (EVs) has introduced significant interdependence between transportation and power networks. Most of the previous studies on coupled networks focus on the formation of equilibrium states…
We investigate both experimentally and theoretically the traffic of particles flowing in microfluidic obstacle networks. We show that the traffic dynamics is a non-linear process: the particle current does not scale with the particle…
We study the steady-state delay performance of load balancing in large-scale systems with heterogeneous servers in the heavy-traffic regimes. The system consists of $N$ servers, each with a local buffer of size $b-1$, serving jobs in the…
It is known that in a stationary Brownian queue with both arrival and service processes equal in law to Brownian motion, the departure process is a Brownian motion, that is, Burke's theorem in this context. In this short note we prove…
Motivated by a capacity allocation problem within a finite planning period, we conduct a transient analysis of a single-server queue with L\'evy input. From a cost minimization perspective, we investigate the error induced by using…
In the seminal paper of Gamarnik and Zeevi (2006), the authors justify the steady-state diffusion approximation of a generalized Jackson network (GJN) in heavy traffic. Their approach involves the so-called limit interchange argument, which…