Abstract—In , we have introduced a lightweight SBML protocol to address the following two problems of the original SBML recovery algorithm; it may no longer be progressing in some transient communication error cases and all the message send operations generated after having received some unstable messages should be delayed until they are known to be stable. However, it may make the full log information of each application message recorded on its sender’s buffer as well as on the buffer of its immediate dependent. In this paper, we design a novel stable message log purging algorithm to eliminate useless recovery information from immediate dependents’ buffers without resulting in any extra control messages. It only piggybacks a variable on original control messages for logging each application message. Finally, we prove the correctness of our algorithm.
Index Terms—Distributed systems, fault-tolerance, sender-based message logging, consistency, log purging.
Jinho Ahn is with the Dept. of Computer Science, Kyonggi University, Suwon Gyeonggi, Korea（e-mail: firstname.lastname@example.org).
Cite: Jinho Ahn, "Low-Cost Stable Message Log Purging Algorithm for SBML," International Journal of Engineering and Technology vol. 4, no. 4, pp. 409-412, 2012.