### Abstract

The fixed-cycle traffic-light (FCTL) queue is the standard model for intersections with static signaling, where vehicles arrive, form a queue and depart during cycles controlled by a traffic light. Classical analysis of the FCTL queue based on transform methods requires a computationally challenging step of finding the complex-valued roots of some characteristic equation. Building on the recent work of Oblakova et al. (Exact expected delay and distribution for the fixed-cycle traffic-light model and similar systems in explicit form, 2016), we obtain a contour-integral expression, reminiscent of Pollaczek integrals for bulk-service queues, for the probability generating function of the steady-state FCTL queue. We also show that similar contour integrals arise for generalizations of the FCTL queue introduced in Oblakova et al. (2016) that relax some of the classical assumptions. Our results allow us to compute the queue-length distribution and all its moments using algorithms that rely on contour integrals and avoid root-finding procedures.

Original language | English |
---|---|

Pages (from-to) | 89-111 |

Number of pages | 23 |

Journal | Queueing Systems |

Volume | 91 |

Issue number | 1-2 |

DOIs | |

Publication status | Published - 1 Feb 2019 |

### Fingerprint

### Keywords

- Complex analysis
- Fixed-cycle traffic-light queue
- Transform methods

### Cite this

}

**Pollaczek contour integrals for the fixed-cycle traffic-light queue.** / Boon, Marko (Corresponding author); Janssen, A.J.E.M.; Leeuwaarden, Johan S.H. van; Timmerman, Rik W.

Research output: Contribution to journal › Article › Academic › peer-review

TY - JOUR

T1 - Pollaczek contour integrals for the fixed-cycle traffic-light queue

AU - Boon, Marko

AU - Janssen, A.J.E.M.

AU - Leeuwaarden, Johan S.H. van

AU - Timmerman, Rik W.

PY - 2019/2/1

Y1 - 2019/2/1

N2 - The fixed-cycle traffic-light (FCTL) queue is the standard model for intersections with static signaling, where vehicles arrive, form a queue and depart during cycles controlled by a traffic light. Classical analysis of the FCTL queue based on transform methods requires a computationally challenging step of finding the complex-valued roots of some characteristic equation. Building on the recent work of Oblakova et al. (Exact expected delay and distribution for the fixed-cycle traffic-light model and similar systems in explicit form, 2016), we obtain a contour-integral expression, reminiscent of Pollaczek integrals for bulk-service queues, for the probability generating function of the steady-state FCTL queue. We also show that similar contour integrals arise for generalizations of the FCTL queue introduced in Oblakova et al. (2016) that relax some of the classical assumptions. Our results allow us to compute the queue-length distribution and all its moments using algorithms that rely on contour integrals and avoid root-finding procedures.

AB - The fixed-cycle traffic-light (FCTL) queue is the standard model for intersections with static signaling, where vehicles arrive, form a queue and depart during cycles controlled by a traffic light. Classical analysis of the FCTL queue based on transform methods requires a computationally challenging step of finding the complex-valued roots of some characteristic equation. Building on the recent work of Oblakova et al. (Exact expected delay and distribution for the fixed-cycle traffic-light model and similar systems in explicit form, 2016), we obtain a contour-integral expression, reminiscent of Pollaczek integrals for bulk-service queues, for the probability generating function of the steady-state FCTL queue. We also show that similar contour integrals arise for generalizations of the FCTL queue introduced in Oblakova et al. (2016) that relax some of the classical assumptions. Our results allow us to compute the queue-length distribution and all its moments using algorithms that rely on contour integrals and avoid root-finding procedures.

KW - math.PR

KW - Complex analysis

KW - Fixed-cycle traffic-light queue

KW - Transform methods

UR - http://www.scopus.com/inward/record.url?scp=85058404921&partnerID=8YFLogxK

U2 - 10.1007/s11134-018-9595-9

DO - 10.1007/s11134-018-9595-9

M3 - Article

VL - 91

SP - 89

EP - 111

JO - Queueing Systems: Theory and Applications

JF - Queueing Systems: Theory and Applications

SN - 0257-0130

IS - 1-2

ER -