×

A unified network performance measure with importance identification and the ranking of network components. (English) Zbl 1145.90011

Summary: In this paper, we propose the first network performance measure that can be used to assess the efficiency of a network in the case of either fixed or elastic demands. Such a measure is needed for many different applications since only when the performance of a network can be quantifiably measured can the network be appropriately managed. Moreover, as we demonstrate, the proposed performance measure, which captures flow information and behavior, allows one to determine the criticality of various nodes (as well as links) through the identification of their importance and ranking. We present specific networks for which the performance/efficiency is computed along with the importance rankings of the nodes and links. The new measure can be applied to transportation networks, supply chains, financial networks, electric power generation and distribution networks as well as to the Internet and can be used to assess the vulnerability of a network to disruptions.

MSC:

90B10 Deterministic network models in operations research
PDF BibTeX XML Cite
Full Text: DOI Link

References:

[1] Barabási A.L. and Albert R. (1999). Emergence of scaling in random networks. Science 286: 509–512 · Zbl 1226.05223
[2] Beckmann M.J., McGuire C.B. and Winsten C.B. (1956). Studies in the Economics of Transportation. Yale University Press, New Haven, Connecticut
[3] Boginski V., Butenko S., Pardalos P.M. (2003) On structural properties of the market graph. In: Nagurney A. (ed). Innovations in Financial and Economic Networks. Edward Elgar Publishing, Cheltenham, pp. 29-45
[4] Braess D. (1968). Uber ein paradoxon aus der verkehrsplanung. Unternehmenforschung 12: 258–268 · Zbl 0167.48305
[5] Chassin D.P. and Posse C. (2005). Evaluating North American electric grid reliability using the Barabási-Albert network model. Physica A 355: 667–677
[6] Dafermos S. (1980). Traffic equilibrium and variational inequalities. Transport. Sci. 14: 42–54
[7] Dafermos S. (1982). The general multimodal network equilibrium problem with elastic demand. Networks 12: 57–72 · Zbl 0478.90022
[8] Dafermos S.C. and Sparrow F.T. (1969). The traffic assignment problem for a general network. J. Res. Nat. Bureau Stand. 73: 91–118 · Zbl 0197.46003
[9] Dhanda K.K., Nagurney A. and Ramanujam P. (1999). Environmental Networks: A Framework for Economic Decision-Making and Policy Analysis. Edward Elgar Publishing, Cheltenham
[10] Erdös P. and Rényi A. (1960). On the evolution of random graphs. Public Math. Inst. Hungary Acad. Sci. 5: 17–61 · Zbl 0103.16301
[11] Jenelius E., Petersen T. and Mattsson L.G. (2006). Road network vulnerability: Identifying important links and exposed regions. Transport. Res. A 20: 537–560
[12] Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett. 87, Article No. 198701 (2001) · Zbl 1060.91520
[13] Latora V. and Marchiori M. (2003). Economic small-world behavior in weighted networks. Eur. Phys. J. B 32: 249–263
[14] Latora V. and Marchiori M. (2004). How the science of complex networks can help developing strategies against terrorism. Chaos Solitons Fractals 20: 69–75 · Zbl 1122.91372
[15] Liu, Z., Nagurney, A.: Financial networks with intermediation and transportation network equilibria: A supernetwork equivalence and computational management reinterpretation of the equilibrium conditions with computations. Comput. Manage. Sci. (2006, in press) · Zbl 1142.91541
[16] Murray-Tuite P.M. and Mahmassani H.S. (2004). Methodology for determining vulnerable links in a transportation network. Transport. Res. Rec. 1882: 88–96
[17] Nagurney A. (1984). Comparative tests of multimodal traffic equilibrium methods. Transport. Res. B 18: 469–485
[18] Nagurney A. (1999). Network Economics: A Variational Inequality Approach. second and revised edition. Kluwer Academic Publishers, Dordrecht
[19] Nagurney A. (2006). On the relationship between supply chain and transportation network equilibria: A supernetwork equivalence with computations. Transport. Res. E 42: 293–316
[20] Nagurney A. and Dong J. (2002). Supernetworks: Decision-Making for the Information Age. Edward Elgar Publishing, Cheltenham · Zbl 1025.91500
[21] Nagurney, A., Parkes, D., Daniele, P.: The Internet, evolutionary variational inequality, and the time-dependent Braess Paradox. Comput. Manage. Sci. (2006, in press) · Zbl 1141.65051
[22] Nagurney A. and Zhang D. (1996). Projected Dynamical Systems and Variational Inequalities with Applications. Kluwer Academic Publishers, Boston · Zbl 0865.90018
[23] Newman M. (2003). The structure and function of complex networks. SIAM Rev. 45: 167–256 · Zbl 1029.68010
[24] O’Kelly M.E., Kim H. and Kim C. (2006). Internet reliability with realistic peering. Environ. Plan. B 33: 325–343
[25] Sheffi Y. (2005). The Resilient Enterprise: Overcoming Vulnerability for Competitive Advantage. MIT Press, Cambridge
[26] Smith M. (1979). Existence, uniqueness and stability of traffic equilibria. Transport. Res. B 13: 259–304
[27] Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the institution of civil engineers, Part II 1, 325–378 (1952)
[28] Watts D.J. and Strogatz S.H. (1998). Collective dynamics of ’small-world’ networks. Nature 393: 440–442 · Zbl 1368.05139
[29] Wu K., Nagurney A., Liu Z. and Stranlund J.K. (2006). Modeling generator power plant portfolios and pollution taxes in electric power supply chain networks: a transportation network equilibrium transformation. Transport. Res. D 11: 171–190
[30] Zhu D., Hu Y., Li Y. and Yu B. (2006). A new measure for airline networks performance evaluation and critical cities identification. Fudan University, Shanghai
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.