Ad-hoc behavior of peers is one of the most important characteristics of any peer-to-peer (P2P) network that affects the scalability, stability, reachability, and search efficiency of the network [17]. These ad-hoc peers cause churn by untimely leaving and joining the network. It is important for a P2P network to sustain against these churns. Preserving the above mentioned characteristics becomes more difficult in a distributed and potentially uncooperative network environment. In this thesis, we propose a model for unstructured P2P networks which defines protocols for joining and rewiring process for a peer. Our model uses only local information for a peer for joining and rewiring, without needing to store the global state information [17]. We impose a hard cutoff on the network which limits the number of links a peer can have. This makes sure that there are no super hubs in the network and the load is distributed evenly among peers. We also investigate the effects of such hard cutoffs on degree distribution and search efficiency of the network [17].
展开▼
