in this paper the algorithms for self-stabilizing communication protocols are studied.First some concepts and a formal method for describing theproposed algorithms are described,then an improved algorithm for achievin...in this paper the algorithms for self-stabilizing communication protocols are studied.First some concepts and a formal method for describing theproposed algorithms are described,then an improved algorithm for achieving globalstates is presented.The study shows that the improved algorithm can be appliedto obtain the global states in the case of a loss of cooperation of the different processes in the protocol,which can be used as a recovery point that will be used bythe following recovery procedure.Thus,the improved algorithm can be used toself-stabilize a communication protocol.Meanwhile,a recovery algorithm for selfstabilizing communication protocols is presented.After a failure is detected,allProcesses can eventually know the error.The recovery algorithm uses the contextualinformation exchanged during the progress of the protocol and recorded on the stablememory.The proof of correctness and analysis of complexity for these algorithmshave been made.The availability and efficiency of the algorithms have been verifiedby illustrating the example protocols.Finally,some conclusions and remarks aregiven.展开更多
基金supported by National Natural Science Foundation of China and NSF of Hubei Province
文摘in this paper the algorithms for self-stabilizing communication protocols are studied.First some concepts and a formal method for describing theproposed algorithms are described,then an improved algorithm for achieving globalstates is presented.The study shows that the improved algorithm can be appliedto obtain the global states in the case of a loss of cooperation of the different processes in the protocol,which can be used as a recovery point that will be used bythe following recovery procedure.Thus,the improved algorithm can be used toself-stabilize a communication protocol.Meanwhile,a recovery algorithm for selfstabilizing communication protocols is presented.After a failure is detected,allProcesses can eventually know the error.The recovery algorithm uses the contextualinformation exchanged during the progress of the protocol and recorded on the stablememory.The proof of correctness and analysis of complexity for these algorithmshave been made.The availability and efficiency of the algorithms have been verifiedby illustrating the example protocols.Finally,some conclusions and remarks aregiven.
