𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Snap-stabilization and PIF in tree networks

✍ Scribed by Alain Bui; Ajoy K. Datta; Franck Petit; Vincent Villain

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
650 KB
Volume
20
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Space and Time Efficient Self-Stabilizin
Space and Time Efficient Self-Stabilizing β„“-Exclusion in Tree Networks
✍ R. Hadid πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 292 KB

We propose an efficient self-stabilizing '-exclusion algorithm in rooted tree networks running under an unfair distributed daemon. The '-exclusion problem is a generalization of the mutual exclusion problem}' Γ°'51) processors, instead of 1, are permitted to use a shared resource. The algorithm is se

A self-stabilizing distributed algorithm
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
✍ H. Baala; O. Flauzac; J. Gaber; M. Bui; T. El-Ghazawi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 388 KB

Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algo

Riesz basis and stabilization for the fl
Riesz basis and stabilization for the flexible structure of a symmetric tree-shaped beam network
✍ Jun-Min Wang; Bao-Zhu Guo πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 228 KB

## Abstract The stabilization of a symmetric tree‐shaped network of Euler–Bernoulli beams described by a system of partial differential equations is considered. The boundary controllers are designed based on passivity principle. The eigenfrequencies are analysed in detail and the asymptotic expansi