Browsing by Subject "Leader Election"
Now showing items 1-3 of 3
-
The Full Reversal Algorithm of Gafni and Bertsekas has been traditionally used to solve problems in distributed computing, such as leader election, resource allocation, and routing problems [1]. Full reversal generally ...
-
(2013-10-28)A distributed system is a collection of computing entities that communicate with each other to solve some problem. Distributed systems impact almost every aspect of daily life (e.g., cellular networks and the Internet); ...
-
(Texas A&M University, 2004-09-30)There are many variants of leader election algorithm in distributed networks. In this research, an agent based approach to leader election in distributed networks is investigated. Agents have shown to be useful in several ...