| Popis: |
The term “Peer-to-Peer” (P2P) refers to a computer network model whose elements (nodes or “peers”) are both clients and servers during exchanges. With the evolution of P2P, users express the need of exchanging resources in the shortest possible time, which encouraged the development and optimization of many of resource (data) search mechanisms in order to offer a good quality of research. In this field, we find lookup mechanisms based on data popularity. However, the routing of P2P requests and the methods used for estimating popularity of shared files can generate communication redundancy and unnecessary network traffic. Therefore, the objective of this work is to develop a P2P lookup mechanism that estimates popularity of shared data and uses it in order to increase the search success rate and reduce the lookup path without generating excessive traffic or increasing the storage spaces. The implementation results show the effect of the proposed approach in reducing the lookup path and the nodes storage space. |
