Consensus encalpsulates the inherent problems of building fault tolerant distributed systems. In this context, the classic model of Byzantine faulty processes can be restated such that messages from a subset of processes can be arbitrarily corrupted (including addition and omission of messages).We consider the case of dynamic and transient faults, that may affect all processes and that are not permanent, and we model them via corrupted communication. For corrupted communication it is natural to distinguish between the safety of communication, which is concerned with the number of altered messages, and the liveness of communication, which restricts message loss.We present two consensus algorithms, together with sufficient conditions on the system to ensure correctness. Our first algorithm needs strong conditions on safety but requires weak conditions on liveness in order to terminate. Our second algorithm tolerates a lower degree of communication safety at the price of stronger liveness conditions.Our algorithms allow us to circumvent the resilience lower bounds from Santoro/Widmayer and Martin/Alvisi.

Motivated by the desire to understand complex transient behaviour in fluid flows, we study the dynamics of an air bubble driven by the steady motion of a suspending viscous fluid within a Hele-Shaw channel with a centred depth perturbation. Using both experiments and numerical simulations of a depth-averaged model, we investigate the evolution of an initially centred bubble of prescribed volume as a function of flow rate and initial shape. The experiments exhibit a rich variety of organised transient dynamics, involving bubble break up as well as aggregation and coalescence of interacting neighbouring bubbles. The long-term outcome is either a single bubble or multiple separating bubbles, positioned along the channel in order of increasing velocity. Up to moderate flow rates, the life and fate of the bubble are reproducible and can be categorised by a small number of characteristic behaviours that occur in simply-connected regions of the parameter plane. Increasing the flow rate leads to less reproducible time evolutions with increasing sensitivity to initial conditions and perturbations in the channel. Timedependent numerical simulations that allow for break up and coalescence are found to reproduce most of the dynamical behaviour observed experimentally including enhanced sensitivity at high flow rate. An unusual feature of this system is that the set of steady and periodic solutions can change during temporal evolution because both the number of bubbles and their size distribution evolve due to break up and coalescence events. Calculation of stable and unstable solutions in the single-and two-bubble cases reveals that the transient dynamics are orchestrated by weakly-unstable solutions of the system termed edge states that can appear and disappear as the number of bubbles changes. † Email address for correspondence: anne.juel@manchester.ac.uk arXiv:2005.13959v1 [physics.flu-dyn] 28 May 2020

Full Reversal and Partial Reversal are two well-known routing algorithms that were introduced by Gafni and Bertsekas [IEEE Trans. Commun., 29 (1981), pp. 11-18]. By reversing the directions of some links of the graph, these algorithms transform a connected input DAG (directed acyclic graph) into an output DAG in which each node has at least one path to a distinguished destination node. We present a generalization of these algorithms, called the link reversal (LR) algorithm, based on a novel formalization that assigns binary labels to the links of the input DAG. We characterize the legal link labelings for which LR is guaranteed to establish routes. Moreover, we give an exact expression for the number of steps-called work complexity-taken by each node in every execution of LR from any legal input graph. Exact expressions for the per-node work complexity of Full Reversal and Partial Reversal follow from our general formula; this is the first exact expression known for Partial Reversal. Our binary link labels formalism facilitates comparison of the work complexity of certain link labelings-including those corresponding to Full Reversal and Partial Reversal-using game theory. We consider labelings in which all incoming links of a given node i are labeled with the same binary value μ i. Finding initial labelings that induce good work complexity can be considered as a game in which to each node i a player is associated who has strategy μ i. In this game, one tries to minimize the cost, i.e., the number of steps. Modeling the initial labelings as this game allows us to compare the work complexity of Full Reversal and Partial Reversal in a way that provides a rigorous basis for the intuition that Partial Reversal is better than Full Reversal with respect to work complexity.

Abstract

We experimentally investigate the extensional flow of a sheet – or curtain – of viscoelastic liquid falling freely from a slot at constant flow rate under gravity. Extruded liquids are aqueous solutions of flexible polyethylene oxide (PEO) and of semi-rigid partially hydrolysed polyacrylamide (HPAM) with low shear viscosities. Velocimetry measurements reveal that the mean velocity field $U(z)$ (where $z$ is the distance from the slot exit) does not reduce to a free fall. More precisely, we show that the liquid falls initially with sub-gravitational accelerations up to a distance from the slot which scales as $g\unicode[STIX]{x1D70F}_{fil}^{2}$ (where $g$ is gravity and $\unicode[STIX]{x1D70F}_{fil}$ is the extensional relaxation time of the liquid) due to the stretching of polymer molecules. Beyond this elastic length, inertia dominates and the local acceleration reaches the asymptotic free-fall value $g$ . The length of the sub-gravitational part of the curtain is shown to be much larger than the equivalent viscous length $((4\unicode[STIX]{x1D702}/\unicode[STIX]{x1D70C})^{2}/g)^{1/3}$ for Newtonian liquids of density $\unicode[STIX]{x1D70C}$ and dynamic viscosity $\unicode[STIX]{x1D702}$ which is usually small compared to the curtain length. By analogy with Newtonian curtains, we show that the velocity field $U(z)$ rescales on a master curve. Besides, the flow is shown to be only weakly affected by the history of polymer deformations in the die upstream of the curtain. Furthermore, investigations on the curtain stability reveal that polymer addition reduces the minimum flow rate required to maintain a continuous sheet of liquid.