Optimal Coupling Patterns in Interconnected Communication Networks

Traffic dynamics on single or isolated complex networks has been extensively studied in the past decade. Recently, several coupled network models have been developed to describe the interactions between real-world networked systems. In interconnected communication networks, the coupling links refer to the physical links between networks and provide paths for traffic transmission. In this brief, we employ a simulated annealing (SA) algorithm to find a near-optimal configuration of the coupling links, which effectively improves the overall traffic capacity compared with random, assortative, and disassortative couplings. Furthermore, we investigate the optimal configuration of coupling links given by the SA algorithm and develop a faster method to select the coupling links.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Zoltán Toroczkai,et al.  Structural bottlenecks for communication in networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  C. K. Michael Tse,et al.  Traffic congestion in interconnected complex networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

[7]  Yongxiang Xia,et al.  Optimal Resource Allocation in Complex Communication Networks , 2015, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  David J. Hill,et al.  Attack Vulnerability of Complex Communication Networks , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[9]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .

[10]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[11]  Zheng Zheng,et al.  A dynamic allocation mechanism of delivering capacity in coupled networks , 2015 .

[12]  Jiajing Wu,et al.  Complex-Network-Inspired Design of Traffic Generation Patterns in Communication Networks , 2017, IEEE Transactions on Circuits and Systems II: Express Briefs.

[13]  Xuejun Zhang,et al.  The effect of capacity redundancy disparity on the robustness of interconnected networks , 2016 .

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  C. K. Michael Tse,et al.  Concept of Node Usage Probability From Complex Networks and Its Applications to Communication Network Design , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.

[16]  Jiajing Wu,et al.  Robustness of Interdependent Power Grids and Communication Networks: A Complex Network Perspective , 2018, IEEE Transactions on Circuits and Systems II: Express Briefs.

[17]  C. K. Michael Tse,et al.  Analysis of Communication Network Performance From a Complex Network Perspective , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[18]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[19]  Reuven Cohen,et al.  Percolation in Interdependent and Interconnected Networks: Abrupt Change from Second to First Order Transition , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Sergio Gómez,et al.  Congestion induced by the structure of multiplex networks , 2016, Physical review letters.

[21]  Junan Lu,et al.  Recovering Structures of Complex Dynamical Networks Based on Generalized Outer Synchronization , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.