Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems

Abstract. Epidemic protocols have demonstrated remarkable scalability and robustness in disseminating information on internet-scale, dynamic P2P systems. However, popular instances of such protocols suffer from a number of significant drawbacks, such as increased message overhead in push-based systems, or low dissemination speed in pull-based ones. In this paper we study push-based epidemic dissemination algorithms, in terms of hit ratio, communication overhead, dissemination speed, and resilience to failures and node churn. We devise a hybrid push-based dissemination algorithm, combining probabilistic with deterministic properties, which limits message overhead to an order of magnitude lower than that of the purely probabilistic dissemination model, while retaining strong probabilistic guarantees for complete dissemination of messages. Our extensive experimentation shows that our proposed algorithm outperforms that model both in static and dynamic network scenarios, as well as in the face of large-scale catastrophic failures. Moreover, the proposed algorithm distributes the dissemination load uniformly on all participating nodes. Keywords: Epidemic/Gossip protocols, Information Dissemination, Peer-to-Peer

Scalable and accurate causality tracking for eventually consistent stores

Lecture Notes in Computer Science 8460, 2014In cloud computing environments, data storage systems often rely on optimistic replication to provide good performance and availability even in the presence of failures or network partitions. In this scenario, it is important to be able to accurately and efficiently identify updates executed concurrently. Current approaches to causality tracking in optimistic replication have problems with concurrent updates: they either (1) do not scale, as they require replicas to maintain information that grows linearly with the number of writes or unique clients; (2) lose information about causality, either by removing entries from client-id based version vectors or using server-id based version vectors, which cause false conflicts. We propose a new logical clock mechanism and a logical clock framework that together support a traditional key-value store API, while capturing causality in an accurate and scalable way, avoiding false conflicts. It maintains concise information per data replica, only linear on the number of replica servers, and allows data replicas to be compared and merged linear with the number of replica servers and versions.(undefined

Autonomous Gossiping: A self-organizing epidemic algorithm for selective information dissemination in mobile ad-hoc networks

We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc networking (MANET) environment because it does not require any infrastructure or middleware like multicast tree and (un)subscription maintenance for publish/subscribe, but uses ecological and economic principles in a self-organizing manner in order to achieve its selectivity. The trade-off of using an infrastructure-less self-organizing mechanism like A/G is that it does not guarantee completeness deterministically as is one of the original objectives of alternate selective dissemination schemes like publish/subscribe. We argue that such incompleteness is not a problem in many non-critical real-life civilian application scenarios and realistic node mobility patterns, where the overhead of infrastructure maintenance may outweigh the benefits of completeness, more over, at present there exists no mechanism to realize publish/subscribe or other paradigms for selective dissemination in MANET environments. A/G's reliance and hence vulnerability on cooperation of mobile nodes is also much less as compared to other possible schemes using routing information, since it does not expect node philanthropy for forwarding/carrying information, but only cooperation to the extent that nodes already carrying the information pass it on to other suitable ones. Thus autonomous gossiping is expected to be a light-weight infrastructure-less information dissemination service for MANETs, and hence support any-to-many communication (flexible casting) without the need to establish and maintain separate routing information (e.g., multicast trees)

Solving atomic multicast when groups crash

In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non-empty and disjoint groups of processes. Multicast messages may be addressed to any subset of groups, each message possibly being multicast to a different subset. Several papers previously studied this problem either in local area networks [3, 9, 20] or wide area networks [13, 21]. However, none of them considered atomic multicast when groups may crash. We present two atomic multicast algorithms that tolerate the crash of groups. The first algorithm tolerates an arbitrary number of failures, is genuine (i.e., to deliver a message m, only addressees of m are involved in the protocol), and uses the perfect failures detector P. We show that among realistic failure detectors, i.e., those that do not predict the future, P is necessary to solve genuine atomic multicast if we do not bound the number of processes that may fail. Thus, P is the weakest realistic failure detector for solving genuine atomic multicast when an arbitrary number of processes may crash. Our second algorithm is non-genuine and less resilient to process failures than the first algorithm but has several advantages: (i) it requires perfect failure detection within groups only, and not across the system, (ii) as we show in the paper it can be modified to rely on unreliable failure detection at the cost of a weaker liveness guarantee, and (iii) it is fast, messages addressed to multiple groups may be delivered within two inter-group message delays only

Combination of searches for Higgs boson pairs in pp collisions at \sqrts = 13 TeV with the ATLAS detector

This letter presents a combination of searches for Higgs boson pair production using up to 36.1 fb(-1) of proton-proton collision data at a centre-of-mass energy root s = 13 TeV recorded with the ATLAS detector at the LHC. The combination is performed using six analyses searching for Higgs boson pairs decaying into the b (b) over barb (b) over bar, b (b) over barW(+)W(-), b (b) over bar tau(+)tau(-), W+W-W+W-, b (b) over bar gamma gamma and W+W-gamma gamma final states. Results are presented for non-resonant and resonant Higgs boson pair production modes. No statistically significant excess in data above the Standard Model predictions is found. The combined observed (expected) limit at 95% confidence level on the non-resonant Higgs boson pair production cross-section is 6.9 (10) times the predicted Standard Model cross-section. Limits are also set on the ratio (kappa(lambda)) of the Higgs boson self-coupling to its Standard Model value. This ratio is constrained at 95% confidence level in observation (expectation) to -5.0 &lt; kappa(lambda) &lt; 12.0 (-5.8 &lt; kappa(lambda) &lt; 12.0). In addition, limits are set on the production of narrow scalar resonances and spin-2 Kaluza-Klein Randall-Sundrum gravitons. Exclusion regions are also provided in the parameter space of the habemus Minimal Supersymmetric Standard Model and the Electroweak Singlet Model. For complete list of authors see http://dx.doi.org/10.1016/j.physletb.2019.135103</p

Searches for lepton-flavour-violating decays of the Higgs boson in s=13\sqrt{s}=13 TeV pp\mathit{pp} collisions with the ATLAS detector

This Letter presents direct searches for lepton flavour violation in Higgs boson decays, H → eτ and H → μτ , performed with the ATLAS detector at the LHC. The searches are based on a data sample of proton–proton collisions at a centre-of-mass energy √s = 13 TeV, corresponding to an integrated luminosity of 36.1 fb−1. No significant excess is observed above the expected background from Standard Model processes. The observed (median expected) 95% confidence-level upper limits on the leptonflavour-violating branching ratios are 0.47% (0.34+0.13−0.10%) and 0.28% (0.37+0.14−0.10%) for H → eτ and H → μτ , respectively.publishedVersio