Related papers: Heavy Traffic Scaling Limits for Shortest Remainin…
The scaling properties of the roughness of surfaces grown by two different processes randomly alternating in time, are addressed. The duration of each application of the two primary processes is assumed to be independently drawn from given…
Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete stochastic…
We consider the problem of packet scheduling in single-hop queueing networks, and analyze the impact of heavy-tailed traffic on the performance of Max-Weight scheduling. As a performance metric we use the delay stability of traffic flows: a…
We consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet routers and data center networks. Recently, it was shown that the MaxWeight…
We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…
Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch. While throughput maximizing algorithms in a switch are well-understood, delay analysis was developed only…
In this work, we investigate the large-scale transport properties of a passive scalar advected by a turbulent fluid, modelled as a superposition of divergence-free vector fields, each weighted by an independent symmetric…
We investigate the asymptotic behavior as time goes to infinity of Hawkes processes whose regression kernel has $L^1$ norm close to one and power law tail of the form $x^{-(1+\alpha)}$, with $\alpha\in(0,1)$. We in particular prove that…
Consider a system of $N$ parallel single-server queues with unit-exponential service time distribution and a single dispatcher where tasks arrive as a Poisson process of rate $\lambda(N)$. When a task arrives, the dispatcher assigns it to…
We study the first-passage time (FPT) problem for widespread recurrent processes in confined though large systems and present a comprehensive framework for characterizing the FPT distribution over many time scales. We find that the FPT…
Superslow diffusion, i.e., the long-time diffusion of particles whose mean-square displacement (variance) grows slower than any power of time, is studied in the framework of the decoupled continuous-time random walk model. We show that this…
This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…
We consider the $\Delta_{(i)}/G/1$ queue, in which a a total of $n$ customers independently demand service after an exponential time. We focus on the case of heavy-tailed service times, and assume that the tail of the service time…
Various empirical and theoretical studies indicate that cumulative network traffic is a Gaussian process. However, depending on whether the intensity at which sessions are initiated is large or small relative to the session duration tail,…
This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves…
We present a theoretical argument to derive a scaling law between the mean translocation time $\tau$ and the chain length $N$ for driven polymer translocation. This scaling law explicitly takes into account the pore-polymer interactions,…
We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…
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…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
We investigate the diffusion limited aggregation of particles executing persistent random walks. The scaling properties of both random walks and large aggregates are presented. The aggregates exhibit a crossover between ballistic and…