GridDL: an HTTP bandwidth sharing framework
Proceedings of the 1st ACM workshop on User-provided networking: challenges and opportunities
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Bounding virus proliferation in P2P networks with a diverse-parameter trust management scheme
IEEE Communications Letters
Research and analysis of the optimization of the unstructured P2P overlay networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A new authentication model based on CL-PKC in resource limited P2P systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
| Hi-index | 0.00 |
Mapping and analyzing the topological properties of P2P overlay network will benefit the further design and development of the P2P networks. In this paper, the measured Gnutella network topology is basically taken as an example. The properties of degree-rank distribution and frequency-degree distributions of the measured topology graphs are analyzed in detail. The small world characteristics for Gnutella network are discussed. The results indicate that each tier of Gnutella network shows individual characters, namely, the top level graph fits the power law in degree-rank distribution, but follows the Gaussian function in frequency-degree distribution. The bottom level graph shows power law both in its degreerank distribution and in its frequency-degree distribution. Fitting results indicate that power law could fit better for the degree-rank distribution and frequency-degree distribution of bottom level graphs, while Gaussian could describe the frequency-degree distribution of the top level graphs. Gnutella overlay network has the small world characters, but it is not a scale-free network, which has developed over time following a different set of growth processes from those of the BA (Barabási-Albert) model. The measured results show that Gnutella network has pretty well scalability as well as the abilities to tolerating failures and attacks against peers, but with low routing efficiencies.