How to improve snap-stabilizing point-to-point communication space complexity?
From MaRDI portal
Publication:555308
DOI10.1016/J.TCS.2010.11.014zbMATH Open1217.68027OpenAlexW2071998903MaRDI QIDQ555308FDOQ555308
Authors: Alain Cournier, Swan Dubois, Vincent Villain
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
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Network protocols (68M12)
Cites Work
- Introduction to algorithms
- Introduction to Distributed Algorithms
- A self-stabilizing algorithm for constructing breadth-first trees
- Snap-stabilization and PIF in tree networks
- Self-stabilizing systems in spite of distributed control
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Deadlock-Free Packet Switching Networks
- Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
- Distributed computation on graphs
- Title not available (Why is that?)
- Optimal fully adaptive minimal wormhole routing for meshes
- How to improve snap-stabilizing point-to-point communication space complexity?
- Parallel Processing and Applied Mathematics
Cited In (4)
This page was built for publication: How to improve snap-stabilizing point-to-point communication space complexity?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555308)