Sciweavers

580 search results - page 25 / 116
» Choosing a random peer
Sort
View
PCI
2005
Springer
15 years 11 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris
160
Voted
IEEEAMS
2003
IEEE
15 years 10 months ago
Rich and Scalable Peer-to-Peer Search with SHARK
SHARK is a novel concept and middleware service for search in peer-to-peer (P2P) networks. Rather than flooding a network like Gnutella or imposing numerical IDs on objects like d...
Jan Mischke, Burkhard Stiller
CN
2007
148views more  CN 2007»
15 years 5 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
CIKM
2009
Springer
16 years 3 days ago
Self-organizing peer-to-peer networks for collaborative document tracking
Given a set of peers with overlapping interests where each peer wishes to keep track of new documents that are relevant to their interests, we propose a self-organizing peerto-pee...
Hathai Tanta-ngai, Evangelos E. Milios, Vlado Kese...
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 5 months ago
Our Brothers' Keepers: Secure Routing with High Performance
The Trinity [1] spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of proc...
Alex Brodsky, Scott Lindenberg