TY - JOUR
T1 - A unified network performance measure with importance identification and the ranking of network components
AU - Qiang, Qiang
AU - Nagurney, Anna
N1 - Funding Information:
Acknowledgments The authors are grateful to the two anonymous reviewers and to the Associate Editor for the helpful suggestions and comments on an earlier version of this paper. This research was supported, in part, by NSF Grant No. IIS-0002647 under the Management of Knowledge Intensive Dynamic Systems (MKIDS) program and, in part, by the John F. Smith Memorial Fund at the Isenberg School of Management. This support is gratefully acknowledged. The authors also acknowledge Professor Daoli Zhu of Fudan University and his students for helpful discussions during the second author’s visit to Shanghai, China.
Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2008/1
Y1 - 2008/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=35448942760&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35448942760&partnerID=8YFLogxK
U2 - 10.1007/s11590-007-0049-2
DO - 10.1007/s11590-007-0049-2
M3 - Article
AN - SCOPUS:35448942760
SN - 1862-4472
VL - 2
SP - 127
EP - 142
JO - Optimization Letters
JF - Optimization Letters
IS - 1
ER -