Science of Computer Programming
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Self-stabilizing depth-first search
Information Processing Letters
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Guarded commands, nondeterminacy and formal derivation of programs
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
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
Distributed Algorithms
Introduction to Algorithms
Some remarks on distributed depth-first search
Information Processing Letters
IEEE Transactions on Computers
An Adaptive Checkpointing Scheme for Distributed Databases with Mixed Types of Transactions
IEEE Transactions on Knowledge and Data Engineering
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Constructing Adaptive Software in Distributed Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Protocol Switching: Exploiting Meta-Properties
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
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
Self-stabilizing distributed protocol switching
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Structural and algorithmic issues of dynamic protocol update
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
| Hi-index | 0.00 |
Adaptation is a desirable requirement in a distributed system as it helps the system to perform efficiently under different environments. For many problems, more than one protocol exists, such that one protocol performs better in one environment while the other performs better in another. In such cases, adaptive distributed systems can be designed by dynamically switching between the protocols as the environment changes. Distributed protocol switching is also important for performance enhancement, or fault-tolerance of a distributed system. In this work, we illustrate distributed protocol switching by providing a distributed algorithm for adaptive broadcast that dynamically switches from a BFS tree to a DFS tree. The proposed switching algorithm can also handle arbitrary crash failures. It ensures that switching eventually terminates in spite of failures and the desired tree (DFS tree) results as the output. We also investigate the properties that can be guaranteed on the delivery of broadcast messages under specific failure conditions. We show that under no failure, each broadcast message is eventually correctly delivered to all the nodes in spite of switching. Under arbitrary crash fault, we ensure that switching eventually terminates with the desired tree as the broadcast topology. We also investigate the specific delivery guarantees that can be provided when a single crash fault happens, both during switching and when no switching is in progress.