Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
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
Elements of network protocol design
Elements of network protocol design
Stabilization of general loop-free routing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Stabilization of maximal metric trees
ICDCS '99 Workshop on Self-stabilizing Systems
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
On-Demand Loop-Free Routing with Link Vectors
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
| Hi-index | 0.00 |
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore, there is a distinguished process, called root, that may be reached from any other process by following the successor relation at each hop. Thus, under the successor relation, the processes are arranged as a directed acyclic graph that converges on the root process, i.e., a converging DAG (c-DAG). We present a network where each process may dynamically change its choice of successors, and during this change, the following two nice properties are satisfied. First, if the initial state of the network forms a c-DAG, then a c-DAG is preserved at all times. Second, if the protocol is started from an arbitrary state (i.e., where each variable has an arbitrary value), then a c-DAG is automatically restored.