论文部分内容阅读
In this paper the algorithms forself-stabilizing communication protocols are studied. First someconcepts and a formal method for describing the proposed algorithms aredescribed, then an improved algorithm for achieving global states ispresented. Thestudy shows that the improved algorithm can be applied to obtain the globalstates in the case of a loss of cooperation of the different processesin the protocol, which can be used as a recovery point that will be usedby the following recovery procedure. Thus, the improved algorithm can beused to self-stabilize a communication protocol. Meanwhile,a recovery algorithm for self-stabilizing communicationprotocols is presented. After a failure is detected, all processes caneventuallyknow the error. The recovery algorithm uses the contextual information exchanged during the progress of the protocol and recorded on the stablememory. The proof of correctness and analysis of complexity for these algorithms have been made. The availability and efficiency of the algorithms have been verified by illustrating the example protocols.Finally, some conclusions and remarks are given.