Snap-stabilization and PIF in tree networks
From MaRDI portal
Publication:1954227
DOI10.1007/s00446-007-0030-4zbMath1266.68206OpenAlexW1978972832MaRDI QIDQ1954227
Alain Bui, Vincent Villain, Ajoy K. Datta, Franck Petit
Publication date: 20 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-007-0030-4
Trees (05C05) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items
The expressive power of snap-stabilization, Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees, The snap-stabilizing message forwarding algorithm on tree topologies, Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles, Snap-stabilization and PIF in tree networks, Snap-stabilization in message-passing systems, Fast and compact self-stabilizing verification, computation, and fault detection of an MST, How to improve snap-stabilizing point-to-point communication space complexity?, Timer-based composition of fault-containing self-stabilizing protocols, Unnamed Item, Snap-stabilizing tasks in anonymous networks, A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm, Safe and stabilizing distributed multi-path cellular flows, On probabilistic snap-stabilization
Cites Work
- Unnamed Item
- Self-stabilization (in spite of distributed control) in tree-structured systems
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilizing depth-first token circulation on networks
- Snap-stabilization and PIF in tree networks
- Distributed network protocols
- Self-stabilizing systems in spite of distributed control
- Distributed reset
- Introduction to Distributed Algorithms
- Time optimal self-stabilizing synchronization
- Self-stabilization by counter flushing
- Memory-efficient and self-stabilizing network RESET (extended abstract)
