Information Processing Letters
ACM Computing Surveys (CSUR)
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
An optimal algorithm for distributed snapshots with causal message ordering
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Snapshot algorithms are fundamental algorithms in distributed computing. However, most existing snapshot algorithms are designed for a static network system in which the set of channels and the processes at the endpoints of the channels do not change with time. They cannot be applied directly in recent emerging MANETs, which usually have no fixed infrastructure and may experience dynamic topology changes in the mid of execution. In this paper, we report recent results on developing snapshot algorithms for MANETs.