How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults

We propose a fault-tolerant algorithm to simulate messagepassing algorithms in mobile agent systems. We consider a mobile agent system with k agents where f of them may crash for a given f (<= k - 1). The algorithm simulates a message-passing algorithm, say Z, with O((m M)f) total agent moves where m is the number of links in the network and M is the total number of messages created in the simulated execution of Z. The previous algorithm [5] can tolerate k-1 agent crashes but requires O((m+nM)k) total agent moves. Therefore, our algorithm improves the total number of agent moves for f = k - 1 and requires a smaller number of total moves if f is smaller.