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

DOI10.1007/S11134-018-9595-9MaRDI QIDQ2326231zbMATH OpenOpenAlexWikidataFDO

Authors Marko A. A. Boon, R. W. Timmerman, A. J. E. M. Janssen, Johan S. H. van Leeuwaarden

Publication date 7 October 2019

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1701.02872

zbMATH Keywords

complex analysistransform methodsfixed-cycle traffic-light queue

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Traffic problems in operations research (90B20)

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 to compute the queue-length distribution and all its moments using algorithms that rely on contour integrals and avoid root-finding procedures.

Recommendations

• On the Traffic-light Queue
• An exact root-free method for the expected queue length for a class of discrete-time queueing systems
• Roots, symmetry, and contour integrals in queuing-type systems
• scientific article; zbMATH DE number 939796
• Open Queueing Systems in Light Traffic

Cites work

• scientific article; zbMATH DE number 3755546 (Why is no real title available?)
• scientific article; zbMATH DE number 3206641 (Why is no real title available?)
• 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
• Back to the roots of the M/D/s queue and the works of Erlang, Crommelin and Pollaczek
• Novel heavy-traffic regimes for large-scale service systems
• Numerical inversion of probability generating functions
• On the Traffic-light Queue
• Spitzer's identity for discrete random walks
• The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure

Cited in

(4)

• Heavy-traffic single-server queues and the transform method
• Robust heavy-traffic approximations for service systems facing overdispersed demand
• An exact root-free method for the expected queue length for a class of discrete-time queueing systems
• Roots, symmetry, and contour integrals in queuing-type systems

This page was built for publication: Pollaczek contour integrals for the fixed-cycle traffic-light queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326231)