On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
Bluetooth: vision, goals, and architecture
ACM SIGMOBILE Mobile Computing and Communications Review
Scale-Free Topology for Pervasive Networks
BT Technology Journal
Self-organization algorithms for autonomic systems in the SelfLet approach
Proceedings of the 1st international conference on Autonomic computing and communication systems
| Hi-index | 0.00 |
In this paper, we investigate the effect of using two different connection rules (‘growth’ and ‘delayed attachment’) on the topological properties of simulated networks. We show that comparable values of global variables (like the slope of the power law distribution of node frequency versus node degree) do not guarantee topological similarity, which can have considerable implications for network resilience to cumulative node failure. We present evidence that the decay of the giant component under stress can be approximated using a simple logistic function, the constants of which being determined by the connection rules. The relevance of these findings to present and future telecommunications networks is discussed, especially in terms of potential improvements to robustness.