Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Fast protocol transition in a distributed environment (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Computers
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive broadcast by distributed protocol switching
Proceedings of the 2007 ACM symposium on Applied computing
Fault-tolerant topology adaptation by localized distributed protocol switching
HiPC'07 Proceedings of the 14th international conference on High performance computing
Adaptive connected dominating set – an exercise in distributed output switching
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Run-time switching between total order algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Adaptive broadcast by fault-tolerant spanning tree switching
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Switching between protocols based on environment is an elegant idea of enabling adaptation in distributed systems. Also self-stabilizing algorithms have been proposed as a mechanism to handle transient failures in distributed systems. In this work we illustrate self-stabilizing distributed protocol switching by proposing a self-stabilizing algorithm for dynamically switching between a BFS tree and a DFS tree. At low network load, the BFS tree may be used for broadcasting messages since it also minimizes delay. At higher network load, the DFS tree may be used to reduce the load on any one node. Both trees are rooted at the common broadcast source. Different properties relating to the delivery of broadcast messages under different failure conditions are investigated.