A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in the message forwarding problem in a message-switched network in which the system resources must be managed in order to deliver messages to any processor of the network. To this end, we use the information provided by a routing algorithm. In the context...

Research in system stabilization has traditionally relied on the availability of a complete system implementation. As such, it would appear that the scalability and reusability of stabilization is limited in practice. Towards redressing this perception, in this paper, we show for the first time that system stabilization may be designed knowing only the system specification but not the system im...

This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We assume that n > 2f (n is the number of processes and f is the number of Byzantine processes) and that the initial state of the processes can b...

β̂ u = [0; ρ1; ρ2] satisfy (I) and (II) and therefore represents a self-confirming equilibrium, in the case of στ = 0. When σ 2 τ > 0, finding the self-confirming equilibrium is more involved and requires a numerical solution of the system of equations given by (I) and (II). The procedure works as follows: any given fixed value of ûN , β̂ π and β̂ u implies a linear stochastic process for £ πt, ut...

This paper presents iterative Sequential Action Control (iSAC), a receding horizon approach for control of nonlinear systems. The iSAC method has a closed-form openloop solution, which is iteratively updated between time steps by introducing constant control values applied for short duration. Application of a contractive constraint on the cost is shown to lead to closed-loop asymptotic stabilit...

We propose that the existence of the string landscape suggests the universe can be in a quantum glass state, where an extremely large viscosity is generated, and long distance dynamics slows down. At the same time, the short distance dynamics is not altered due to the separation of time scales. This scenario can help to understand some controversies in cosmology, for example the natural existen...

In previous work, we have designed a tracking protocol, Stalk, for wireless sensor networks and proved it to be self-stabilizing at the pseudo-code (I/O automata) level. However, it is very challenging to achieve and verify self-stabilization of the same protocol at the implementation (TinyOS) level due to the size of the corresponding program at the implementation level. In this paper, we pres...

Self-stabilizing local k-placement of replicas with minimal variance. Self-stabilizing algorithm for maximal graph partitioning into triangles.

On a network having m edges and n nodes, Hsu and Huang’s self-stabilizing algorithm for maximal matching stabilizes in at most 2m+ n moves.  2001 Elsevier Science B.V. All rights reserved.

We study the effect of anomalous U(1) gauge groups in string theory compactification with fluxes. We find that, in a gauge invariant formulation, consistent AdS vacua appear breaking spontaneously supergravity. Non vanishing D-terms from the anomalous symmetry act as an uplifting potential and could allow for de Sitter vacua. However, we show that in this case the gravitino is generically (but ...