Self-Stabilizing k-out-of-ℓ exclusion on tree networks

In this paper, we address the problem of k-out-of-lscr exclusion, a generalization of the mutual exclusion problem, in which there are lscr units of a shared resource, and any process can request up to k units (1 les k les lscr). We propose the first deterministic self-stabilizing distributed k-out-of-lscr exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.