Group leader election under link-state routing

In a distributed environment, several independent nodes work together by exchanging messages to each other. To achieve synchronization and co-ordination among the nodes, there is a need to elect one leader node. Previously several algorithms have been proposed,one of the classical and well-known algorithms to elect the leader node is bully algorithm. Ring algorithm is another modified version of bully algorithm. But these algorithms are having a large number of messages during election process. Till now several amendments are done over the bully algorithm to reduce the number of messages in the leader election process. This paper presents the concept of co-leader based leader election mechanism by which the number of messages can be greatly reduced and hence can reduce network traffic. Further, we have evaluated the performance of our proposed approach by considering the testbed of 10, 100 and 1000 nodes and shown the comparative analysis.

Distributed systems consist of several management sites which have different resource sharing levels. Resources can be shared among inner site and outer site processes at first and second level respectively. Global coordinator should exist in order to coordinate access to multi site’s shared resources. Moreover; some other coordinators should manage access to inner site’s shared resources so that exerting appropriate coordinator election algorithms in each level is crucial to achieve most efficient system. In this paper a hierarchical distributed election algorithm is proposed which eliminates single point of failure of election launcher. Meanwhile traffic is applied to network at different times and the number of election messages is extremely decreased as well which applies more efficiency especially in high traffic networks. A standby system between coordinators and their first alternative is considered to induct less wait time to processes which want to communicate with coordinator

International Conference on Computer Engineering and Technology (ICCET), 2010

An important challenge confronted in distributed systems is the adoption of suitable and efficient algorithms for coordinator election. The main role of an elected coordinator is to manage the use of a shared resource in an optimal manner. Among all the algorithms reported in the literature, the Bully and Ring algorithms have gained more popularity. In this paper, we describe novel approaches towards improving the Bully and Ring algorithms and also propose the heap tree mechanism for electing the coordinator. The higher efficiency and better performance of our presented algorithms with respect to the existing algorithms is validated through extensive simulation results.

Journal of Transportation Technologies

Leader election algorithms play an important role in orchestrating different processes on distributed systems, including next-generation transportation systems. This leader election phase is usually triggered after the leader has failed and has a high overhead in performance and state recovery. Further, these algorithms are not generally applicable to cloud-based native microservices-based applications where the resources available to the group and resources participating in a group continuously change and the current leader may exit the system with prior knowledge of the exit. Our proposed algorithm, the dynamic leader selection algorithm, provides several benefits through selection (not, election) of a set of future leaders which are then alerted prior to the failure of the current leadership and handed over the leadership. A specific illustration of this algorithm is provided with reference to a peer-to-peer distribution of autonomous cars in a 5G architecture for transportation networks. The proposed algorithm increases the efficiencies of applications that use the leader election algorithm and finds broad applicability in microservices-based applications.

International Journal of Advanced Technology and Engineering Exploration

Electing a reliable coordinator is a crucial task in peer-to-peer distributed network. The peer-to-peer distributed network comprises number of peer entities. These member entities elect the coordinator entity by consensus [1-3]. Different consensus algorithms exist for electing an entity as a coordinator and those are generally termed as coordinator election algorithms. The majority of the existing election algorithms focus on improving the performance measures in particular communication cost [4-6]. As the entities in the system are networked and use message passing technique for communication and execution of distributed election algorithm, electing a reliable entity as a coordinator is a challenge. The unreliable communication channel used in message passing makes the election algorithm vulnerable to security attacks [7, 8] The unauthorized access may result in a security and privacy attack which includes the impersonation and denial of voting attack [9, 10]. *Author for correspondence Unauthorized modifications result in the modification of the election messages and attack on the integrity of the election. In a blockchain-based application, the behavior of any protocol comprises basic steps where a client issues a transaction, a coordinator election protocol determines a coordinator to marshal the transaction and commit on an ordering proposed by the coordinator [11-13]. In such critical blockchainbased applications it is important to implement coordinator election protocol safely. The objective of this work is to select competent candidates for the election process and safely elect a reliable candidate as a coordinator. To achieve this, the authors have proposed a novel algorithm for coordinator election. Consider a distributed network with n nodes where all entities have a unique identity assigned to them as P 1 , P 2 , P 3 ... P n. Each node has a set of attributes associated with it. These nodal attributes for all member nodes are stored in a group view G v at every node. A secure and reliable coordinator election algorithm (SRCEA) is proposed out of which the first

