Related papers: Fluid limits for Queue-based CSMA with polynomial …
We consider a queueing network in which there are constraints on which queues may be served simultaneously; such networks may be used to model input-queued switches and wireless networks. The scheduling policy for such a network specifies…
We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the servers on the flow's path are empty and decreases the injection…
Recent efforts have extended the flow-matching framework to discrete generative modeling. One strand of models directly works with the continuous probabilities instead of discrete tokens, which we colloquially refer to as Continuous-State…
To perform a queuing analysis or design in a communications context, we need to estimate the values of the input parameters, specifically the mean of the arrival rate and service time. In this paper, we propose an approach for estimating…
A new class of models, generalizing Asymmetric Exclusion Process for many parallel interacting channels, is proposed. We couple the models with boundary reservoirs, study boundary-driven phase transitions and show that usually taken…
Fluid approximation is a widely used approach for solving two-stage stochastic optimization problems, with broad applications in service system design such as call centers and healthcare operations. However, replacing the underlying random…
The majority of available numerical algorithms for interfacial two-phase flows either treat both fluid phases as incompressible (constant density) or treat both phases as compressible (variable density). This presents a limitation for the…
Unsplittable flow problems cover a wide range of telecommunication and transportation problems and their efficient resolution is key to a number of applications. In this work, we study algorithms that can scale up to large graphs and…
It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important, but idealized…
We provide an algorithm which, with high probability, maintains a $(1-\epsilon)$-approximate maximum flow on an undirected graph undergoing $m$-edge additions in amortized $m^{o(1)} \epsilon^{-3}$ time per update. To obtain this result, we…
We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…
We study the space complexity of estimating the diameter of a subset of points in an arbitrary metric space in the dynamic (turnstile) streaming model. The input is given as a stream of updates to a frequency vector $x \in \mathbb{Z}_{\geq…
We establish central limit theorems for the Sample Average Approximation (SAA) method in discrete-time, finite-horizon stochastic optimal control. Our analysis is based on an abstract limit theorem for stochastic backward recursions, which…
Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
We present a flow-control technique in traffic-light intersections, aiming at regulating queue lengths to given reference setpoints. The technique is based on multivariable integrators with adaptive gains, computed at each control cycle by…
In this paper we study the stationary workload distribution of a fluid tandem queue in heavy traffic. We consider different types of L\'evy input, covering compound Poisson, $\alpha$-stable L\'evy motion (with $1<\alpha<2$), and Brownian…
We study the workload processes of two restricted M/G/1 queueing systems: in Model 1 any service requirement that would exceed a certain capacity threshold is truncated; in Model 2 new arrivals do not enter the system if they have to wait…
We study growing open Jackson networks where each station is a single-server queue that follows the first-come first-served discipline with Poisson arrivals and exponentially distributed service times, characterized by node-specific rates.…
We establish the mean-field convergence for systems of points evolving along the gradient flow of their interaction energy when the interaction is the Coulomb potential or a super-coulombic Riesz potential, for the first time in arbitrary…