Sciweavers

353 search results - page 2 / 71
» Dynamic search in peer-to-peer networks
Sort
View
CCGRID
2003
IEEE
14 years 26 days ago
DKS (N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications
In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network ...
Luc Onana Alima, Sameh El-Ansary, Per Brand, Seif ...
EURONGI
2008
Springer
13 years 9 months ago
Efficiency of Search Methods in Dynamic Wireless Networks
Gerhard Haßlinger, Thomas Kunz
WWW
2004
ACM
14 years 8 months ago
Dynamic search in peer-to-peer networks
This work* specifically addresses the search issues in unstructured peer-to-peer (P2P) systems that involve the design of an efficient search algorithm, the proposed dynamic searc...
Hsinping Wang, Tsungnan Lin, Chia Hung Chen, Yenna...
GLOBECOM
2006
IEEE
14 years 1 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang