Our protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). Once the system is stabilized the circulation of the sole token is 1-fair (i.e. in every round, every proce...

This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate upto k site/link failures. The algorithm uses many features of the token based algorithm by Raymond 5] and inherits many of its advantages , viz. simplicity of the token message and the local data structure at each site. Correctness proofs of the algorithm and complexity analysis are included.

that there is no stabilizing token ring whose processes are all identical and where the number of processes in the ring is a composite number. The problem can be solved, however, in some special cases. In particular, Burns and Pachl have shown in [BP89] that problem (i) can be solved if the number of processes is a prime number. Their solution still suffers from problems (ii) and (iii). Problem...

We design two mutual exclusion algorithms for wireless networks. Our mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages is exploited. The design goal is to decrease th...

With the rising demand for protection against new risks such as loss of digital assets, novel insurance services and products emerge. In particular, token-based solutions on blockchain transform business by providing cover streamlined, (semi-)automated underwriting claim processes. chapter, we present a general framework solutions, delegating their fundamental building blocks that include core ...

This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in w...