The algorithms for achieving global states and self-stabilization for communication protocols

This paper discusses the algorithms for achieving global states and self-stabilization for communication protocols. It first describes a primary algorithm including its suitability for achieving global states and limitation of self-stabilization for communication protocols. and then presents an improved algorithm that can be suitable to achieve global slates and can be also used to self-stabilizing communication protocols. Finally. it gives the proof of correctness and analysis of complexity of the improved algorithm. and verifies its availability and efficiency by illustrating an example protocol.