Sciweavers

580 search results - page 44 / 116
» Choosing a random peer
Sort
View
INFOCOM
2009
IEEE
16 years 3 days ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
IPPS
2006
IEEE
15 years 11 months ago
Shubac: a searchable P2P network utilizing dynamic paths for client/server anonymity
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
A. Brodie, Cheng-Zhong Xu, Weisong Shi
INFOCOM
2011
IEEE
14 years 9 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
USITS
2003
15 years 6 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
ISIPTA
2003
IEEE
147views Mathematics» more  ISIPTA 2003»
15 years 10 months ago
Reducing Uncertainty by Imprecise Judgements on Probability Distributions: Application to System Reliability
In this paper the judgement consisting in choosing a function that is believed to dominate the true probability distribution of a continuous random variable is explored. This kind...
Igor Kozine, V. Krymsky