Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
ACM Computing Surveys (CSUR)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
The Request Reply Family of Group Routing Protocols
IEEE Transactions on Computers
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Reverse path forwarding of broadcast packets
Communications of the ACM
IEEE Transactions on Computers
Stabilization of maximal metric trees
ICDCS '99 Workshop on Self-stabilizing Systems
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Flow routing in computer networks
Flow routing in computer networks
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Fast Distributed Approximations in Planar Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
A stabilizing solution to the stable path problem
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Stabilization of loop-free redundant routing
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A new self-stabilizing minimum spanning tree construction with loop-free property
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A self-stabilizing minimal dominating set algorithm with safe convergence
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
We present a protocol for maintaining a spanning tree that is maximal with respect to any given (bounded and monotonic) routing metric. This protocol has two interesting adaptive properties. First, the protocol is stabilizing: starting from any state, the protocol stabilizes to a state where a maximal tree is present. Second, the protocol is loop-free: starting from any state where a spanning tree is present, the protocol stabilizes, without forming any loops, to a state where a maximal tree is present. The stabilization time of this protocol is O(n deg), where n is the number of nodes, and deg is the node degree in the network.