A distributed algorithm is proposed that realizes mutual exclusion amo
ng n nodes in a computer network. No common or global memory is shared
by the nodes for internode communication; instead this is done by exc
hanging messages. The algorithm requires at most 3 root n messages per
mutual exclusion invocation. Under heavy demand the message requireme
nt reduces to root n.