Braess's paradox in a queueing network with state-dependent routing

DOI10.2307/3215182MaRDI QIDQ4339255zbMATH OpenOpenAlexFDO

Authors Bruce D. Calvert, Wiremu Solomon, Ilze Ziedins

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

zbMATH Keywords

Braess's paradoxWheatstone bridgequeues in tandemtwo parallel routes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic network models in operations research (90B15)

Recommendations

• A paradox of congestion in a queuing network
• Multiclass Queueing Networks with State-Dependent Routing
• Optimal Routing in Closed Queueing Networks with State Dependent Queues
• Queueing networks with dynamic routing and dynamic stochastic bypass of nodes
• The model of queueing network with parallel routes
• Dobrushin's approach to queueing network theory

Cited in

(21)

• A survey on networking games in telecommunications
• The Downs-Thomson Effect in a Markov Process
• Performance paradox of dynamic matching models under greedy policies
• Optimal Routing in Closed Queueing Networks with State Dependent Queues
• Monotonicity properties of user equilibrium policies for parallel batch systems
• Deterministic state-based information disclosure policies and social welfare maximization in strategic queueing systems
• Inefficiency in stochastic queueing systems with strategic customers
• A paradox of congestion in a queuing network
• Probabilistic selfish routing in parallel batch and single-server queues
• 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
• Braess paradox and properties of Wardrop equilibrium in some multiservice networks
• Geodesics and flows in a Poissonian city
• A paradox in a queueing network with state-dependent routing and loss
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Comparison theorems for stochastic chemical reaction networks
• User equilibria for a parallel queueing system with state dependent routing
• User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
• Locating inefficient links in a large-scale transportation network
• The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
• Simultaneous departure time/route choices in queuing networks and a novel paradox

This page was built for publication: Braess's paradox in a queueing network with state-dependent routing

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