Braess ' Paradox in a Loss

@inproceedings{Bean1995BraessP,
  title={Braess ' Paradox in a Loss},
  author={N. G. Bean and F. P. Kellyy and P. G. Taylor},
  year={1995}
}
Braess' paradox is said to occur in a network if the addition of an extra link leads to worse performance. It has been shown to occur in transportation networks (such as road networks) and also in queueing networks. Here, we show that it can occur in loss networks. 
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Reward-based routing and Braess' paradox an efficient resource usage strategy

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. • 2004
View 5 Excerpts
Highly Influenced

Routing games : From egoism to altruism

8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks • 2010

A paradox in optimal flow control of M/M/m queues

2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) • 2004

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Braess ' s paradox in a queueing networkwith state dependent routing

J. E. Cohen, P. Horowitz
1995

Routing in Circuit - Switched Networks : Optimization , ShadowPrices and Decentralization

F. P. Kelly.
Advances in Applied Probability • 1993

Flexible Routing in the BTInternational Acess Network

M. J. Whitehead.
1990

How Braess ' paradox solves Newcomb ' s problem

D. J. A. Walsh
InternationalStudies in the Philosophy of Science • 1989

Equilibrium vs SystemOptimal Flow : Some Examples

N. F. Stewart.
1983

An Algorithm for the Discrete Network Design Problem

L. J. Leblanc.
1982

More Paradoxes in the Equilibrium Assignment Problem

M. Frank.
Transport - ation Research , Part B : Methodological • 1979

Similar Papers

Loading similar papers…