A Search Algorithm Based on K-Weighted Search Tree
Journal Title: EAI Endorsed Transactions on Internet of Things - Year 2017, Vol 3, Issue 10
Abstract
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.
Authors and Affiliations
Lianhai Yuan, Xiangwen Li, Lin Zhou
Keywords
Related Articles
- EP ID EP46500
- DOI http://dx.doi.org/10.4108/eai.15-1-2018.154108
- Views 285
- Downloads 0
End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations
A fundamental contribution of network calculus is the convolution-form representation of networks which enables tight end-to-end delay bounds. Recently, this has been extended to the case where the data flow is subject t...
Device-to-Device Communications for 5G Internet of Things
The proliferation of heterogeneous devices connected through large-scale networks is a clear sign that the vision of the Internet of Things (IoT) is getting closer to becoming a reality. Many researchers and experts in t...
Cooperative Awareness in the Internet of Vehicles for Safety Enhancement
Connected vehicles will improve safety and enable new services to drivers and passengers. One of the main enabled services will be the cooperative awareness, that is the broadcast transmission of periodic messages contai...
IoT-F2CDM-LB: IoT Based Fog-to-Cloud and Data-in-Motion Architectures with Load Balancing
The work in this paper tries to enhance the performance of IoT by modifying the Cloud based architecture in terms of storage, processing, and Load Balancing (LB). The assumption is as follows: In a single Fog server, hig...
The M/G/1 queueing model with preemptive random priorities
For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the...