Traffic Light Queues and the Poisson Clumping Heuristic

In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. We seek the distribution of maximum line length of idle cars, and justify conjectured probabilistic asymptotics for $2 \leq \ell \leq 3$.