A Search Algorithm Based on K-Weighted Search Tree

Yuan, Lianhai and Li, Xiangwen and Zhou, Lin (2017) A Search Algorithm Based on K-Weighted Search Tree. EAI Endorsed Transactions on Internet of Things, 3 (10): 4. ISSN 2414-1399

[thumbnail of eai.15-1-2018.154108.pdf]
eai.15-1-2018.154108.pdf - Published Version

Download (1MB) | Preview


Aiming at the issue of low efficiency in Peer-to-Peer (P2P) network system, a search algorithm based on K-weighted search tree is proposed. The k-weighted search tree serving the search is constructed. The nodes are ranked from top to bottom in the tree according to the query hit rate, and the nodes with large hit rate and stable are on the tree layer, the search can thus determine the direction of the message diffusion. By caching the upper node, establishment of search results, using node index, overheated resource replication and add remote neighbours for leaf node, and other methods to improve search efficiency and balance load. The analysis and simulation results show that the proposed algorithm can greatly reduce the invalid message with higher search efficiency, and maintenance of the search tree is less expensive.

Item Type: Article
Uncontrolled Keywords: Searching algorithm, k-weighted search tree, Peer-to-Peer.
Subjects: Q Science > QA Mathematics > QA76 Computer software
Depositing User: EAI Editor III.
Date Deposited: 22 Sep 2020 13:45
Last Modified: 22 Sep 2020 13:45
URI: https://eprints.eudl.eu/id/eprint/538

Actions (login required)

View Item
View Item