Name
Abstract | ||
|---|---|---|
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. Here, we present the first snap-stabilizing protocol for arbitrary rooted networks which detects if a set of nodes is a cutset. This protocol is based on the depth-first search (DFS) traversal and its properties. One of the most interesting properties of our protocol is that, despite the initial configuration, as soon as the protocol is initiated by the root, the result obtained from the computations will be right. So, after the first execution of the protocol, the root is able to take a decision: “the input set is a cutset or not”, and this decision is right. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11602569_50 | HiPC |
Keywords | Field | DocType |
input set,arbitrary rooted network,depth-first search,initial configuration,snap-stabilizing detection,interesting property,snap-stabilizing protocol,depth first search,fault tolerant,distributed system | Distributed File System,Tree traversal,Shared memory model,Computer science,Parallel computing,Token circulation,Transmission protocol,Communications protocol,Distributed computing,Computation | Conference |
Volume | ISSN | ISBN |
3769 | 0302-9743 | 3-540-30936-5 |
Citations | PageRank | References |
2 | 0.37 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alain Cournier | 1 | 281 | 22.07 |
| Stéphane Devismes | 2 | 192 | 25.74 |
| Vincent Villain | 3 | 544 | 45.77 |