An interesting problem arises: how many users are reachable by one user in the Gnutella network? How should one set the count-down timer in each packet to reach all nodes? The problem is equivalent to the following one: how many people are between any two people or between you and the President of the United Nations, as an example? This is sometimes referred as the small world problem, a common experience of many of us: we meet a new friend and we discover he/she knows someone we know as well. Milgram's experiment showed empirically that any two people in the United States are distant six edges from each other.
To solve the problem, we attempt a volumetric argument. Some fractal arguments are given in , although they go by far more in depth. However, we start our argument with an analogic machine to compute the solution. Results are consistent with Mandelbrot's fractal theory [24,25].