Performance analysis in unstructured overlays

In this paper, we propose a performance analysis model to study the reach-ability in unstructured overlay networks. Given a node´s degree distribution and a network size, n, the model describes the flooding query pattern in a P2P network accurately. Also, we prove that in such an overlay network, the average distance between any two hosts is limited by O(log N). This model is simple and accurate, and therefore is a very useful tool in exploring many properties of massive overlay networks. It can be applied to P2P based content distribution networks and ad hoc wireless networks, for example.