Survivability optimization and analysis of network topology based on average distance

This paper measures and optimizes the network survivability based on average distance. A method is proposed to design a network with constrained minimum average distance and to reduce the computation complexity based on adjacency matrix. This paper studies the optimization of simple connected graph with arbitrary nodes and links under degree limit. There may have several networks with minimum average distance in our method. So we choose the optimal network from them by the network performance analysis under random failure.

[1]  Yash P. Gupta,et al.  Genetic-algorithm-based reliability optimization for computer network expansion , 1995 .

[2]  Agustin Arruabarrena,et al.  Optimal Distance Networks of Low Degree for Parallel Computers , 1991, IEEE Trans. Computers.

[3]  Padhraic Smyth,et al.  Algorithms for estimating relative importance in networks , 2003, KDD '03.

[4]  Wu Jun,et al.  Finding the most vital node by node contraction in communication networks , 2005, Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005..

[5]  Jianwei Wang,et al.  A New Measure of Node Importance in Complex Networks with Tunable Parameters , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.

[6]  Wei-Tsong Lee,et al.  Symmetric design and topologies analysis for degree-3 connected network , 1992, [Proceedings] Singapore ICCS/ISITA `92.

[7]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[8]  Nancy R. Mead,et al.  Survivable Network Systems: An Emerging Discipline , 1997 .

[9]  L. Freeman,et al.  Centrality in social networks: ii. experimental results☆ , 1979 .

[10]  He Nan,et al.  Evaluate Nodes Importance in the Network Using Data Field Theory , 2007, 2007 International Conference on Convergence Information Technology (ICCIT 2007).

[11]  Xiaodi Huang,et al.  On the Structural Algorithm of Filtering Graphs for Layout , 2003, VIP.

[12]  Cruz Izu,et al.  Improving parallel system performance by changing the arrangement of the network links , 2000, ICS '00.

[13]  Shahram Latifi,et al.  Average distance and routing algorithms in the star-connected cycles interconnection network , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[14]  Weiming Zhang,et al.  A Hierarchical Method for Estimating Relative Importance in Complex Networks , 2008, 2008 International Symposium on Computer Science and Computational Technology.

[15]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[16]  K. Goh,et al.  Betweenness centrality correlation in social networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Anup Kumar,et al.  Genetic algorithm based approach for designing computer network topology , 1993, CSC '93.

[18]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Leendert M. Huisman,et al.  Highly Reliable Symmetric Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[20]  Mario Gerla,et al.  Routing in the bidirectional shufflenet , 2001, TNET.