Exploiting power-law node degree distribution in Chord overlays
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
A construction scheme for scale free DHT-based networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The effects of restrictions on number of connections in OSNs: a case-study on twitter
WOSN'10 Proceedings of the 3rd conference on Online social networks
Assessing the effects of a soft cut-off in the twitter social network
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Supporting filename partial matches in structured peer-to-peer overlay
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Effects of a soft cut-off on node-degree in the Twitter social network
Computer Communications
| Hi-index | 0.00 |
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. Topological characteristics have profound impact on the efficiency of search on such unstructured P2P networks as well as other networks. A key limitation of scalefree (power-law) topologies is the high load (i.e. high degree) on very few number of hub nodes. In a typical unstructured P2P network, peers are not willing to maintain high degrees/loads as they may not want to store large number of entries for construction of the overlay topology. So, to achieve fairness and practicality among all peers, hard cutoffs on the number of entries are imposed by the individual peers, which limits scale-freeness of the overall topology. Thus, it is expected that efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate construction of scale-free topologies with hard cutoffs and effect of these hard cutoffs on the search efficiency.