Analyzing Eventual Leader Election Protocols for Dynamic Systems by Probabilistic Model Checking

Gu, Jiayi; Zhou, Yu; Wu, Weigang; Chen, Taolue

doi:10.1007/978-3-319-27051-7_17

Cited by 3 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different from ours, the quantitative aspect of verification is mainly conducted based on statistical verification, which is essentially a simulation-based approach. The quantitative analysis of eventual leader election protocols by probabilistic model checking were conducted in [5,13,20]. But in all these works, either they only dealt with the static environment settings [5,20], or they did not consider the hierarchical cluster based system models [13].…”

Section: Related Workmentioning

confidence: 99%

“…The quantitative analysis of eventual leader election protocols by probabilistic model checking were conducted in [5,13,20]. But in all these works, either they only dealt with the static environment settings [5,20], or they did not consider the hierarchical cluster based system models [13].…”

Section: Related Workmentioning

confidence: 99%

“…PRISM is a leading open-source model checker and has been applied in many fields, such as communication protocols, distributed algorithms and some other systems of specific subjects like biology. The paper is based on our previous work on the design of hierarchical eventual leader election protocols for dynamic systems [9] and probabilistic analysis of regular leader election protocols without cluster hierarchies [13]. In this paper, we make the following contributions:…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Probabilistic verification of hierarchical leader election protocol in dynamic systems

Zhou

Han

et al. 2018

Front. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Leader election protocols are fundamental for coordination problems-such as consensus-in distributed computing. Recently, hierarchical leader election protocols have been proposed for dynamic systems where processes can dynamically join and leave, and no process has global information. However, quantitative analysis of such protocols is generally lacking. In this paper, we present a probabilistic model checking based approach to verify quantitative properties of these protocols. Particularly, we employ the compositional technique in the style of assume-guarantee reasoning such that the sub-protocols for each of the two layers are verified separately and the correctness of the whole protocol is guaranteed by the assume-guarantee rules. Moreover, within this framework we also augment the proposed model with additional features such as rewards. This allows the analysis of time or energy consumption of the protocol. Experiments have been conducted to demonstrate the effectiveness of our approach.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic verification of hierarchical leader election protocol in dynamic systems

Zhou

Han

et al. 2018

Front. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

Analyzing leader election protocol by probabilistic model checking

Yang

2016

2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)

View full text Add to dashboard Cite

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

Analyzing Eventual Leader Election Protocols for Dynamic Systems by Probabilistic Model Checking

Cited by 3 publications

References 23 publications

Probabilistic verification of hierarchical leader election protocol in dynamic systems

Probabilistic verification of hierarchical leader election protocol in dynamic systems

Analyzing leader election protocol by probabilistic model checking

Head Node Selection Algorithm in Cloud Computing Data Center

Contact Info

Product

Resources

About