Election in unidirectional rings with homonyms

Altisen, Karine; Datta, Ajoy K.; Devismes, Stéphane; Durand, Anaïs; Larmore, Lawrence L.

doi:10.1016/j.jpdc.2020.08.004

Cited by 4 publications

(13 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [11] the authors propose a necessary and sufficient condition on the number of distinct labels in bidirectional homonym rings to solve leader election. Later, [2] generalizes the previous result by establishing impossibility results for leader election in some unidirectional homonym rings. Note that the impossibility results of [11] and [2] are established for general distributed algorithms, without any self-stabilization requirements.…”

Section: Related Worksupporting

confidence: 66%

See 1 more Smart Citation

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms

Blin¹,

Feuilloley²,

Bouder³

2023

Discrete Mathematics &Amp; Theoretical Computer Science

View full text Add to dashboard Cite

Given a boolean predicate $\Pi$ on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for $\Pi$ is a distributed algorithm that can start from any initial configuration of the network (i.e., every node has an arbitrary value assigned to each of its variables), and eventually converge to a configuration satisfying $\Pi$. It is known that leader election does not have a deterministic self-stabilizing algorithm using a constant-size register at each node, i.e., for some networks, some of their nodes must have registers whose sizes grow with the size $n$ of the networks. On the other hand, it is also known that leader election can be solved by a deterministic self-stabilizing algorithm using registers of $O(\log \log n)$ bits per node in any $n$-node bounded-degree network. We show that this latter space complexity is optimal. Specifically, we prove that every deterministic self-stabilizing algorithm solving leader election must use $\Omega(\log \log n)$-bit per node registers in some $n$-node networks. In addition, we show that our lower bounds go beyond leader election, and apply to all problems that cannot be solved by anonymous algorithms.

show abstract

Section: Related Worksupporting

confidence: 66%

“…Later, [2] generalizes the previous result by establishing impossibility results for leader election in some unidirectional homonym rings. Note that the impossibility results of [11] and [2] are established for general distributed algorithms, without any self-stabilization requirements.…”

Section: Related Worksupporting

confidence: 66%

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms

Blin¹,

Feuilloley²,

Bouder³

2023

Discrete Mathematics &Amp; Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Suppose node 2 initiates the election. So node 2 creates an election-initiating message (EIM [2,2]) and sends it to the adjacent nodes i.e., nodes 0, 1 and 3 (as shown in Fig. 1 (b)).…”

Section: Illustrative Examplementioning

confidence: 99%

“…1 (b)). After receiving the EIM [2,2], each of nodes 0, 1 and 3 creates an acknowledgment message i.e., ACK[2, 0], ACK[2, 1] and ACK[2, 3] respectively and sends it to node 2. Nodes 0, 1 and 3 consider node 2 as their parent node and store Id 2 in pnode 0 , pnode 1 and pnode 3 respectively.…”

Section: Illustrative Examplementioning

confidence: 99%

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Biswas,

Singh,

Baranwal

et al. 2023

Preprint

View full text Add to dashboard Cite

Cloud computing, edge computing, replicated databases, and various modern technologies are adopting distributed computing concepts for a reliable, high-performance, large-scale computational platform. In distributedcomputing, leader election is a fundamental problem because the elected leader helps coordinate andutilize the resources efficiently. Several state-of-the-art works mentioned that a good quality leader is essentialas it improves system performance, simplifies management procedures, reduces coordinational complexity, andmakes the system more fault-tolerant. However, designing a self-stabilizing leader election algorithm with weakassumptions in a failure-prone distributed environment is challenging. This paper proposes a multi-attributebased,self-stabilizing, network partition-tolerant leader election method for failure-prone distributed systems.Here, based on the system requirements, the pertinent attributes of a good quality leader are identified and assignedweights according to their importance. Then the identified attributes and their weight are used to elect asuitable node as the leader.We show that the algorithm is self-stabilizing and can tolerate multiple nodes and linkfailures. Further, we analyze the proposed algorithm’s time, communication, and bit complexities. We consider adistributed database system scenario to simulate the proposed method and compare it with existing approachesto evaluate and validate the proposed method’s performance and the elected leader’s quality.

show abstract

“…Moreover, the approach in [43] had the leader election complexity of O(k2n2), where n was presenting the total nodes and k was an upper bound value on the multiplicity of the labels. Similarly, in [46], a methodology for nominating the leader node was presented.…”

Section: Related Workmentioning

confidence: 99%

Head Node Selection Algorithm in Cloud Computing Data Center

Kanwal

Iqbal

Irtaza

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes’ selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they select the head nodes without taking the resources of the nodes. Still, there is a need for the candidate node which can be selected as a head node in case of head node failure. Therefore, in this paper, we proposed a technique, i.e., Head Node Selection Algorithm (HNSA), for optimal head node selection from the data center, which is based on the genetic algorithm (GA). In our proposed method, there are three modules, i.e., initial population generation, head node selection, and candidate node selection. In the first module, we generate the initial population by randomly mapping the task on different servers using a scheduling algorithm. After that, we compute the overall cost and the cost of each node based on resources. In the second module, the best optimal nodes are selected as a head node by applying the genetic operations such as crossover, mutation, and fitness function by considering the available resources. In the selected optimal nodes, one node is chosen as a head node and the other is considered as a candidate node. In the third module, the candidate node becomes the head node in the case of head node failure. The proposed method HNSA is compared against the state-of-the-art algorithms such as Bees Life Algorithm (BLA) and Heterogeneous Earliest Finished Time (HEFT). The simulation analysis shows that the proposed HNSA technique performs better in terms of execution time, memory utilization, service level sgreement (SLA) violation, and energy consumption.

show abstract

Election in unidirectional rings with homonyms

Cited by 4 publications

References 31 publications

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Head Node Selection Algorithm in Cloud Computing Data Center

Contact Info

Product

Resources

About