Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
976669 | Physica A: Statistical Mechanics and its Applications | 2007 | 7 Pages |
Abstract
We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2%2% of traffic compared with the most popular flooding-based query-packet-forwarding (FB) algorithm. We find that the average searching time, 〈T〉〈T〉, of the our model is more scalable than another well known n -random walker model and comparable to the FB algorithm both on real Gnutella network and scale-free networks with γ=2.4γ=2.4. We also discuss the possible relationship between 〈T〉〈T〉 and 〈k2〉〈k2〉, the second moment of the degree distribution of the networks.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Sungmin Lee, Soon-Hyung Yook, Yup Kim,