Sciweavers

10 search results - page 2 / 2
» Finding Good Peers in Peer-to-Peer Networks
Sort
View
GLOBECOM
2006
IEEE
13 years 11 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
DAIS
2006
13 years 6 months ago
On the Value of Random Opinions in Decentralized Recommendation
Abstract. As the amount of information available to users continues to grow, filtering wanted items from unwanted ones becomes a dominant task. To this end, various collaborative-f...
Elth Ogston, Arno Bakker, Maarten van Steen
ACMICEC
2008
ACM
191views ECommerce» more  ACMICEC 2008»
13 years 6 months ago
Why share in peer-to-peer networks?
Prior theory and empirical work emphasize the enormous free-riding problem facing peer-to-peer (P2P) sharing networks. Nonetheless, many P2P networks thrive. We explore two possib...
Lian Jian, Jeffrey K. MacKie-Mason
JSA
2008
136views more  JSA 2008»
13 years 4 months ago
Evaluation and optimization of a peer-to-peer video-on-demand system
Video-on-demand (VoD) is increasingly popular with internet users. However, VoD is costly due to the load placed on video servers. Peer-to-peer (P2P) techniques are an approach to...
Bin Cheng, Xiuzheng Liu, Zheng Zhang, Hai Jin, Lex...
HPCA
1998
IEEE
13 years 9 months ago
Address Translation Mechanisms In Network Interfaces
Good network hardware performance is often squandered by overheads for accessing the network interface (NI) within a host. NIs that support user-level messaging avoid frequent ope...
Ioannis Schoinas, Mark D. Hill