Related papers: Fluid limits for Queue-based CSMA with polynomial …
In an earlier paper, a randomized load balancing model was studied in a heavy traffic asymptotic regime where the load balancing stream is thin compared to the total arrival stream. It was shown that the limit is given by a system of…
A confined colloidal glass, under the imposition of a uniform shear stress, is investigated using numerical simulations. Both at macro- and microscales, the consequent dynamics during the onset of flow is studied. When the imposed stress is…
We consider the load balancing system under Poisson arrivals, exponential services, and homogeneous servers. Upon arrival, a job is to be routed to one of the servers, where it is queued until service. We consider the Power-of-$d$ choices…
We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…
A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \emph{coflow-level…
The dynamic behavior of the slip length in a fluid flow confined between atomically smooth surfaces is investigated using molecular dynamics simulations. At weak wall-fluid interactions, the slip length increases nonlinearly with the shear…
Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called "mean field limit", or "hydrodynamic limit"). A common practice, often called the "fixed point approximation"…
The slow-to-start mechanism is known to play an important role in the particular shape of the Fundamental diagram of traffic and to be associated to hysteresis effects of traffic flow.We study this question in the context of exclusion and…
We present a unified framework, with quantitative estimates, for deterministic interacting particle systems whose pairwise interactions may depend on heterogeneous labels. Heterogeneity is kept at every level by adding a frozen label…
Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…
We study the jamming transition of two-dimensional point-to-point traffic through cooperative mechanisms using computer simulation. We propose two decentralized cooperative mechanisms which are incorporated into the point-to-point traffic…
In this study, we consider multi-class multi-server asymmetric queueing systems consisting of $N$ queues on one side and $K$ servers on the other side, where jobs randomly arrive in queues at each time. The service rate of each job-server…
We consider the security-by-design of a signal-free intersection for connected and autonomous vehicles in the face of strategic jamming attacks. We use a fluid model to characterize macroscopic traffic flow through the intersection, where…
This paper is devoted to an interacting particle system that provides probabilistic interpretation of the wave equation on graphs. A Feynman-Kac-type formula is established, connecting the expectation of the process with the wave equation…
This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. Describing a consensus protocol as a graph spectrum filter, we present an effective new approach to the analysis and design of consensus…
We consider the zero-range process with arbitrary bounded monotone rates on the complete graph, in the regime where the number of sites diverges while the density of particles per site converges. We determine the asymptotics of the mixing…
We study which property testing and sublinear time algorithms can be transformed into graph streaming algorithms for random order streams. Our main result is that for bounded degree graphs, any property that is constant-query testable in…
In the context of load balancing, Lu et al. introduced the distributed Join-Idle-Queue algorithm, where a group of dispatchers distribute jobs to a cluster of parallel servers. Each dispatcher maintains a queue of idle servers; when a job…
We consider a two-node tandem queueing network in which the upstream queue is GI/GI/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. To…
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.…