Change of network load due to node removal

The interplay between topology changes and the redistribution of traffic plays a significant role in many real-world networks. In this paper we study how the load of the remaining network changes when nodes are removed. This removal operation can model attacks and errors in networks, or the planned control of network topology. We consider a scenario similar to the data communication networks, and measure the load of a node by its betweenness centrality. By analysis and simulations, we show that when a single node is removed, the change of the remaining network’s load is positively correlated with the degree of the removed node. In multiple-node removal, by comparing several node removal schemes, we show in detail how significantly different the change of the remaining network’s load will be between starting the removal from small degree/betweenness nodes and from large degree/betweenness nodes. Moreover, when starting the removal from small degree/betweenness nodes, we not only observe that the remaining network’s load decreases, which is consistent with previous studies, but also find that the load of hubs keeps decreasing. These results help us to make a deeper understanding about the dynamics after topology changes, and are useful in planned control of network topology.

[1]  Adilson E Motter.  Cascade control and defense in complex networks. , 2004, Physical review letters.

[2]  M. L. Sachtjen,et al.  Disturbances in a power transmission system , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[3]  Tarek F. Abdelzaher,et al.  Towards optimal sleep scheduling in sensor networks for rare-event detection , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[4]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

[5]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[6]  Y. Moreno,et al.  Instability of scale-free networks under node-breaking avalanches , 2001 .

[7]  Fei Tan,et al.  Cascading failures of loads in interconnected networks under intentional attack , 2013 .

[8]  R. Pastor-Satorras,et al.  Critical load and congestion instabilities in scale-free networks , 2003 .

[9]  Adilson E Motter,et al.  Cascade-based attacks on complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Agata Fronczak,et al.  Universal scaling of distances in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  H. Stanley,et al.  Cascading Failures in Bi-partite Graphs: Model for Systemic Risk Propagation , 2012, Scientific Reports.

[13]  Mo Li,et al.  A Survey on Topology issues in Wireless Sensor Network , 2006, ICWN.

[14]  Liang Zhang,et al.  Attack vulnerability of scale-free networks due to cascading failures , 2008 .

[15]  Vito Latora,et al.  Modeling cascading failures in the North American power grid , 2005 .

[16]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[17]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[18]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[19]  David J. Hill,et al.  Cascading failure in Watts–Strogatz small-world networks , 2010 .

[20]  Tomas Jonsson,et al.  Biodiversity lessens the risk of cascading extinction in model food webs , 2000 .

[21]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[22]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.