This paper studies the problem of updates in decentralised and self-organising P2P systems in which peers have low online probabilities and only local knowledge. The update strategy we propose for this environment is based on a hybrid push/pull rumor spreading algorithm and provides a fully decentralised, efficient and robust communication scheme which offers probabilistic guarantees rather than ensuring strict consistency. We describe a generic analytical model to investigate the utility of our hybrid update propagation scheme from the perspective of communication overhead.

region as well as ensure that the active nodes are connected are of the form p(n)r ,wherer(n) is the transmission radius of each node and p(n) is the probability that a node is "active" (not failed). This result indicates that, when n is large, even if each node is highly unreliable

to parental wishes set goals unrealistically high and subscribed significantly more to authoritarian values. Failure of the self-esteem condition to discriminate among the statuses was attributed to unreliability in self-esteem measurement.

the eciency and robustness of a population rate coding scheme in comparison to a place coding scheme using identical noise models. It turns out that the eciency of population rate coding is substantially worse than that of place coding even if the generation or propagation of spikes are highly unreliable

Abstract — The wireless sensor networks community, has now an increased understanding of the need for realistic link layer models. Recent experimental studies have shown that real deployments have a “transitional region ” with highly unreliable links, and that therefore the idealized perfect

of highly unreliable nanometer-scale devices.

. In general, our failure detectors can be unreliable, both by reporting a correct process to be faulty or by reporting a faulty process to be correct. However, we show that if these detectors satisfy certain plausible properties, then the well-known distributed consensus problem can be solved. We also present

This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service such as IP Multicasting. RMP is fully and symmetrically distributed so that no site bears an undue portion

In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [5, 10, 11]. This model includes two types of links: reliable, which always deliver messages, and unreliable, which sometimes fail to deliver messages. Real

. Controlling inflation—perhaps the most vital responsibility of the Federal Reserve—requires a high degree of foresight. Because policy actions to curb inflation typically take effect only after a long lag, the Federal Reserve needs to know in advance when inflation is likely to rise. Consequently