Braess's paradox in a queueing network with state-dependent routing
From MaRDI portal
Publication:4339255
DOI10.2307/3215182zbMath0872.90039OpenAlexW2014848131MaRDI QIDQ4339255
Ilze Ziedins, Bruce D. Calvert, Wiremu Solomon
Publication date: 9 June 1997
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3215182
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (16)
Probabilistic selfish routing in parallel batch and single-server queues ⋮ User equilibria for a parallel queueing system with state dependent routing ⋮ Optimal Routing in Closed Queueing Networks with State Dependent Queues ⋮ Monotonicity properties of user equilibrium policies for parallel batch systems ⋮ Comparison theorems for stochastic chemical reaction networks ⋮ A paradox in a queueing network with state-dependent routing and loss ⋮ Inefficiency in stochastic queueing systems with strategic customers ⋮ Geodesics and flows in a Poissonian city ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Locating inefficient links in a large-scale transportation network ⋮ Deterministic state-based information disclosure policies and social welfare maximization in strategic queueing systems ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ A survey on networking games in telecommunications ⋮ Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems ⋮ A paradox in optimal flow control of \(M/M/n\) queues ⋮ The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
This page was built for publication: Braess's paradox in a queueing network with state-dependent routing
