The autostrada queueing problem

DOI10.2307/3213648zbMath0543.60090OpenAlexW4233239359MaRDI QIDQ3332048

Brian Conolly

Publication date: 1984

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213648

zbMATH Keywords

numerical examplestraffic intensitiesautostrada queueing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (17)

On a numerical method for calculating state probabilities for queueing systems with more than one waiting line ⋮ Bad luck when joining the shortest queue ⋮ Analysis of the asymmetric shortest queue problem ⋮ A level-crossing approach to the solution of the shortest-queue problem ⋮ Stationary analysis of the shortest queue problem ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ Duality properties of a one-dimensional random walk and a new computational algorithm ⋮ Optimality of routing and servicing in dependent parallel processing systems ⋮ Web server load balancing: a queueing analysis ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ Analysis of two queues in parallel with jockeying and restricted capacities ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Transient analysis of two queues in parallel with jockeying ⋮ Algorithms of distributed task allocation for cooperative agents ⋮ On the Shortest Queue Policy for the Tandem Parallel Queue ⋮ A numerically stable algorithm for two server queue models ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system

This page was built for publication: The autostrada queueing problem