Name
Abstract | ||
|---|---|---|
The big challenge of constructing P2P applications is how to implement efficient distributed file searching in complex environment which implies huge-amount users and uncontrollable nodes. FriendSearch is introduced to improve the efficiency and scalability of distributed file searching. FriendSearch introduces a new hybrid architecture in which the storage and search of raw file is based on DHT network, but the storage and search of meta-data is based on unstructured P2P network. FriendSearch learns interest similarity between participating nodes and uses it to construct friend relations. The forwarding of queries is limited to friend nodes with similar interests. Simulation tests show that FriendSearch algorithm is both efficient and scalable. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11557654_32 | HPCC |
Keywords | Field | DocType |
complex environment,p2p network,p2p application,dht network,raw file,friendsearch algorithm,friend node,huge-amount user,big challenge,search method,friend relation,p2p | Similitude,Architecture,Database query,Search algorithm,Peer-to-peer,Computer science,Theoretical computer science,Scalability,Distributed computing | Conference |
Volume | ISSN | ISBN |
3726 | 0302-9743 | 3-540-29031-1 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haitao Chen | 1 | 95 | 5.39 |
| Zhenghu Gong | 2 | 0 | 0.34 |
| Zunguo Huang | 3 | 14 | 4.52 |