How to improve snap-stabilizing point-to-point communication space complexity?

DOI10.1016/j.tcs.2010.11.014zbMath1217.68027OpenAlexW2071998903MaRDI QIDQ555308

Swan Dubois, Vincent Villain, Alain Cournier

Publication date: 22 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.014

zbMATH Keywords

self-stabilizationsnap-stabilizationmessage forwarding

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (2)

Stabilizing data-link over non-FIFO channels with optimal fault-resilience ⋮ How to improve snap-stabilizing point-to-point communication space complexity?

Cites Work

• Unnamed Item
• Unnamed Item
• How to improve snap-stabilizing point-to-point communication space complexity?
• A self-stabilizing algorithm for constructing breadth-first trees
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Optimal fully adaptive minimal wormhole routing for meshes
• Snap-stabilization and PIF in tree networks
• Deadlock-Free Packet Switching Networks
• Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
• Distributed computation on graphs
• Self-stabilizing systems in spite of distributed control
• Introduction to Distributed Algorithms
• Parallel Processing and Applied Mathematics

This page was built for publication: How to improve snap-stabilizing point-to-point communication space complexity?