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

Cherbal, Sarra; Barouchi, Imen

doi:10.18280/isi.260103

Cited by 3 publications

(1 citation statement)

References 31 publications

(57 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some replication methods are considered static, but sophisticated applications in peer-to-peer systems require more advanced abilities to identify conflicts in updates. Optimistic replication, which allows for asynchronous version updates, enables applications to function seamlessly even in the presence of disconnected or problematic nodes [3,4]. Furthermore, the advancements in distributed technologies, especially peer-to-peer systems, have propelled collaborative applications to new heights.…”

Section: Introductionmentioning

confidence: 99%

Cost-Effective Resources for Computing Approximation Queries in Mobile Cloud Computing Infrastructure

Sangaiah,

Javadpour,

Pinto

et al. 2023

Sensors

View full text Add to dashboard Cite

Answering a query through a peer-to-peer database presents one of the greatest challenges due to the high cost and time required to obtain a comprehensive response. Consequently, these systems were primarily designed to handle approximation queries. In our research, the primary objective was to develop an intelligent system capable of responding to approximate set-value inquiries. This paper explores the use of particle optimization to enhance the system’s intelligence. In contrast to previous studies, our proposed method avoids the use of sampling. Despite the utilization of the best sampling methods, there remains a possibility of error, making it difficult to guarantee accuracy. Nonetheless, achieving a certain degree of accuracy is crucial in handling approximate queries. Various factors influence the accuracy of sampling procedures. The results of our studies indicate that the suggested method has demonstrated improvements in terms of the number of queries issued, the number of peers examined, and its execution time, which is significantly faster than the flood approach. Answering queries poses one of the most arduous challenges in peer-to-peer databases, as obtaining a complete answer is both costly and time-consuming. Consequently, approximation queries have been adopted as a solution in these systems. Our research evaluated several methods, including flood algorithms, parallel diffusion algorithms, and ISM algorithms. When it comes to query transmission, the proposed method exhibits superior cost-effectiveness and execution times.

show abstract

Section: Introductionmentioning

confidence: 99%