Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks

TL;DR

This paper explores how imposing hard degree cutoffs on scale-free topologies in unstructured P2P networks affects search efficiency, finding that smaller cutoffs can improve search performance despite limiting hub formation.

Contribution

It introduces a method for constructing scale-free topologies with hard cutoffs and analyzes their impact on search efficiency in P2P networks.

Findings

Search efficiency improves with smaller hard cutoffs.

Normalized flooding and random walk searches are more effective with limited hubs.

Hard cutoffs can balance fairness and performance in P2P overlays.

Abstract

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. It has been well-known that search on small-world topologies of N nodes can be as efficient as O(ln N), while scale-free (power-law) topologies offer even better search efficiencies like as good as O(lnln N) for a range of degree distribution exponents. However, generation and maintenance of such scale-free topologies are hard to realize in a distributed and potentially uncooperative environments as in the P2P networks. A key limitation of scale-free 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, efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate construction of scale-free topologies with hard cutoffs (i.e. there are not any major hubs) and effect of these hard cutoffs on the search efficiency. Interestingly, we observe that the efficiency of normalized flooding and random walk search algorithms increases as the hard cutoff decreases.