pith. sign in

arxiv: cond-mat/0301555 · v2 · submitted 2003-01-28 · ❄️ cond-mat

Are Scale Free Networks Better?

classification ❄️ cond-mat
keywords freenetworksscalescalingtrafficallowsbettercapacity
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.