A paradox of congestion in a queuing network
From MaRDI portal
Publication:5750076
DOI10.2307/3214558zbMATH Open0718.60105OpenAlexW2053318772WikidataQ96323485 ScholiaQ96323485MaRDI QIDQ5750076FDOQ5750076
Publication date: 1990
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6d4a15f6899db00a9655af36ed886a87f6cd1343
Recommendations
- Braess's paradox in a queueing network with state-dependent routing
- A paradox in a queueing network with state-dependent routing and loss
- Some related paradoxes of queuing theory: new cases and a unifying explanation
- A paradox in optimal flow control of \(M/M/n\) queues
- A network of priority queues in heavy traffic: One bottleneck station
- scientific article; zbMATH DE number 4046840
- The model of queueing network with parallel routes
Cited In (28)
- Modeling strategic walk-in patients in appointment systems: equilibrium behavior and capacity allocation
- The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
- Braess's paradox in a queueing network with state-dependent routing
- Dynamics in braess paradox with nonimpulsive commuters
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems
- A new scenario for Braess's paradox in power grids
- Monotonicity properties of user equilibrium policies for parallel batch systems
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- Locating inefficient links in a large-scale transportation network
- Inefficiency in stochastic queueing systems with strategic customers
- Customer equilibrium and optimal strategies in Markovian queues in series
- Optimization via trunk reservation in single resource loss systems under heavy traffic
- Non-cooperative queueing games on a network of single server queues
- A survey on networking games in telecommunications
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox
- A network of priority queues in heavy traffic: One bottleneck station
- Probabilistic selfish routing in parallel batch and single-server queues
- Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization
- Capacity allocation in a two-channel service system from a social planner's perspective
- Performance paradox of dynamic matching models under greedy policies
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
- A paradox in optimal flow control of \(M/M/n\) queues
- On the severity of Braess's paradox: designing networks for selfish users is hard
- The Downs-Thomson Effect in a Markov Process
- User equilibria for a parallel queueing system with state dependent routing
- A Paradox for Admission Control of Multiclass Queueing Network with Differentiated Service
- Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games
- EFFECTS OF SYMMETRY ON GLOBALIZING SEPARATED MONOPOLIES TO A NASH-COURNOT OLIGOPOLY
This page was built for publication: A paradox of congestion in a queuing network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750076)
