Self-stabilizing systems have the ability to converge to a correct behavior when started in any configuration. Most of the work done so far in the self-stabilization area assumed either communication via shared memory or via FIFO channels.This paper is the first to lay the bases for the design of self-stabilizing message passing algorithms over unreliable non-FIFO channels. We propose an optimal stabilizing data-link layer that emulates a reliable FIFO communication channel over unreliable capacity bounded non-FIFO channels.

Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed system that permits to cope with arbitrary malicious behaviors.We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties prove difficult: we demonstrate that it is impossible to contain the impact of Byzantine nodes in a self-stabilizing context for maximum metric tree construction (strict stabilization). We propose a weaker containment scheme called topology-aware strict stabilization, and present a protocol for computing maximum metric trees that is optimal for this scheme with respect to impossibility result.

The origin and composition of sediment organic matter (SOM) were investigated together with its spatial distribution in the Arcachon Bay-a macrotidal lagoon that shelters the largest Zostera noltii meadow in Europe-using elemental and isotopic ratios. Subtidal and intertidal sediments and primary producers were both sampled in April 2009. Their elemental and isotopic compositions were assessed. Relative contributions of each source to SOM were estimated using a mixing model. The SOM composition tended to be homogeneous over the whole ecosystem and reflected the high diversity of primary producers in this system. On average, SOM was composed of 25% of decayed phanerogams, 19% of microphytobenthos, 20% of phytoplankton, 19% of river SPOM and 17% of macroalgae. There was no evidence of anthropogenic N-sources and SOM was mainly of autochthonous origin. None of the tested environmental parameters-salinity, current speed, emersion, granulometry and chlorophyll a-nor a combination of them explained the low spatial variability of SOM composition and characteristics. Resuspension, mixing and redistribution of the different particulate organic matters by wind-induced and tidal currents in combination with shallow depth probably explain the observed homogeneity at the whole bay scale. Highlights ► SOM composition reflected the diversity of primary producers and POM sources of the system. ► SOM is mainly of autochthonous origin. ► There is no influence of anthropogenic N-sources in Arcachon Bay. ► SOM composition is homogeneous at the bay scale. ► None of the tested environmental forcings explained the spatial variability of SOM composition and characteristics.

No abstract

No abstract

We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergence. First, we provide a distance among TVGs to define correctly the convergence of TVG sequences. Next, we provide a general framework that formally proves the convergence of the sequence of executions of any deterministic algorithm over TVGs of any convergent sequence of TVGs. Finally, we illustrate the relevance of the above result by proving that no deterministic algorithm exists to compute the underlying graph of any connected-over-time TVG, i.e., any TVG of the weakest class of long-lived TVGs. *

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors.We consider the well known problem of constructing a breadth-first spanning tree in this context. Combining these two properties proves difficult: we demonstrate that it is impossible to contain the impact of Byzantine nodes in a strictly or strongly stabilizing manner. We then adopt the weaker scheme of topology-aware strict stabilization and we present a similar weakening of strong stabilization. We prove that the classical min + 1 protocol has optimal Byzantine containment properties with respect to these criteria.

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. Combining these two properties proved difficult: it is impossible to contain the spatial impact of Byzantine nodes in a self-stabilizing context for global tasks such as tree orientation and tree construction.We present and illustrate a new concept of Byzantine containment in stabilization. Our property, called Strong Stabilization enables to contain the impact of Byzantine nodes if they actually perform too many Byzantine actions. We derive impossibility results for strong stabilization and present strongly stabilizing protocols for tree orientation and tree construction that are optimal with respect to the number of Byzantine nodes that can be tolerated in a self-stabilizing context.