2007
DOI: 10.1209/0295-5075/79/38005
|View full text |Cite
|
Sign up to set email alerts
|

A network efficiency measure for congested networks

Abstract: In this paper, we propose a network efficiency measure for congested networks, that captures demands, costs, flows, and behavior. The network efficiency/performance measure can identify which network components, that is, nodes and links, have the greatest impact in terms of their removal, due to, for example, natural disasters, structural failures, terrorist attacks, etc., and, hence, are important from both vulnerability as well as security standpoints. The new measure is applied to the Braess paradox network… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
56
1

Year Published

2008
2008
2019
2019

Publication Types

Select...
6
3
1

Relationship

1
9

Authors

Journals

citations
Cited by 87 publications
(58 citation statements)
references
References 19 publications
0
56
1
Order By: Relevance
“…Previous studies on the reliability of transport networks have also focused on unweighted networks, [19][20][21] and few considered passenger flow as a weight for evaluating the reliability of weighted networks. Nagurney 22 once considered the average passenger flow in each origin and destination pair in unit time as the evaluation index of network reliability and analyzed the network reliability by simulating the scenario where one node or side is attacked at one time. However, network reliability in the condition of continuous attack was not considered.…”
Section: Introductionmentioning
confidence: 99%
“…Previous studies on the reliability of transport networks have also focused on unweighted networks, [19][20][21] and few considered passenger flow as a weight for evaluating the reliability of weighted networks. Nagurney 22 once considered the average passenger flow in each origin and destination pair in unit time as the evaluation index of network reliability and analyzed the network reliability by simulating the scenario where one node or side is attacked at one time. However, network reliability in the condition of continuous attack was not considered.…”
Section: Introductionmentioning
confidence: 99%
“…Albert and Barabási [25] and Klau and Weiskircher [26] have developed robustness indices for topological networks, i.e., networks in which all edges have the same length. Nagurney and Qiang [27,28] have measured the robustness of transportation networks with respect to congestion and user behaviour. Recently, De-LosSantos et al [29] have proposed robustness indices for rapid transit systems for two scenarios.…”
Section: Assessing Rapid Transit Networkmentioning
confidence: 99%
“…Furthermore, based on the network efficiency measure of Nagurney and Qiang (2007a), the authors proposed a transportation network robustness measure to study the network efficiency loss when facing link capacity degradations under the user-optimization behavior (Nagurney and Qiang, 2007b). In this paper, however, we extend the above research to study different user behaviors and from the point of view of total network cost.…”
Section: Introductionmentioning
confidence: 99%