Related papers: Diffusion approximation of the stationary distribu…
We study a random process with reinforcement, which evolves following the dynamics of a given diffusion process in a bounded domain and is resampled according to its occupation measure when it reaches the boundary. We show that its…
Bike sharing systems have rapidly developed around the world, and they are served as a promising strategy to improve urban traffic congestion and to decrease polluting gas emissions. So far performance analysis of bike sharing systems…
A heterogeneous closed network with one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters whose queues have the…
One-dimensional non-equilibrium models of particles subjected to a coagulation-diffusion process are important in understanding non-equilibrium dynamics, and fluctuation-dissipation relation. We consider in this paper transport properties…
A "scheduled" arrival process is one in which the n th arrival is scheduled for time n, but instead occurs at a different time. The difference between the scheduled time and the arrival time is called the perturbation. The sequence of…
In this paper, we introduce a model of dynamical queue, in which the service time depends on the server utilization history. The proposed queueing model is motivated by widely accepted empirical laws describing human performance as a…
In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed…
We consider a large-scale flexible service system with two large server pools and two types of customers. Servers in pool 1 can only serve type 1 customers, while server in pool 2 are flexible -- they can serve both types 1 and 2. (This is…
The long time behavior of an absorbed Markov process is well described by the limiting distribution of the process conditioned to not be killed when it is observed. Our aim is to give an approximation's method of this limit, when the…
Low-latency communication has recently attracted considerable attention owing to its potential of enabling delay-sensitive services in next-generation industrial cyber-physical systems. To achieve target average or maximum delay given…
The Join-the-Shortest-Queue (JSQ) policy is among the most widely used load balancing algorithms and has been extensively studied. However, an exact characterization of the system behavior remains challenging. Most prior research has…
We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at low or high rate, which can be adapted at exponential inspection times. When…
A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…
This paper investigates the problem of distributed stochastic approximation in multi-agent systems. The algorithm under study consists of two steps: a local stochastic approximation step and a diffusion step which drives the network to a…
The upper bound for the convergence rate of the distribution of the state of a queuing system with infinitely many servers is obtained, in the case when the intensity of the incoming flow and the intensity of the service depend on the state…
Of stochastic differential equations, diffusion processes have been adopted in numerous applications, as more relevant and flexible models. This paper studies diffusion processes in a different setting, where for a given stationary…
The scaling invariance for chaotic orbits near a transition from unlimited to limited diffusion in a dissipative standard mapping is explained via the analytical solution of the diffusion equation. It gives the probability of observing a…
We formulate a scaling theory for the long-time diffusive motion in a space occluded by a high density of moving obstacles in dimensions 1, 2 and 3. Our tracers diffuse anomalously over many decades in time, before reaching a diffusive…
Queueing systems with batch Markovian arrival process (BMAP) have paramount applications in the domain of wireless communication. The BMAP has been used to model the superposition of video sources and to approximate the super-position of…
A notorious problem in queueing theory is to compute the worst possible performance of the GI/G/1 queue under mean-dispersion constraints for the interarrival and service time distributions. We address this extremal queue problem by…