Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics and Decision Sciences
Volume 2007, Article ID 68280, 10 pages
http://dx.doi.org/10.1155/2007/68280
Research Article

A Paradox in a Queueing Network with State-Dependent Routing and Loss

Department of Statistics, The University of Auckland, Private Bag 92019, Auckland 1142, New Zealand

Received 25 May 2007; Accepted 8 August 2007

Academic Editor: Paul Cowpertwait

Copyright © 2007 Ilze Ziedins. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Braess, “Über ein Paradoxon aus der Verkehrsplanung,” Unternehmensforschung, vol. 12, no. 1, pp. 258–268, 1968. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. D. Braess, A. Nagurney, and T. Wakolbinger, “On a paradox of traffic planning,” Transportation Science, vol. 39, no. 4, pp. 446–450, 2005, English language translation of [1]. View at Publisher · View at Google Scholar
  3. http://homepage.ruhr-uni-bochum.de/Dietrich.Braess/#paradox.
  4. R. Arnott and K. Small, “The economics of traffic congestion,” American Scientist, vol. 82, no. 5, pp. 446–455, 1994. View at Google Scholar
  5. A. Downs, “The law of peak-hour expressway congestion,” Traffic Quarterly, vol. 16, no. 3, pp. 393–409, 1962. View at Google Scholar
  6. R. Steinberg and W. I. Zangwill, “The prevalence of Braess' paradox,” Transportation Science, vol. 17, no. 3, pp. 301–318, 1983. View at Google Scholar
  7. J. M. Thomson, Great Cities and Their Traffic, Gollancz, London, UK, Peregrine edition, 1977.
  8. J. G. Wardrop, “Some theoretical aspects of road traffic research,” ICE Proceedings, Engineering Divisions, vol. 1, no. 3, pp. 325–362, 1952. View at Publisher · View at Google Scholar
  9. E. Altman, R. El Azouzi, and V. Abramov, “Non-cooperative routing in loss networks,” Performance Evaluation, vol. 49, no. 1–4, pp. 257–272, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. N. G. Bean, F. P. Kelly, and P. G. Taylor, “Braess's paradox in a loss network,” Journal of Applied Probability, vol. 34, no. 1, pp. 155–159, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. F. P. Kelly, “Network routing,” Philosophical Transactions of the Royal Society of London. Series A, vol. 337, no. 1647, pp. 343–367, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. A. Orda, R. Rom, and N. Shimkin, “Competitive routing in multiuser communication networks,” IEEE/ACM Transactions on Networking, vol. 1, no. 5, pp. 510–521, 1993. View at Publisher · View at Google Scholar
  13. T. Roughgarden and É. Tardos, “How bad is selfish routing?” Journal of the ACM, vol. 49, no. 2, pp. 236–259, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  14. S. Spicer and I. Ziedins, “User-optimal state-dependent routeing in parallel tandem queues with loss,” Journal of Applied Probability, vol. 43, no. 1, pp. 274–281, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. R. Sheu and I. Ziedins, “Asymptotically optimal control of parallel tandem queues with loss,” The University of Auckland, preprint, 2007.
  16. B. Calvert, “The Downs-Thomson effect in a Markov process,” Probability in the Engineering and Informational Sciences, vol. 11, no. 3, pp. 327–340, 1997. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. B. Calvert, W. Solomon, and I. Ziedins, “Braess's paradox in a queueing network with state-dependent routing,” Journal of Applied Probability, vol. 34, no. 1, pp. 134–154, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. P. J. Hunt and C. N. Laws, “Asymptotically optimal loss network control,” Mathematics of Operations Research, vol. 18, no. 4, pp. 880–900, 1993. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. C. N. Laws and Y. C. Teh, “Alternative routeing in fully connected queueing networks,” Advances in Applied Probability, vol. 32, no. 4, pp. 962–982, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet