Combinatorica
Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
On computing a conditional edge-connectivity of a graph
Information Processing Letters
Isoperimetric numbers of graphs
Journal of Combinatorial Theory Series B
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Understanding internet topology: principles, models, and validation
IEEE/ACM Transactions on Networking (TON)
Systematic topology analysis and generation using degree correlations
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Orbis: rescaling degree correlations to generate annotated internet topologies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Elasticity: topological characterization of robustness in complex networks
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Dynamical Processes on Complex Networks
Dynamical Processes on Complex Networks
Hi-index | 0.00 |
With increasingly ambitious initiatives such as GENI and FIND that seek to design future internets, it becomes imperative to define the characteristics of robust topologies, and build future networks optimised for robustness. This paper investigates the characteristics of network topologies that maintain a high level of throughput in spite of multiple attacks. To this end, we select network topologies belonging to the main network models and some real world networks. We consider three types of attacks: removal of random nodes, high degree nodes, and high betweenness nodes. We use elasticity as our robustness measure and, through our analysis, illustrate different topologies that can have different degrees of robustness. In particular, elasticity can fall as low as 0.8% of the upper bound based on the attack employed. This result substantiates the need for optimised network topology design. Furthermore, we implement a trade-off function that combines elasticity under the three attack strategies and considers the cost of the network. Our extensive simulations show that, for a given network density, regular and semi-regular topologies can have higher degrees of robustness than heterogeneous topologies, and that link redundancy is a sufficient but not necessary condition for robustness.