Stabilization of general loop-free routing
From MaRDI portal
Publication:701151
Recommendations
Cited in
(13)- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- scientific article; zbMATH DE number 2104199 (Why is no real title available?)
- Mitigating transient loops through interface-specific forwarding
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
- Stable routing under the Spanning Tree Protocol
- On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion
- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
- scientific article; zbMATH DE number 2061548 (Why is no real title available?)
- Directional Routing via Generalized st-Numberings
- Suboptimal-optimal routing for LAN internetworking using transparent bridges
- On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms
- Achieve faster spanning tree convergence
This page was built for publication: Stabilization of general loop-free routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701151)