  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.
