Name
Abstract | ||
|---|---|---|
Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and recently proposed unstructured P2P networks intend to organize the participating peers in a small-world (SW) fashion by exploiting the knowledge of contents stored in peers. As existing algorithms for constructing SW-based unstructured P2P networks may not precisely reveal the object sharing patterns, the resultant networks thus may not perform searches efficiently and effectively by exploiting the common interests among peers. In this paper, we suggest a novel P2P network formation algorithm to construct SW-based unstructured networks. We validate our proposal in simulations with an empirical data set, and the simulation results prove that our proposal greatly outperforms existing algorithms in terms of search efficiency and effectiveness. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICPADS.2010.37 | ICPADS |
Keywords | Field | DocType |
peer-to-peer systems,file-sharing network,small-world social relationship awareness,object sharing patterns,small-world fashion,flooding query messages,query message,social aspects of automation,mass market,unstructured peer-to-peer networks,empirical measurement study,unstructured p2p networks,social relations,unstructured overlay networks,common interest,p2p network,novel p2p network formation,p2p network formation algorithm,unstructured network,message passing,peer-to-peer computing,unstructured peer-to-peer,p2p file-sharing networks,empirical data,sw-based unstructured networks,query processing,file sharing,overlay network,p2p,measurement,simulation,social relation | Network formation,Social relationship,Peer-to-peer,Computer science,Peer to peer computing,Object sharing,Empirical measure,Message passing,Distributed computing,Mass market | Conference |
ISSN | ISBN | Citations |
1521-9097 E-ISBN : 978-0-7695-4307-9 | 978-0-7695-4307-9 | 2 |
PageRank | References | Authors |
0.44 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Liao | 1 | 51 | 5.37 |
| Kuo-Chan Huang | 2 | 184 | 22.95 |
| Hung-Chang Hsiao | 3 | 256 | 32.34 |