Self-stabilizing K-out-of-L exclusion on tree network

TL;DR

This paper introduces the first deterministic self-stabilizing distributed protocol for K-out-of-L exclusion in asynchronous tree networks, ensuring fair resource sharing with bounded memory per process.

Contribution

It presents a novel self-stabilizing algorithm for K-out-of-L exclusion in message-passing systems on tree networks, a problem not previously solved deterministically.

Findings

First deterministic self-stabilizing protocol for K-out-of-L exclusion

Works in asynchronous oriented tree networks

Assumes bounded local memory for each process

Abstract

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