Eventual strong consensus with fault detection in the presence of dual failure mode on processors under dynamic networks

Cheng, Chien-Fu; Tsai, Kuo-Tang

doi:10.1016/j.jnca.2012.01.011

Cited by 9 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of faulty processors can be tolerated is depended on the failure types of the fallible processors [3]. The symptoms of a fallible processor include crash, omission and malicious.…”

Section: The Definitions and Conditionsmentioning

confidence: 99%

Obtaining consistent good/bad plan set in the presence of faults

Cheng

2013

2013 IEEE Wireless Communications and Networking Conference (WCNC)

Self Cite

View full text Add to dashboard Cite

In a cooperative network, we need a mechanism that allows all correct processors to reach a common agreement. Hence, more and more attention has been drawn on the agreement related problems (Byzantine Agreement (BA) problem and Consensus problem). In previous results, the goal of BA and Consensus is obtaining a common value no matter this value is good or bad. To address this problem, Correia, Bessani and Veríssimo proposed the Byzantine Generals with Alternative Plans (BGAP) protocol that requires the common value come from the good plan set. BGAP is a graceful and practical protocol. They also pointed out that the BA problem with alternative plans is unsolvable if correct processors have different good plans and bad plans. In this paper, we propose the Plan_Consensus Protocol (PCP) to ensure that all correct processors obtain a consistent good plan set and a consistent bad plan set in the network.

show abstract

Section: The Definitions and Conditionsmentioning

confidence: 99%

Obtaining consistent good/bad plan set in the presence of faults

Cheng

2013

2013 IEEE Wireless Communications and Networking Conference (WCNC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The dynamicity of dynamic systems lies in frequent topology changes due to node mobility 1,2 and/or changes of node set due to node joining/leaving. 3 A dynamic system focusing on topology changes is also referred to as ''dynamic network.'' 4,5 Quite a lot of work has been done for dynamic networks.…”

Section: Introductionmentioning

confidence: 99%

(Q, S)-distance model and counting algorithms in dynamic distributed systems

Yang

Chen

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

With the advance in mobile network-based systems, dynamic system has become one of the hotspots in fundamental study of distributed systems. In this article, we consider the dynamic system with frequent topology changes arising from node mobility or other reasons, which is also referred to as ''dynamic network.'' With the model of dynamic network, fundamental distributed computing problems, such as information dissemination and election, can be formally studied with rigorous correctness. Our work focuses on the node counting problem in dynamic environments. We first define two new dynamicity models, named (Q, S)-distance and (Q, S)*-distance, which describe dynamic changes of information propagation time against topology changes. Based on these two models, we design three different counting algorithms which basically adopt the approach of diffusing computation. These algorithms mainly differ in communication cost due to different information collection procedures. The correctness of all the algorithms is formally proved and their performance is evaluated via both theoretical analysis and experimental simulations.

show abstract

“…38]. The main contributions of this paper are summarized as follows: (1) We design a consensus protocol for SDN with multiple-controller architecture (2).…”

mentioning

confidence: 99%

Reaching Consensus with Byzantine Faulty Controllers in Software‐Defined Networks

Cheng

Lin

Srivastava

et al. 2021

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

The combination of the Internet of Things (IoT) and Cloud computing are both popular applications that are based on the Internet. However, the traditional networking structure can no longer support the transmission of the huge number of packets required by cloud computing and IoT. Therefore, a new-generation architecture, software-defined networking (SDN), came into being. The new-generation SDN can control routing through software, making flexible and convenient management a key feature of SDN. However, attacks and threats are prevalent in today’s networking environment. When an SDN controller encounters a hacker attack or virus infection, it will not function properly. Hence, we need to design a fault-tolerant mechanism for the above environment. In this paper, a fault-tolerant consensus protocol is proposed to improve the fault tolerance of SDNs with multiple controllers.

show abstract

Eventual strong consensus with fault detection in the presence of dual failure mode on processors under dynamic networks

Cited by 9 publications

References 23 publications

Obtaining consistent good/bad plan set in the presence of faults

Obtaining consistent good/bad plan set in the presence of faults

(Q, S)-distance model and counting algorithms in dynamic distributed systems

Reaching Consensus with Byzantine Faulty Controllers in Software‐Defined Networks

Contact Info

Product

Resources

About