Traffic lights, clumping and QBDs

Abstract

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 algebraically for $2\le \ell \le 3$ and numerically for $\ell \ge 4$.