Related papers: Induced idleness leads to deterministic heavy traf…
We consider a broad class of queueing models with random state-dependent vacation periods, which arise in the analysis of queue-based back-off algorithms in wireless random-access networks. In contrast to conventional models, the vacation…
We present a microscopic driving algorithm that prescribes the acceleration using three parameters: the distance to the leading vehicle, to the next traffic light and to the nearest stopping point when the next traffic light is in the red…
This paper uses supervised learning, random search and deep reinforcement learning (DRL) methods to control large signalized intersection networks. The traffic model is Cellular Automaton rule 184, which has been shown to be a…
We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at the nodes over time and form queues. The nodes can be either…
We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding…
A variety of problems in distributed control involve a networked system of autonomous agents cooperating to carry out some complex task in a decentralized fashion, e.g., orienting a flock of drones, or aggregating data from a network of…
Optimal traffic-light settings are generally hard to obtain, certainly for actuated access control of an intersection. Typically, computationally expensive (microscopic) simulations or complicated optimization schemes are required to find…
We study randomized experiments in a service system when stochastic congestion can arise from temporarily limited supply or excess demand. Such congestion gives rise to cross-unit interference between the waiting customers, and analytic…
A simple algorithm for constructing an effective traffic model is presented. The algorithm uses statistically well-defined quantities extracted from the flow-density plot, and the resulting effective model naturally captures and predicts…
We study in this paper a variation of the acclaimed CSMA random access protocol. We will focus on the case where back-off rates at each node is polynomial in the size of the queue. Under a condition relating the exponent in the polynomial…
In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…
The emergence of congestion is a critical phenomenon in transport systems. Transport is organized along pathways abstracted by links, which connect different nodes as regions to form the network. The modeling of traffic has so far mainly…
We present an algorithm to identify days that exhibit the seemingly paradoxical behaviour of high traffic flow and, simultaneously, a striking absence of traffic jams. We introduce the notion of high-performance days to refer to these days.…
Traffic congestion continues to escalate with urbanization and socioeconomic development, necessitating advanced modeling to understand and mitigate its impacts. In large-scale networks, traffic congestion can be studied using cascade…
The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…
Given a random variable $N$ with values in ${\mathbb{N}}$, and $N$ i.i.d. positive random variables $\{\mu_k\}$, we consider a queue with renewal arrivals and $N$ exponential servers, where server $k$ serves at rate $\mu_k$, under two work…
We present a simple yet effective routing strategy inspired by coverage control, which delays the onset of congestion on traffic networks, by introducing a control parameter. The routing algorithm allows a trade-off between the congestion…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
Random access schemes in modern wireless communications are generally based on the framed-ALOHA (f-ALOHA), which can be optimized by flexibly organizing devices' transmission and re-transmission. However, this optimization is generally…
Over the past decade, GPS enabled traffic applications, such as Google Maps and Waze, have become ubiquitous and have had a significant influence on billions of daily commuters' travel patterns. A consequence of the online route suggestions…