Our purpose in this paper is to propose a new protocol that can ensure mutual exclusion between neighboring nodes in an arbitrary distributed system,i.e.,under the given protocol no two neighboring nodes can execute their critical sections concurrently.This protocol can be used to run a serial model self stabilizing algorithm in a distributed environment that accepts as atomic operations only "send a message","receive a message",and "update a state".unlike the scheme in [1],our protocol does not use time-stamps (which are basically unbounded which was restricted to work only for tree structured distributed systems.Like the protocol in [2],our algorithm uses only bounded integers and can be easily implemented.
展开▼
