A paradox of congestion in a queuing network

Abstract

In an uncongested transportation network, adding routes and capacity to an existing network must decrease, or at worst not change, the average time individuals require to travel through the network from a source to a destination. Braess (1968) discovered that the same is not true in congested networks. Here we give an example of a queuing network in which added capacity leads to an increase in the mean transit time for everyone. Self-seeking individuals are unable to refrain from using the additional capacity, even though using it leads to deterioration in the mean transit time. This example appears to be the first queuing network to demonstrate the general principle that in non-co-operative games with smooth payoff functions, user-determined equilibria generically deviate from system-optimal equilibria.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 162 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.