Related papers: Maximum Queue Length for Traffic Light with Bernou…
Traffic signal control is safety-critical for our daily life. Roughly one-quarter of road accidents in the U.S. happen at intersections due to problematic signal timing, urging the development of safety-oriented intersection control.…
In this paper we study the maximum queue length $M$ (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions…
Purpose of this study is evaluation of the relationship between different arrival types and degree of saturation (X) with overestimations of HCM 2010 procedure for estimating the back of queue within a study area. Further analysis is…
This paper studies the input queued switch operating under the MaxWeight algorithm when the arrivals are according to a Markovian process. We exactly characterize the heavy-traffic scaled mean sum queue length in the heavy-traffic limit,…
Light stops are a hallmark of the most natural realizations of weak-scale supersymmetry. While stops have been extensively searched for, there remain open gaps around and below the top mass, due to similarities of stop and top signals with…
Based on fluid-dynamic and many-particle (car-following) simulations of traffic flows in (urban) networks, we study the problem of coordinating incompatible traffic flows at intersections. Inspired by the observation of self-organized…
Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot…
A widely used approach to solve the synchronization of traffic lights on transport networks is the maximization of the time during which cars start at one end of a street and can go to the other without stopping for a red light (bandwidth…
We investigate parking in a one-dimensional lot, where cars enter at a rate $\lambda$ and each attempts to park close to a target at the origin. Parked cars also depart at rate 1. An entering driver cannot see beyond the parked cars for…
We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network…
We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen…
This note considers a variation of the full-information secretary problem where the random variables to be observed are independent and identically distributed. Consider $X_1,\dots,X_n$ to be an independent sequence of random variables, let…
Starting from the instability diagram of a traffic flow model, we derive conditions for the occurrence of congested traffic states, their appearance, their spreading in space and time, and the related increase in travel times. We discuss…
We present novel online mechanisms for traffic intersection auctions in which users bid for priority service. We assume that users at the front of their lane are requested to declare their delay cost, i.e. value of time, and that users are…
Suppose $N$ independent Bernoulli trials are observed sequentially at random times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. We focus…
We study the duration of "high-flow states" in freeway traffic, defined as the time periods for which traffic flows exceed a given flow threshold. Our empirical data are surprisingly well represented by a power law. Moreover, the power law…
This work studies queues in a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide…
The equation of motion of a general class of macroscopic traffic flow models is linearized around a steady uniform flow. A closed-form solution of a boundary-initial value problem is obtained, and it is used to describe several phenomena.…
RED (Random Early Detection) has been suggested when multiple TCP sessions are multiplexed through a bottleneck buffer. The idea is to detect congestion before the buffer overflows by dropping or marking packets with a probability that…
We construct a stochastic cellular automata model for the description of vehicular traffic at a roundabout designed at the intersection of two perpendicular streets. The vehicular traffic is controlled by a self-organized scheme in which…