A polling model is a system of multiple queues accessed by a single server in cyclic order. Polling models provide performance evaluation criteria for a variety of demand-based, multiple-access schemes in computer and communication systems. This paper presents an overview of the state of the art of polling model analysis, as well as an extensive list of references. In particular, single-buffer systems and infinite-buffer systems with exhaustive, gated, and limited service disciplines are treated. There is also some discussion of systems with a noncyclic order of service and systems with priority. Applications to computer networks are illustrated, and future research topics are suggested.

Queuing analysis of polling models

Traffic flow theory : a monograph

Queues at signalized intersections are the main cause of traffic delays and travel time variability in urban networks. In this article, we propose a method to estimate queue profiles that are traffic shockwave polygons in the time-space plane describing the spatiotemporal formation and dissipation of queues. The method integrates the collective effect of dispersed probe vehicle data with traffic flow shockwave analysis and data mining techniques. The proposed queue profile estimation method requires position and velocity data of probe vehicles; however, any explicit information of signal settings and arrival distribution is indispensable. Moreover, the method captures interdependencies in queue evolutions of successive intersections. The significance of the proposed method is that it is applicable in oversaturated conditions and includes queue spillover identification. Numerical results of simulation experiments and tests on NGSIM field data, with various penetration rates and sampling intervals, reveal the promising and robust performance of the proposed method compared with a uniform arrival queue estimation procedure. The method provides a thorough understanding of urban traffic flow dynamics and has direct applications for delay analysis, queue length estimation, signal settings estimation, and vehicle trajectory reconstruction.

/pdf/queue-profile-estimation-in-congested-urban-networks-with-wkojw7odgh.pdf

Queue Profile Estimation in Congested Urban Networks with Probe Data

https://pure.tue.nl/ws/files/2879536/685931.pdf

Applications of polling systems

http://gursoy.rutgers.edu/papers/Modeling%20traffic%20flow-ejor-Melike.pdf

Modeling traffic flow interrupted by incidents

A vehicle-actuated traffic light controls two intersecting traffic streams keeping the light green for lane i, i = 1 or 2 until any existing queue has been discharged and a headway of duration at least βi, is detected in the subsequent arrivals. The object of this paper is to investigate how one should choose the βi so as to minimize the average delay per vehicle at the intersection. A model is considered in which the arrival headways are exponentially distributed random variables, departure headways have any specified distribution, and there is a random lost time for each switch of the traffic light. Formulas are derived for the moments of the cycle times, the average wait per vehicle, and the optimal βi.

R. W. J. Morris

Papers

Queues for a Vehicle-Actuated Traffic Light