1994

Abstract The problem of leader election in distributed systems is considered. Components communicate by means of bu ered broadcasting as opposed to usual point-to-point communication. In this paper three leader election protocols of increasing maturity are speci ed. We start with a simple leader election protocol, where an initial leader is present. In the second protocol this assumption is dropped. Eventually a fault-tolerant protocol is constructed, where components may crash and revive spontaneously.

Computational Science–ICCS 2008, 2008

IEEE Transactions on Computers, 2003

Link-state routing protocols, such as OSPF and IS-IS, are widely used in the Internet today. In link-state routing protocols, global network topology information is first collected at each node. A shortest path tree (SPT) is then constructed by applying Dijkstra's shortest path algorithm at each node. Link-state protocols usually require the flooding of new information to the entire (sub)network after changes in any link state (including link faults). Narvaez et al. proposed a fault-tolerant link-state routing protocol without flooding. The idea is to construct a shortest restoration path for each unidirectional link fault. Faulty link information is distributed only to the nodes in the restoration path and only one restoration path is constructed. It is shown that this approach is loop-free. However, the Narvaez et al. approach is inefficient when a link failure is bidirectional because a restoration path is unidirectional and routing tables of nodes in the path are partially updated. In addition, two restoration paths may be generated for each bidirectional link fault. In this paper, we extend the Narvaez et al. protocol to efficiently handle a bidirectional link fault by making the restoration path bidirectional. Several desirable properties of the proposed extended routing protocol are also explored. A simulation study is conducted to compare the traditional link-state protocol, the source-tree protocol, the Narvaez et al. unidirectional restoration path protocol, and the proposed bidirectional restoration path protocol.

Computer Communications, 2003

Traditionally, link-state routing (LSR) uses two costly techniques to achieve its robustness and responsiveness: message forwarding on every communication link in the broadcast of network status updates, and the periodic broadcast of local status by every router. In this paper, we present a novel LSR protocol, called Tree-based LSR (T-LSR), which reduces the operational overhead of LSR as follows. A leader router is elected to periodically broadcast network status on behalf of all the other routers in the network, and a spanning tree is constructed to support these broadcasts. The spanning tree is used for most flooding operations, although the protocol reverts to conventional flooding during leader election and spanning tree construction. The T-LSR protocol distinguishes itself from previous tree-based, lightweight LSR methods by its fault-tolerance features: in addition to surviving network partitioning, the T-LSR protocol is shown to maintain consistent routing information and leader preferences throughout the network in the presence of undetected transmission/information corruption problems. The results of a simulation study demonstrate that the T-LSR protocol imposes a small fraction of the overhead of conventional LSR.

International Journal of Communication Systems, 2018

The leader node in a distributed computing system is responsible to establish coordination among all other nodes that are situated apart geographically. Selection of a suitable leader is one of the major and challenging problems. In this paper, a novel leader election algorithm is proposed based on resources of each node in a ring network. All the nodes compute resource strength values by considering available resources like CPU, memory capacity, and residual energy. A node with the highest resource strength over the network is elected as the leader. The proposed algorithm has also considered sudden failure of the nodes particularly when it is the leader node. Moreover, addition of new nodes is also considered. The proposed algorithm shows improvement on message complexity over the network and resource-based priority generation, which helps in efficient election of the leader. To validate, the proposed algorithm is extensively simulated as well as real-life hardware experiment is also done. In the experiment, 2 cases are considered with different weight of the resources, and consequent effects are shown. The results are also compared with the existing algorithms, and it is observed that the proposed work comparably performs better that the existing related algorithms.