A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks

Sakurai, Yusuke; Ooshita, Fukuhito; Masuzawa, Toru

doi:10.1007/11516798_21

Cited by 31 publications

(24 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10], Gandham et al combine the constructive proof of Vizing's theorem with a prioritized locking mechanism to find a (∆ + 1)-edge-coloring for a general network without the fault-tolerant ability. In [24], the authors aim at not only transient faults but also Byzantine faults; they color tree networks with ∆ + 1 colors in three rounds.…”

mentioning

confidence: 99%

“…How to edge color a graph in a distributed or even fault-tolerant way is still an active research topic [10,11,14,15,19,22,24,26]. Because finding an optimal edge coloring (i.e., using the least number of colors) usually involves global operations such as path augmentation, people sometimes prefer using more colors to make the proposed algorithms faster and easier to be comprehended and implemented [7,22], or meet more stringent fault-tolerant criteria, such as Byzantine faults [19,24].…”

mentioning

confidence: 99%

“…Because finding an optimal edge coloring (i.e., using the least number of colors) usually involves global operations such as path augmentation, people sometimes prefer using more colors to make the proposed algorithms faster and easier to be comprehended and implemented [7,22], or meet more stringent fault-tolerant criteria, such as Byzantine faults [19,24]. In [22], Panconesi and Srinivasan propose a randomized algorithm that uses roughly 1.58∆ + log n colors and runs in O(log n) rounds, where n is the number of nodes.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Distributed edge coloration for bipartite networks

Huang

Tzeng

2009

Distrib. Comput.

View full text Add to dashboard Cite

This paper presents a self-stabilizing algorithm to color the edges of a bipartite network such that any two adjacent edges receive distinct colors. The algorithm has the self-stabilizing property; it works without initializing the system. It also works in a de-centralized way without a leader computing a proper coloring for the whole system. Moreover, it finds an optimal edge coloring and its time complexity is O(n 2 k + m) moves, where k is the number of edges that are not properly colored in the initial configuration.

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Distributed edge coloration for bipartite networks

Huang

Tzeng

2009

Distrib. Comput.

View full text Add to dashboard Cite

show abstract

“…The first consists of problems in which the state of each node is determined locally (see [5,6,7]). The other class contains problems such that a node's state requires global knowledge -for example, clock synchronization such that every two nodes' clocks have a bounded difference that is independent of the diameter of the network (see [8,9,4]).…”

Section: Related Workmentioning

confidence: 99%

Byzantine Self-stabilizing Pulse in a Bounded-Delay Model

Dolev

Hoch

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. "Pulse Synchronization" intends to invoke a recurring distributed event at the different nodes, of a distributed system as simultaneously as possible and with a frequency that matches a predetermined regularity. This paper shows how to achieve that goal when the system is facing both transient and permanent (Byzantine) failures. Byzantine nodes might incessantly try to de-synchronize the correct nodes. Transient failures might throw the system into an arbitrary state in which correct nodes have no common notion what-so-ever, such as time or round numbers, and thus cannot use any aspect of their own local states to infer anything about the states of other correct nodes. The algorithm we present here guarantees that eventually all correct nodes will invoke their pulses within a very short time interval of each other and will do so regularly. The problem of pulse synchronization was recently solved in a system in which there exists an outside beat system that synchronously signals all nodes at once. In this paper we present a solution for a bounded-delay system. When the system in a steady state, a message sent by a correct node arrives and is processed by all correct nodes within a bounded time, say d time units, where at steady state the number of Byzantine nodes, f, should obey the n > 3f inequality, for a network of n nodes.

show abstract

“…Usually such solutions can operate in a general graph (see [17], [15] and [14]) without the need to aggregate or accumulate information across the network. In the class of problems in which the state of each correct node is correlated with the state of the other correct nodes, the current paper is the first paper to present a solution that operates in a network that is not fully connected.…”

Section: Introductionmentioning

confidence: 99%

On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

Dolev

Hoch

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Consider a distributed network of n nodes that is connected to a global source of "beats". All nodes receive the "beats" simultaneously, and operate in lock-step. A scheme that produces a "pulse" every Cycle beats is shown. That is, the nodes agree on "special beats", which are spaced Cycle beats apart. Given such a scheme, a clock synchronization algorithm is built. The "pulsing" scheme is self-stabilized despite any transient faults and the continuous presence of up to f < n 3 Byzantine nodes. Therefore, the clock synchronization built on top of the "pulse" is highly fault tolerant. In addition, a highly fault tolerant general stabilizer algorithm is constructed on top of the "pulse" mechanism. Previous clock synchronization solutions, operating in the exact same model as this one, either support f < and have exponential convergence time that also depends on the value of max-clock (the clock wrap around value). The proposed scheme combines the best of both worlds: it converges in linear time that is independent of max-clock and is tolerant to up to f < n 3Byzantine nodes. Moreover, considering problems in a self-stabilizing, Byzantine tolerant environment that require nodes to know the global state (clock synchronization, token circulation, agreement, etc.), the work presented here is the first protocol to operate in a network that is not fully connected.

show abstract

A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks

Cited by 31 publications

References 12 publications

Distributed edge coloration for bipartite networks

Distributed edge coloration for bipartite networks

Byzantine Self-stabilizing Pulse in a Bounded-Delay Model

On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

Contact Info

Product

Resources

About