We propose an algorithm to allocate critical resources

(mutual exclusion problem) in a computer network composed of

N nodes that communicate by message exchanges. The

algorithm uses a logical structure in the form of wraparound...