ELASTICITY: Topological Characterization of Robustness in Complex Networks

Just as a herd of animals relies on its robust social structure to survive in the wild, similarly robustness is a crucial characteristic for the survival of a complex network under attack. The capacity to measure robustness in complex networks defines a network's survivability in the advent of classical component failures and at the onset of cryptic malicious attacks. To date, robustness metrics are deficient and unfortunately the following dilemmas exist: accurate models necessitate complex analysis while conversely, simple models lack applicability to our definition of robustness. In this paper, we define robustness and present a novel metric, elasticity- a bridge between accuracy and complexity-a link in the chain of network robustness. Additionally, we "test-drive" the performance of elasticity on Internet topologies and online social networks, and articulate results.

[1]  Jim Kurose,et al.  Study companion, Computer networking, a top-down approach featuring the Internet, third edition, James F. Kurose, Keith W. Ross , 2007 .

[2]  Junming Xu,et al.  Theory and Application of Graphs , 2003, Network Theory and Applications.

[3]  Walter Willinger,et al.  Understanding Internet topology: principles, models, and validation , 2005, IEEE/ACM Transactions on Networking.

[4]  S. Low,et al.  The "robust yet fragile" nature of the Internet. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[5]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[7]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM 2004.

[8]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[9]  Priya Mahadevan,et al.  Systematic topology analysis and generation using degree correlations , 2006, SIGCOMM.

[10]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM '04.

[11]  Priya Mahadevan,et al.  Orbis: rescaling degree correlations to generate annotated internet topologies , 2007, SIGCOMM '07.

[12]  H. A. Jung,et al.  On a class of posets and the corresponding comparability graphs , 1978, J. Comb. Theory B.

[13]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[14]  Vasek Chvátal,et al.  Tough graphs and hamiltonian circuits , 1973, Discret. Math..

[15]  Christos Gkantsidis,et al.  Spectral analysis of Internet topologies , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  S. Louis Hakimi,et al.  On Computing a Conditional Edge-Connectivity of a Graph , 1988, Inf. Process. Lett..

[17]  J Xu ON CONDITIONAL EDGE-CONNECTIVITY OF GRAPHS , 2000 .

[18]  M. Krishnamoorthy,et al.  Fault diameter of interconnection networks , 1987 .

[19]  kc claffy,et al.  Impact of Degree Correlations on Topology Generators , 2005, SIGCOMM 2005.

[20]  Priya Mahadevan,et al.  The internet AS-level topology: three data sources and one definitive metric , 2005, Comput. Commun. Rev..

[21]  Bin Liu,et al.  Spectral Measure of Robustness in Complex Networks , 2008 .

[22]  D. R. Lick,et al.  The Theory and Applications of Graphs. , 1983 .

[23]  Almerima Jamakovic,et al.  Influence of the network structure on robustness , 2007, 2007 15th IEEE International Conference on Networks.

[24]  Seungyeop Han,et al.  Analysis of topological characteristics of huge online social networking services , 2007, WWW '07.

[25]  Jim Kurose,et al.  Computer Networking: A Top-Down Approach (6th Edition) , 2007 .

[26]  I. Frisch,et al.  Analysis and Design of Survivable Networks , 1970 .