Corpus ID: 119722981

Maximum Queue Length for Traffic Light with Bernoulli Arrivals

  title={Maximum Queue Length for Traffic Light with Bernoulli Arrivals},
  author={S. Finch},
  journal={arXiv: History and Overview},
  • S. Finch
  • Published 2018
  • Mathematics
  • arXiv: History and Overview
Cars arrive at an intersection with a stoplight, which is either red or green. The cars all travel in the same direction, that is, we ignore cross-traffic & oncoming traffic. Assume that the intersection is initially empty. Assume that, at every second, there is a probability p that one new car will arrive at the light, and the outcome is independent of past & future. Let L>=1 be an integer. A red light lasts L seconds; likewise for green. If the light is red, no cars can leave the intersection… Expand
2 Citations


Delay Analysis for the Fixed-Cycle Traffic-Light Queue
A solution to the fixed-cycle traffic light problem for compound Poisson arrivals
Approximation Methods for Queues with Application to the Fixed-Cycle Traffic Light
Pollaczek contour integrals for the fixed-cycle traffic-light queue
The Maximum of a Symmetric Next Neighbor Walk on the Nonnegative Integers
Settings for Fixed-Cycle Traffic Signals
How Far Might We Walk at Random
Summability Theory And Its Applications
On Catalan’S constant
Catalan's constant, Mathematical Constants
  • 2003