Sciweavers

580 search results - page 21 / 116
» Choosing a random peer
Sort
View
GCC
2003
Springer
15 years 5 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
ICDCS
2002
IEEE
15 years 4 months ago
Routing Indices For Peer-to-Peer Systems
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...
Arturo Crespo, Hector Garcia-Molina
98
Voted
WWW
2003
ACM
16 years 13 days ago
The Eigentrust algorithm for reputation management in P2P networks
Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience shows, the anonymous, o...
Sepandar D. Kamvar, Mario T. Schlosser, Hector Gar...
SPAA
2005
ACM
15 years 5 months ago
Decentralized algorithms using both local and random probes for P2P load balancing
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
Krishnaram Kenthapadi, Gurmeet Singh Manku
SAC
2009
ACM
15 years 6 months ago
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
Gian Paolo Jesi, Edoardo Mollona, Srijith K. Nair,...