Scaling of multicast trees: comments on the Chuang-Sirbu scaling law
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On the efficiency of multicast
IEEE/ACM Transactions on Networking (TON)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Relevance of massively distributed explorations of the internet topology: qualitative results
Computer Networks: The International Journal of Computer and Telecommunications Networking
A geographic directed preferential internet topology model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding a dense-core in Jellyfish graphs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Understanding IPv6 Usage: Communities and Behaviors
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Finding a dense-core in Jellyfish graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
| Hi-index | 0.00 |
Simplifying stochastic models of the topology of Internet have been studied intensively during the past few years. One of the most interesting ones is a random graph, where the degrees of the N nodes are drawn independently from a distribution with a Pareto tail with index τ ∈ (2, 3) (finite mean and infinite variance), and the connections are then made randomly. We show that, asymptotically almost surely, the graph has a giant component, and the distance between two randomly selected nodes of the giant component is of the order log log N. This high connectivity is a consequence of the spontaneous emergence of a "core network" consisting of nodes with high degrees. Our result sheds light on the structure of the random graph model and raises interesting issues on its similarities and dissimilarities with the real Internet.