当前位置: X-MOL 学术J. Supercomput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems
The Journal of Supercomputing ( IF 3.3 ) Pub Date : 2020-04-23 , DOI: 10.1007/s11227-020-03286-y
Amit Biswas , Ashish Kumar Maurya , Anil Kumar Tripathi , Samir Aknine

In a distributed system, multiple nodes work together to build a highly available, reliable, resource shareable, and fault-tolerant system to achieve a common goal. Here, multiple nodes work together to complete a task, so coordination is essential among these nodes. Electing a node as a system leader from among all the nodes can be a possible solution to do the coordination. Besides coordination, the leader also controls various activities like task allocation, result aggregation, efficient resource sharing, clock synchronization, and communication among the nodes of the system. In this work, we address the leader election problem through a new leader election algorithm called Failure Rate and Load-based Leader Election (FRLLE) algorithm for bidirectional ring networks. The proposed algorithm elects a node with a minimum failure rate and load as well so that the system gets a more reliable leader that can concentrate on leadership roles and activity comfortably. Like a proper leader election algorithm, this algorithm satisfies safety, liveness, and termination conditions that help to build an efficient and consistent distributed system. This algorithm reduces the message and time complexity, which means the algorithm takes fewer time steps to elect a leader by exchanging fewer messages. We compare the simulation results of the FRLLE algorithm with the well-known existing leader election algorithms and demonstrate that the FRLLE algorithm exchanges fewer messages and takes fewer time steps to elect the leader. We further carried out a priori complexity analysis and compared the outcome with the results of the simulation to corroborate our proposal.

中文翻译:

FRLLE:分布式系统中双向环的故障率和基于负载的领导者选举算法

在分布式系统中,多个节点协同工作,构建一个高可用、可靠、资源可共享、容错的系统,以实现一个共同的目标。在这里,多个节点协同工作完成一项任务,因此这些节点之间的协调是必不可少的。从所有节点中选举一个节点作为系统领导者可能是进行协调的一种可能的解决方案。除了协调之外,领导者还控制各种活动,如任务分配、结果聚合、高效资源共享、时钟同步以及系统节点之间的通信。在这项工作中,我们通过一种新的领导选举算法来解决领导选举问题,该算法称为双向环网的失败率和基于负载的领导选举(FRLLE)算法。所提出的算法还选择具有最小故障率和负载的节点,以便系统获得更可靠的领导者,可以舒适地专注于领导角色和活动。与适当的领导选举算法一样,该算法满足安全性、活性和终止条件,有助于构建高效且一致的分布式系统。该算法降低了消息和时间复杂度,这意味着该算法通过交换更少的消息来选择领导者所需的时间步数更少。我们将 FRLLE 算法的仿真结果与众所周知的现有领导者选举算法进行比较,并证明 FRLLE 算法交换的消息更少,选举领导者的时间步长也更少。
更新日期:2020-04-23
down
wechat
bug