Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICC
2009
IEEE

favoriteEmaildiscussreport

155views Communications» more ICC 2009»

Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information

13 years 11 months ago

Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information

Download www.eee.hku.hk

—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algorithms on the Internet. In this paper, we model the random walk algorithm in peer-to-peer networks when social information is available. We deﬁne the social relationship between two nodes as the knowledge about the resources the other node possesses. We mathematically show that the social information can beneﬁt the searching by extending the existing random walk search model.

Jing Xie, King-Shan Lui

Real-time Traffic

Communications | ICC 2009 | Peer-to-peer Networks | Random Walk | Social |

claim paper

Related Content

» Optimizing random walk search algorithms in P2P networks

» Analysis models for unguided search in unstructured P2P networks

» BudgetBased SelfOptimized Incentive Search in Unstructured P2P Networks

» Spinneret A Log Random Substrate for P2P Networks

» Storage load balancing via local interactions among peers in unstructured P2P networks

» On Node Isolation Under Churn in Unstructured P2P Networks with HeavyTailed Lifetimes

» Uniform Sampling for Directed P2P Networks

» Unstructured PeertoPeer Networks Topological Properties and Search Performance

» Assisted peertopeer search with partial indexing

Post Info
More Details (n/a)

Added	21 May 2010
Updated	21 May 2010
Type	Conference
Year	2009
Where	ICC
Authors	Jing Xie, King-Shan Lui

Comments (0)