Braess's paradox in a loss network

DOI10.2307/3215183zbMath0883.60088OpenAlexW2077938414MaRDI QIDQ4339256

Nigel G. Bean, F. P. Kelly, Peter G. Taylor

Publication date: 4 March 1998

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

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

zbMATH Keywords

Braess's paradoxloss networksblocking probabilities

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (11)

Probabilistic selfish routing in parallel batch and single-server queues ⋮ Bio-inspired paradigms in network engineering games ⋮ Optimal Routing in Closed Queueing Networks with State Dependent Queues ⋮ A paradox in a queueing network with state-dependent routing and loss ⋮ Computing the Value of Information in Quadratic Stochastic Decision Problems ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Non-Negativity of Information Value in Games, Symmetry and Invariance ⋮ A survey on networking games in telecommunications ⋮ A paradox in optimal flow control of \(M/M/n\) queues ⋮ The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria ⋮ The deregulated electricity market viewed as a bilevel programming problem

This page was built for publication: Braess's paradox in a loss network