Name
Abstract | ||
|---|---|---|
We address the self-stabilizing unison problem in tree networks. We propose two self-stabilizing unison protocols without any reset correcting system. The first one, called Protocol SU_Min, being scheduled by a synchronous daemon, is self-stabilizing to synchronous unison in at most D steps, where D is the diameter of the network. The second one, Protocol WU_Min, being scheduled by an asynchronous daemon, is self-stabilizing to asynchronous unison in at most D rounds. Moreover, both are optimal in space. The amount of required space is independent of any local or global information on the tree. Furthermore, they work on dynamic trees networks, in which the topology may change during the execution. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-49823-0_10 | SSS |
Keywords | Field | DocType |
asynchronous daemon,asynchronous unison,time-optimal odd phase clock,protocol su_min,synchronous unison,self-stabilizing unison protocol,required space,d step,protocol wu_min,d round,self-stabilizing unison problem | Asynchronous communication,Computer science,Global information,Unison,Phase synchronization,Fault tolerance,Initialization,Minimum time,Daemon,Distributed computing | Conference |
Volume | ISSN | Citations |
4280 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Boulinier | 1 | 53 | 3.66 |
| Franck Petit | 2 | 736 | 60.02 |
| Vincent Villain | 3 | 544 | 45.77 |