A systematic method for network topology reconfiguration with limited link additions

As a promising approach to improve network survivability, reliability and flexibility, topology reconfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and the limited link addition resources, it is valuable to determine how to optimally allocate the new link resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reconfiguration (NTR) optimization with limited link additions. A dynamic robustness metric is developed to quantitatively characterize the robust connectivity and the efficiency under either random or targeted attack. We show that the NTR optimization with limited link additions is NP-hard. Therefore, to approximately solve the problem, we develop a preferential configuration node-protecting cycle (PCNC) method for sequential link additions. Analysis showed that PCNC method provides an approximate optimal solution under the dynamic robustness metric when compared with the optimal solution found by exhaustive search. Simulation results also showed that PCNC method effectively improves the network robustness and communication efficiency at the cost of least added link resources.

[1]  Abhijit Sarkar,et al.  Two-peak and three-peak optimal complex networks. , 2004, Physical review letters.

[2]  Piet Van Mieghem,et al.  Algebraic connectivity optimization via link addition , 2008, BIONETICS.

[3]  Damien Magoni,et al.  nem: a software for network topology analysis and modeling , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[4]  Yacine Challal,et al.  Secure and efficient disjoint multipath construction for fault tolerant routing in wireless sensor networks , 2011, J. Netw. Comput. Appl..

[5]  V. Latora,et al.  A measure of centrality based on network efficiency , 2004, cond-mat/0402050.

[6]  R. Linsker,et al.  Improving network robustness by edge modification , 2005 .

[7]  Hiroki Sayama,et al.  Optimization of robustness and connectivity in complex networks. , 2003, Physical review letters.

[8]  Doyle,et al.  Highly optimized tolerance: robustness and design in complex systems , 2000, Physical review letters.

[9]  Shingo Ata,et al.  A Strategic Approach for Re-organizing the Internet Topology by Applying Social Behavior Dynamics , 2009, Journal of Network and Systems Management.

[10]  Yaron Singer,et al.  Dynamic Measure of Network Robustness , 2006, 2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel.

[11]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[12]  Shi Xiao,et al.  Robustness of Complex Communication Networks under Rewiring Operations , 2006, 2006 10th IEEE Singapore International Conference on Communication Systems.

[13]  Chaouki T. Abdallah,et al.  Brief Announcement: Self-healing Algorithms for Reconfigurable Networks , 2006, SSS.

[14]  Adilson E Motter,et al.  Heterogeneity in oscillator networks: are smaller worlds easier to synchronize? , 2003, Physical review letters.

[15]  H. Bez,et al.  Computer mathematics , 1984 .

[16]  Brigitte Jaumard,et al.  A Survey on the p-Cycle Protection Method , 2009, IEEE Communications Surveys & Tutorials.

[17]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[18]  Kousuke Sekiyama,et al.  Robustness Enhancement with Network Topology Reconfiguration Against Targeted and Random Attack , 2006, 2006 SICE-ICASE International Joint Conference.

[19]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[20]  Yamir Moreno,et al.  Dynamics of jamming transitions in complex networks , 2005 .

[21]  J M Carlson,et al.  Highly optimized tolerance: a mechanism for power laws in designed systems. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[22]  T. Tanizawa,et al.  Optimization of robustness of complex networks , 2005 .

[23]  Sánchez Martínez,et al.  Robustness optimization via link additions , 2009 .

[24]  Qing-Shan Jia,et al.  A near optimal solution for network topology reconfigurations with limited link resources , 2011, 2011 9th World Congress on Intelligent Control and Automation.

[25]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[26]  Zhen Ji,et al.  Optimization between security and delay of quality-of-service , 2011, J. Netw. Comput. Appl..

[27]  Jan van Leeuwen,et al.  Diameter increase caused by edge deletion , 1987, J. Graph Theory.