A network efficiency measure for congested networks

A. Nagurney, Qiang Qiang

Research output: Contribution to journalArticle

65 Citations (Scopus)

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 in which the demands are varied over the horizon and explicit formulae are derived for the importance values of the network nodes and links. This measure is applicable to such congested networks as urban transportation networks and the Internet.

Original languageEnglish (US)
Article number38005
JournalEPL
Volume79
Issue number3
DOIs
StatePublished - Aug 1 2007

Fingerprint

urban transportation
transportation networks
structural failure
vulnerability
disasters
paradoxes
attack
horizon
costs

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Cite this

Nagurney, A. ; Qiang, Qiang. / A network efficiency measure for congested networks. In: EPL. 2007 ; Vol. 79, No. 3.
@article{78aae1fdf4ca4aeb8a617e8ac08d7033,
title = "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 in which the demands are varied over the horizon and explicit formulae are derived for the importance values of the network nodes and links. This measure is applicable to such congested networks as urban transportation networks and the Internet.",
author = "A. Nagurney and Qiang Qiang",
year = "2007",
month = "8",
day = "1",
doi = "10.1209/0295-5075/79/38005",
language = "English (US)",
volume = "79",
journal = "Europhysics Letters",
issn = "0295-5075",
publisher = "IOP Publishing Ltd.",
number = "3",

}

A network efficiency measure for congested networks. / Nagurney, A.; Qiang, Qiang.

In: EPL, Vol. 79, No. 3, 38005, 01.08.2007.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A network efficiency measure for congested networks

AU - Nagurney, A.

AU - Qiang, Qiang

PY - 2007/8/1

Y1 - 2007/8/1

N2 - 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 in which the demands are varied over the horizon and explicit formulae are derived for the importance values of the network nodes and links. This measure is applicable to such congested networks as urban transportation networks and the Internet.

AB - 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 in which the demands are varied over the horizon and explicit formulae are derived for the importance values of the network nodes and links. This measure is applicable to such congested networks as urban transportation networks and the Internet.

UR - http://www.scopus.com/inward/record.url?scp=79051468913&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79051468913&partnerID=8YFLogxK

U2 - 10.1209/0295-5075/79/38005

DO - 10.1209/0295-5075/79/38005

M3 - Article

AN - SCOPUS:79051468913

VL - 79

JO - Europhysics Letters

JF - Europhysics Letters

SN - 0295-5075

IS - 3

M1 - 38005

ER -