The message classification model
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Fault-Tolerant Mobile Agent Execution
IEEE Transactions on Computers
Modeling fault-tolerant and reliable mobile agent execution in distributed systems
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
| Hi-index | 0.00 |
We consider partitionable networks with process crashes and lossy links, and focus on the problems of reliable communication and consensus for such networks. For both problems we seek algorithms that are quiescent, i.e., algorithms that eventually stop sending messages. We first tackle the problem of reliable communication for partitionable networks by extending the results of [ACT97a]. In particular, we generalize the specification of the heartbeat failure detector HB, show how to implement it, and show how to use it to achieve quiescent reliable communication. We then turn our attention to the problem of consensus for partitionable networks. We first show that, even though this problem can be solved using a natural extension of