Calculation of traffic flow breakdown probability to optimize link throughput

DOI10.1016/J.APM.2010.02.027MaRDI QIDQ611587zbMATH OpenOpenAlexFDO

Authors Kimberly Rudy, J. Li, Daiheng Ni, Huaizhong Wang

Publication date 14 December 2010

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2010.02.027

zbMATH Keywords

breakdown probabilitydiscrete time Markov chainthroughput optimization

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Recommendations

• Efficient blocking probability computation of complex traffic flows for network dimensioning
• Probabilistic Analysis of Network Flow Algorithms
• Throughput calculation for basic stochastic rendezvous networks
• scientific article; zbMATH DE number 1955772
• Traffic-flow analysis for fast performance estimation of communication systems
• Computing the throughput of dynamic networks
• scientific article; zbMATH DE number 3904300

Cites work

• Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models

Cited in

(5)

• Breakdown minimization principle versus Wardrop's equilibria for dynamic traffic assignment and control in traffic and transportation networks: a critical mini-review
• A traffic breakdown model based on queueing theory
• M/G/c/c state dependent queuing model for a road traffic system of two sections in tandem
• Modeling the asymmetry in traffic flow. I: Microscopic approach
• Dynamic First-Order Modeling of Phase-Transition Probabilities

This page was built for publication: Calculation of traffic flow breakdown probability to optimize link throughput

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