CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer-to-Peer Networks
Hongyan Mei,
Yujie Zhang and
Xiangwu Meng
Mathematical Problems in Engineering, 2014, vol. 2014, 1-20
Abstract:
Efficient searching for resources has become a challenging task with less network bandwidth consumption in unstructured peer-to-peer (P2P) networks. Heuristic search mechanism is an effective method which depends on the previous searches to guide future ones. In the proposed methods, searching for high-repetition resources is more effective. However, the performances of the searches for nonrepetition or low-repetition or rare resources need to be improved. As for this problem, considering the similarity between social networks and unstructured P2P networks, we present a credibility search algorithm based on different queries according to the trust production principle in sociology and psychology. In this method, queries are divided into familiar queries and unfamiliar queries. For different queries, we adopt different ways to get the credibility of node to its each neighbor. And then queries should be forwarded by the neighbor nodes with higher credibility. Experimental results show that our method can improve query hit rate and reduce search delay with low bandwidth consumption in three different network topologies under static and dynamic network environments.
Date: 2014
References: Add references at CitEc
Citations:
Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/197878.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/197878.xml (text/xml)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:197878
DOI: 10.1155/2014/197878
Access Statistics for this article
More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().