Conjectures about Traffic Light Queues

Abstract

In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. The maximum line length of idle cars is fully understood for $\ell =1$, but only partially for $2\le \ell \le 3$.

9 pages; 5 figures

References in corpus (3)

• The Maximum of an Asymmetric Simple Random Walk with Reflection
• Traffic Light Queues and the Poisson Clumping Heuristic
• How Far Might We Walk at Random?

Cited by in corpus (3)

• Traffic Light Queues and the Poisson Clumping Heuristic
• Geo/Geo/2 Queues and the Poisson Clumping Heuristic
• How Long Might We Wait at Random?