ZRR-P2P: Zone-Based Mechanism for Data Replication and Research Optimization in Unstructured P2P Systems

Peer-to-peer systems (P2P) have enjoyed great popularity in terms of sharing content in distributed environments. In mobile P2P networks, how to improve the efficiency of the resource lookup has been an important topic of research. Among the existing solutions, we find lookup mechanisms based on data replication that can increase data availability and reduce search latency. On the other side, these solutions have certain limits such as in the selection of resources to be replicated and in increasing the storage space of peers with additional data. Therefore, this work ZRR-P2P (Zone-based mechanism for data Replication and Research optimization in P2P) comes with the aim of partitioning the network zone on sub-zones and of replicating popular data shared in the network. Thus, in order to improve the research process without increasing storage space of peers. The simulation results show that our strategy manages to increase data availability and improve the search process in terms of hops count and search latency, while avoiding increasing the storage space of peers.

A Novel Data Consistence Model Based on Virtual Peers in Peer-to-Peer Systems

In recent years, peer-to-peer (P2P) systems have become a promising paradigm to provide efficient storage service in distributed environments. Although its effectiveness has been proven in many areas, the data consistency problem in P2P systems are still an opening issue. This article proposes a novel data consistence model, virtual peers-based data consistency (VPDC), which introduces a set of virtual peers to provide guaranteed data consistency in decentralized and unstructured P2P systems. The VPDC model can be easily implemented in any P2P system without introducing any interference to data retrieval. Theoretical analysis on VPDC is presented to analyze its effectiveness and efficiency, and massive experiments are conducted to evaluate the performance of a VPDC model in a real-world P2P system. The results indicate that it can significantly improve the data consistence of P2P systems and outperform many similar approaches in various experimental settings.

Search Unstructured Data Performance in P2P Networks Based on User Interest Model

Distributed (P2P) systems build up approximately coupled application-level overlays on high of the web to encourage affordable sharing of assets. They'll be generally delegated either organized or unstructured systems. while not requesting requirements over the topology, unstructured P2P systems is made appallingly speedily and ar so contemplated fitting to the web air. Be that as it may, the arbitrary pursuit strategies received by these systems now and then perform ineffectively with a larger than usual system Size. during this paper, we tend to search for to help the pursuit execution in unstructured P2P arranges through misusing clients' basic intrigue designs caught among a likelihood theoretic structure named the client intrigue model (UIM). an exploration convention and a directing table change convention ar increasingly arranged in order to speed up the hunt technique through self sorting out the P2P organize into somewhat world. Each hypothetical and test examination are Conducted and incontestable the viability and strength of our methodology.