Abstract

The traffic network is a scale-free network. In selective attack, invalidation of few key nodes may lead to network failure so it is important to find these key nodes. In this study, the key nodes are determined by establishing calculating methods of node importance based on cascading failure behaviors. First, a cascading failure model of traffic network is posed. Its differences from current models are as follows: 1) The upper travel network and lower road network are influenced each other, 2) Capacity of nodes and links are given at first but not in direct proportion to initial flow that is related to initial capacity, 3) Travel time is used to describe status of links, 4) Capacity of links may change. The evaluation method of node importance of traffic network considering cascading failure is proposed then based on node deletion. It uses congestion status of cascading failure network to describe the node importance and algorithm procedures are designed to estimate importance of all nodes. At the end, the experiment analysis shows that network structure and traveler behaviors have in significant influence on node importance.

Keywords:

Bi-level network, cascading failure, node importance, traffic network,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.