HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths

In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.Comment: This is a long version of a paper published by IEEE in the Proceedings of the 14-th IEEE International Conference on Peer-to-Peer Computin

Self-Stabilizing Supervised Publish-Subscribe Systems

In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system

Self-Stabilization in the Distributed Systems of Finite State Machines

The notion of self-stabilization was first proposed by Dijkstra in 1974 in his classic paper. The paper defines a system as self-stabilizing if, starting at any, possibly illegitimate, state the system can automatically adjust itself to eventually converge to a legitimate state in finite amount of time and once in a legitimate state it will remain so unless it incurs a subsequent transient fault. Dijkstra limited his attention to a ring of finite-state machines and provided its solution for self-stabilization. In the years following his introduction, very few papers were published in this area. Once his proposal was recognized as a milestone in work on fault tolerance, the notion propagated among the researchers rapidly and many researchers in the distributed systems diverted their attention to it. The investigation and use of self-stabilization as an approach to fault-tolerant behavior under a model of transient failures for distributed systems is now undergoing a renaissance. A good number of works pertaining to self-stabilization in the distributed systems were proposed in the yesteryears most of which are very recent. This report surveys all previous works available in the literature of self-stabilizing systems

The Thermonuclear Explosion Of Chandrasekhar Mass White Dwarfs

The flame born in the deep interior of a white dwarf that becomes a Type Ia supernova is subject to several instabilities. We briefly review these instabilities and the corresponding flame acceleration. We discuss the conditions necessary for each of the currently proposed explosion mechanisms and the attendant uncertainties. A grid of critical masses for detonation in the range $10^7$ - $2 \times 10^9$ g cm$^{-3}$ is calculated and its sensitivity to composition explored. Prompt detonations are physically improbable and appear unlikely on observational grounds. Simple deflagrations require some means of boosting the flame speed beyond what currently exists in the literature. ``Active turbulent combustion'' and multi-point ignition are presented as two plausible ways of doing this. A deflagration that moves at the ``Sharp-Wheeler'' speed, $0.1 g_{\rm eff} t$, is calculated in one dimension and shows that a healthy explosion is possible in a simple deflagration if the front moves with the speed of the fastest floating bubbles. The relevance of the transition to the ``distributed burning regime'' is discussed for delayed detonations. No model emerges without difficulties, but detonation in the distributed regime is plausible, will produce intermediate mass elements, and warrants further study.Comment: 28 pages, 4 figures included, uses aaspp4.sty. Submitted to Ap

Synchronous Counting and Computational Algorithm Design

Consider a complete communication network on $n$ nodes, each of which is a state machine. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses are "odd" and which are "even". We require that the solution is self-stabilising (reaching the correct operation from any initial state) and it tolerates $f$ Byzantine failures (nodes that send arbitrary misinformation). Prior algorithms are expensive to implement in hardware: they require a source of random bits or a large number of states. This work consists of two parts. In the first part, we use computational techniques (often known as synthesis) to construct very compact deterministic algorithms for the first non-trivial case of $f = 1$. While no algorithm exists for $n < 4$, we show that as few as 3 states per node are sufficient for all values $n \ge 4$. Moreover, the problem cannot be solved with only 2 states per node for $n = 4$, but there is a 2-state solution for all values $n \ge 6$. In the second part, we develop and compare two different approaches for synthesising synchronous counting algorithms. Both approaches are based on casting the synthesis problem as a propositional satisfiability (SAT) problem and employing modern SAT-solvers. The difference lies in how to solve the SAT problem: either in a direct fashion, or incrementally within a counter-example guided abstraction refinement loop. Empirical results suggest that the former technique is more efficient if we want to synthesise time-optimal algorithms, while the latter technique discovers non-optimal algorithms more quickly.Comment: 35 pages, extended and revised versio

Political Economy of Public Deficit: Perspectives for Constitutional Reform

The paper uses a dynamic inconsistency model known from monetary policy to assess three alternative proposals how to reform fiscal constitution in order to limit government’s incentive to use fiscal policy for maximizing political support. The return to ever-balanced-budget rule, state-contingent rules, and the establishment of an independent Fiscal Policy Committee with power to set public deficit with the aim of stabilizing the economy are discussed from the constitutional perspective, analyzing different incentives that these proposals create for government and alternative means to enhance credibility of the arrangement.fiscal policy; dynamic inconsistency; political economy; public deficit