Science of Computer Programming
Boundedness, empty channel detection, and synchronization for communicating finite automata
Theoretical Computer Science
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
A survey on the decidability questions for classes of FIFO nets
Advances in Petri Nets 1988
An efficient reliable broadcast protocol
ACM SIGOPS Operating Systems Review
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
On Communicating Finite-State Machines
Journal of the ACM (JACM)
IEEE Transactions on Computers
ACM Transactions on Computer Systems (TOCS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Distributed Algorithms
Foreword: Special Issue on Tools for Computer Communication Systems
IEEE Transactions on Software Engineering
A Fault Tolerant Broadcast Scheme in Star Graphs
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Reliable Broadcast Scheme Initiated by Receiver In Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Light-weight multicast services (LMS): a router-assisted scheme for reliable multicast
IEEE/ACM Transactions on Networking (TON)
Reachability analysis of protocols with FIFO channels
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Decidability of the termination problem for completely specified protocols
Distributed Computing
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
On embedding subclasses of height-balanced trees in hypercubes
Information Sciences: an International Journal
Empire of Colonies: self-stabilizing and self-organizing distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Request-based token passing for self-stabilizing mutual exclusion
Information Sciences: an International Journal
Closed Covers: To Verify Progress for Communicating Finite State Machines
IEEE Transactions on Software Engineering
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
Information Sciences: an International Journal
Output feedback control of asynchronous sequential machines with disturbance inputs
Information Sciences: an International Journal
Hi-index | 0.07 |
Embedding is a method of projecting one topology into another. In one-to-one node embedding, paths in the target topology correspond to links in the original topology. A protocol running on the original topology can be modified to be executed on a target topology by means of embedding. However, if the protocol is tolerant to a number of faults - faults that affect the data but not the code of a distributed protocol executed by the nodes in a distributed systems - then the adapted protocol will not have the fault tolerance property preserved, due to the fact that links in the original topology can be embedded into paths of length greater than one: faults at the intermediate nodes on such paths are not accounted for in the protocol. We propose a communication protocol in the target topology that preserves the fault tolerance characteristics of any protocol designed for the original topology, namely by our mechanism the modification preserves fault tolerance.