Sciweavers

176 search results - page 19 / 36
» Task distribution with a random overlay network
Sort
View
SPAA
2009
ACM
14 years 2 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 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
ISPAN
2005
IEEE
14 years 1 months ago
Supervised Peer-to-Peer Systems
In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed b...
Kishore Kothapalli, Christian Scheideler
MOBILITY
2009
ACM
14 years 2 months ago
A membership management protocol for mobile P2P networks
MANETs are self-organizing networks composed of mobile wireless nodes with often scarce resources. Distributed applications based on the P2P paradigm are by nature good candidates...
Mohamed Karim Sbai, Emna Salhi, Chadi Barakat
ICDCS
2007
IEEE
14 years 2 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta