On Degree-Based Decentralized Search in Complex Networks
Shi Xiao, Gaoxi Xiao
Abstract
Decentralized search aims to find the target node in a large network by using only local information. The applications of it include peer-to-peer file sharing, web search and anything else that requires locating a specific target in a complex system. In this paper, we examine the degree-based decentralized search method. Specifically, we evaluate the efficiency of the method in different cases with different amounts of available local information. In addition, we propose a simple refinement algorithm for significantly shortening the length of the route that has been found. Some insights useful for the future developments of efficient decentralized search schemes have been achieved.
Create a lesson
Related papers
FoldPipe: Bounded Remote Streaming of Native Molecular Shards with Asynchronous Prefetch
Dhiren Mukesh Khatri
TOPIQ: Statistical Error Propagation for Quantity-of-Interest Prediction under Lossy Compression
Youyuan Liu, Bo Jiang, Taolue Yang et al.
Launch-Bound and Substitutable: Why Three Inference Optimizations Fail to Pay Off in Mixture-of-Experts Models
Gokulakannan Sakthivel, Jerry Wu, Amogh Rajendra et al.
Direct-Operable SIMD Bit-Slicing: A Framework for Memory-Efficient Predicate Evaluation
Arunkumar Mathiyazhagan
When Structure is Silent: Opportunities for Algorithmic Dispatch in Linear Algebra
Emmanuel Lujan, Alan Edelman
Portable to Efficient: Auto-Tuning Hardware-Agnostic GPU Kernels in Julia
Floris-Jan Willemsen, Evelyne Ringoot, Alan Edelman