The fractal properties of internet

In this paper we show that the Internet web, from a user’s perspective, manifests robust scaling properties of the type P(n)∝n−r where n is the size of the basin connected to a given point, P represents the density of probability of finding a basin of size n connected and τ = 1.9±0.1 is a characteristic universal exponent. The connection between users and providers are studied and modeled as branches of a world spanning tree. This scale-free structure is the result of the spontaneous growth of the web, but is not necessarily the optimal one for efficient transport. We introduce an appropriate figure of merit and suggest that a planning of few big links, acting as information highways, may noticeably increase the efficiency of the net without affecting its robustness