Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks
| dc.creator | Boulinier, Christian | |
| dc.date | 2007-06-28 | |
| dc.date.accessioned | 2026-07-07T08:12:57Z | |
| dc.date.available | 2026-07-07T08:12:57Z | |
| dc.description | How to pass from local to global scales in anonymous networks? How to organize a selfstabilizing propagation of information with feedback. From the Angluin impossibility results, we cannot elect a leader in a general anonymous network. Thus, it is impossible to build a rooted spanning tree. Many problems can only be solved by probabilistic methods. In this paper we show how to use Unison to design a self-stabilizing barrier synchronization in an anonymous network. We show that the commuication structure of this barrier synchronization designs a self-stabilizing wave-stream, or pipelining wave, in anonymous networks. We introduce two variants of Wave: the strong waves and the wavelets. A strong wave can be used to solve the idempotent r-operator parametrized computation problem. A wavelet deals with k-distance computation. We show how to use Unison to design a self-stabilizing wave stream, a self-stabilizing strong wave stream and a self-stabilizing wavelet stream. | |
| dc.identifier | https://arxiv.org/abs/0706.4298 | |
| dc.identifier | http://arxiv.org/abs/0706.4298 | |
| dc.identifier | Rapport de recherche. (28/06/2007) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/132633 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.title | Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks | |
| dc.type | text |