Are Scale Free Networks Better?
Gergely Peli, Gabor Papp
Abstract
We study the performance of Weibull and scale free Internet-like networks and compare them to a classical random graph based network. The scaling of the traffic load with the nodal degree is established, and confimed in a numerical simulation of the TCP traffic. The scaling allows us to estimate the link capacity upgrade required making and extra connection to an existing node.
Create a lesson
Related papers
Knots in Condensed Matters
Y. M. Cho
Bouchaud's model exhibits two different aging regimes in dimension one
Gerard Ben Arous, Jiri Cerny
Periodic diffraction patterns for 1D quasicrystals
Pawel Buczek, Lorenzo Sadun, Janusz Wolny
Adiabatic association of ultracold molecules via magnetic field tunable interactions
Krzysztof Goral, Thorsten Koehler, Simon A. Gardiner et al.
High-Temperature Atomic Superfluidity in Lattice Boson-Fermion Mixtures
F. Illuminati, A. Albus
Constructive Methods of Invariant Manifolds for Kinetic Problems
A. N. Gorban, I. V. Karlin, A. Yu. Zinovyev