Sciweavers

900 search results - page 5 / 180
» Design of a Robust Search Algorithm for P2P Networks
Sort
View
CN
2007
148views more  CN 2007»
13 years 7 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
EDBTW
2004
Springer
14 years 1 months ago
A Distributed Algorithm for Robust Data Sharing and Updates in P2P Database Networks
In this paper we thoroughly analyze a distributed procedure for the problem of local database update in a network of database peers, useful for data exchange scenarios. The algorit...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...
SIGIR
2004
ACM
14 years 1 months ago
Knowing Where to Search: Personalized Search Strategies for Peers in P2P Networks
Optimizing and focusing search and results ranking in P2P networks becomes more and more important with the increasing size of these networks. Even though a few approaches have al...
Paul-Alexandru Chirita, Wolfgang Nejdl, Oana Scurt...
ICC
2009
IEEE
155views Communications» more  ICC 2009»
14 years 2 months ago
Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information
—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 algori...
Jing Xie, King-Shan Lui
CONEXT
2010
ACM
13 years 5 months ago
Balancing throughput, robustness, and in-order delivery in P2P VoD
Peer-to-peer has emerged in recent years as a promising approach to providing Video-on-Demand streaming. The design space, however, is vast and still not well understood--yet choo...
Bin Fan, David G. Andersen, Michael Kaminsky, Kons...