Designing efficient and fault-tolerant algorithms for solving the mutual exclusion problem is an important issue in distributed systems. Many algorithms have been proposed in the literature, and they are being broadly classified into two types: token-based and permissionbased [5, 21]. In a token-based algorithm, the system uses a unique token to represent the privilege for the node possessing i...

Multi-factor authentication schemes have been proved to be very useful in many authentication systems including biometric ones. In this paper we have proposed a multi-factor authentication scheme, in which one of the main components is represented by the generation of a token and a password (known as the kernel of the multi-factor scheme) and another component is represented by a module which w...

A probabilistic self-stabilizing algorithm for a ring of identical processes is presented; the number of processes in the ring is odd, the processes operate synchronously, and communication is unidirectional in the ring. The normal function of the algorithm is to circulate a single token in the ring. If the initial state of the ring is abnormal, i.e. the number of tokens diiers from one, then e...

Aim of this paper is to deduce computational cost using a token generation method compared homomorphic algorithms in cloud storage. Token and are the study contains two groups with sample size N=10. Accuracy each methods for different sizes G power value as 0.8. Homomorphic algorithm provides 1.2 times better performance various datasets. Results were obtained statistical significance algorithm...

Coteries may be used to construct permission based distributed mutual exclusion algorithms. One such algorithm is Maekawa's p N algorithm in which the co-terie is constructed based on nite projective planes. This paper presents a token based mutual exclusion algorithm which uses data structures similar to coter-ies, called quorum agreements. The performance of the algorithm depends upon the quo...

Load balancing on a multi-processor system involves redistributing tasks among processors so that each processor has roughly the same amount of work to perform. The token-distribution problem is a static variant of the load balancing problem for the case in which the workloads in the system cannot be divided arbitrarily; that is, where each token represents an atomic element of work. A scalable...