148 search results - page 4 / 30 » Optimizing random walk search algorithms in P2P networks |
EPEW
2008
Springer
13 years 10 months ago
2008
Springer
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
HSNMC
2004
Springer
14 years 1 months ago
2004
Springer
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
LCN
2006
IEEE
14 years 2 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...