Dynamic braess's paradox in complex communication networks

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 60, Issue 3, 2013, Pages 172-176

  Xia, Yongxiang ^a   Hill, David J ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Braess's paradox; complex networks; game theory; traffic performance

Indexed keywords

GAME THEORY; TELECOMMUNICATION NETWORKS;

BRAESS'S PARADOX; DYNAMIC CONDITION; REAL-WORLD; TRAFFIC PERFORMANCE; TRAFFIC VOLUMES;

COMPLEX NETWORKS;

EID: 84875371183     PISSN: 15497747     EISSN: 15583791     Source Type: Journal    
DOI: 10.1109/TCSII.2013.2240912     Document Type: Article

References (24)

1. W. M. Tam, F. C. M. Lau, and C. K. Tse, "Complex-network modeling of a call network," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 56, no. 2, pp. 416-429, Feb. 2009.
2. Y. Xia and D. J. Hill, "Attack vulnerability of complex communication networks," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 55, no. 1, pp. 65-69, Jan. 2008.
3. M. Babaei, H. Ghassemieh, and M. Jalili, "Cascading failure tolerance of modular small-world networks," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 58, no. 8, pp. 527-531, Aug. 2011.
4. J. Zhou, J. Lu, and J. Lü, "Pinning adaptive synchronization of a general complex dynamical network," Automatica, vol. 44, no. 4, pp. 996-1003, 2008.
5. D. Braess, "Über ein paradoxon aus der verkehrsplanung," Unternehmensforschung, vol. 12, no. 1, pp. 258-268, 1968.
6. D. Braess, A. Nagurney, and T. Wakolbinger, "On a paradox of traffic planning," Transp. Sci., vol. 39, no. 4, pp. 446-450, Nov. 2005. (Pubitemid 41706005)
7. M. Frank, "The Braess paradox," Math. Program., vol. 20, pp. 283-302, 1981.
8. J. E. Cohen and P. Horowitz, "Paradoxical behaviour of mechanical and electrical networks," Nature, vol. 352, no. 6337, pp. 699-701, Aug. 1991. (Pubitemid 21912406)
9. N. G. Bean, F. P. Kelly, and P. G. Taylor, "Braess's paradox in a loss network," J. Appl. Probab., vol. 34, no. 1, pp. 155-159, Mar. 1997. (Pubitemid 127354938)
10. J. E. Cohen and C. Jeffries, "Congestion resulting from increased capacity in single-server queueing networks," IEEE/ACM Trans. Netw., vol. 5, no. 2, pp. 305-310, Apr. 1997. (Pubitemid 127768472)
11. J. N. Hagstrom and R. A. Abrams, "Characterizing Braess's paradox for traffic networks," in IEEE Intell. Transp. Syst. Conf. Proc., 2001, pp. 836-841. (Pubitemid 32936449)
12. T. Roughgarden and É. Tardos, "How bad is selfish routing," J. ACM, vol. 49, no. 2, pp. 236-259, Mar. 2002.
13. H. Kameda, "How harmful the paradox can be in the Braess/Cohen-Kelly-Jeffries networks," in Proc. IEEE INFOCOM, 2002, pp. 437-445.
14. G. Valiant and T. Roughgarden, "Braess's paradox in large random graphs," in Proc. 7th ACMConf. Electron. Commerce, 2006, pp. 296-305. (Pubitemid 44393648)
15. H. Youn, M. T. Gastner, and H. Jeong, "Price of anarchy in transportation networks: Efficiency and optimality control," Phys. Rev. Lett., vol. 101, no. 12, pp. 128701-1-128701-4, Sep. 2008.
16. H. Lin, T. Roughgarden, É. Tardos, and A. Walkover, "Strong bounds on Braess's paradox and the maximum latency of selfish routing," unpublished. [Online]. Available: http://theory.stanford.edu/tim/papers/mcbp. pdf
17. T. Roughgarden, "On the severity of Braess's paradox: Designing networks for selfish users is hard," J. Comput. Syst. Sci., vol. 72, no. 5, pp. 922-953, Aug. 2006.
18. M. G. Pala, S. Baltazar, P. Liu, H. Sellier, B. Hackens, F. Martins, V. Bayot, X.Wallart, L. Desplanque, and S. Huant, "Transport inefficiency in branched-out mesoscopic networks: An analog of the Braess paradox," Phys. Rev. Lett., vol. 108, no. 7, p. 076802, Feb. 2012.
19. A. Nagurney, D. Parkes, and P. Daniele, "The Internet, evolutionary variational inequalities, and the time-dependent Braess paradox," Comput. Manage. Sci., vol. 4, pp. 355-375, 2007.
20. E. I. Pas and S. L. Principio, "Braess' paradox: Some new insights," Transp. Res. B, vol. 31, pp. 265-276, 1997. (Pubitemid 127420410)
21. X. F. Wang and G. Chen, "Complex networks: Small-world, scale-free and beyond," IEEE Circuits Syst. Mag., vol. 3, no. 1, pp. 6-20, 2003.
22. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, Oct. 1999.
23. P. Erdös and A. Rényi, "On the evolution of random graphs," Publ. Math. Inst. Hung. Acad. Sci., vol. 5, pp. 17-61, 1960.
24. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, Jun. 1998. (Pubitemid 28292183)