Vulnerability of complex networks under path-based attacks

Pu, Cunlai; Wei, Chuan‐Yuan

doi:10.1016/j.physa.2014.10.038

Cited by 35 publications

(19 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To date, link betweenness has been the most prevalent mechanism, [46]. Counting the number of all shortest paths that a specific link features on, link betweenness intuitively prioritises links in the barycenter of the network.…”

Section: Introductionmentioning

confidence: 99%

The vulnerability of the global container shipping network to targeted link disruption

Viljoen

Joubert

2016

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

Using complex network theory to describe the relational geography of maritime networks has provided great insights regarding their hierarchy and evolution over the past two decades. Unlike applications in other transport fields, notably air transport, complex network theory has had limited application in studying the vulnerability of maritime networks. This study uses targeted link disruption to investigate the strategy specific vulnerability of the network. Although nodal infrastructure such as ports can render a network vulnerable as a result of labour strikes, trade embargoes or natural disasters, it is the shipping lines connecting the ports that are more probably disrupted, either from within the industry, or outside. In this paper we apply and evaluate two link-based disruption strategies on the global container shipping network, one based on link betweenness, and the other on link salience, to emulate the impact of large-scale service reconfiguration affecting priority links. The results show that the network is by and large robust to such reconfiguration. Meanwhile the flexibility of the network is reduced by both strategies, but to a greater degree by betweenness, resulting in a reduction of transshipment and dynamic rerouting potential amongst the busiest port regions. The results further show that the salience strategy is highly effective in reducing the commonality of shortest path sets, thereby diminishing opportunities for freight consolidation and scale economies.

show abstract

Section: Introductionmentioning

confidence: 99%

The vulnerability of the global container shipping network to targeted link disruption

Viljoen

Joubert

2016

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

show abstract

“…In this section, the proposed three shortest path-attack strategies and RPA [9] are applied to random, scale-free and small-world three model networks. The results of RSP and RPA are the average of 1000 independent runs.…”

Section: Numerical Results and Analysismentioning

confidence: 99%

“…So, Pu found that "terrorists usually prefer much larger scale attacks, and drugs always affect many targets". The RPA(the random augmenting approach) and HPA(the Hamilton path based approach) longest path-attack strategies were proposed on this basis [9]. However, according to the experimental results of Milgram [10], when people choose a path in the network, they tend to choose the shortest one between two points.…”

Section: Introductionmentioning

confidence: 99%

Vulnerability Analysis for Complex Networks under the Shortest Path-Attack Strategies

Hao¹,

Han²,

Cheng³

et al. 2016

Proceedings of the 2016 International Conference on Communications, Information Management and Network Security

View full text Add to dashboard Cite

Abstract-We proposed three shortest path-attack strategies and investigated the vulnerability of three complex model networks under these path-attack strategies. The experimental results indicate that the robustness of random network is the weakest, but small-world network is the strongest under the shortest pathattack strategies. We also obtain that the shortest path-attack strategies are more harmful than RPA(random augmenting approach) attack strategy. These findings supplement and extend the previous attack results and can thus help us to provide some insights into the design of more robust networks.

show abstract

“…Second, RLC randomly chooses a neighboring node of the initial node as the second node of the chain, and then chooses a neighboring node of the second node as the third node of the chain, and so on [21]. No node should be invaded twice in the chain augmenting process and it continues until no appropriate node could be found.…”

Section: Chain Structure Of Invasionmentioning

confidence: 99%

“…The number of iterative steps (T) reflects the tolerance of a network [21]. The initial value of T is zero, and it increases by one each time with a chain-attack.…”

Section: Implement and Measure Of Chain Attackmentioning

confidence: 99%

Vulnerability of Complex Networks under Approximate Longest Chain Attack Strategies

Hao¹,

Song²,

Lin³

et al. 2016

ITM Web Conf.

View full text Add to dashboard Cite

Abstract. We proposed three approximate longest chain-attack strategies and studied the vulnerability of complex networks under these intentional attack strategies. Experimental results indicate that when random network and small-world network are under any one of the three chain-attacks, the larger the is, the smaller the iterative step T is. However, scale-free network shows different characteristics: the larger the is, the larger the T is. These findings supplement and extend the previous attack results on nodes and edges, and can thus help us better explain the vulnerability of different complex networks.

show abstract

Vulnerability of complex networks under path-based attacks

Cited by 35 publications

References 44 publications

The vulnerability of the global container shipping network to targeted link disruption

The vulnerability of the global container shipping network to targeted link disruption

Vulnerability Analysis for Complex Networks under the Shortest Path-Attack Strategies

Vulnerability of Complex Networks under Approximate Longest Chain Attack Strategies

Contact Info

Product

Resources

About