A new parameter for a broadcast algorithm with locally bounded Byzantine faults

スポンサーリンク

概要

• 論文の詳細を見る

• This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a certified propagation algorithm (CPA), which is the only algorithm we know that does not use any global knowledge of the network topology. Hence, it is worth focusing on a graph-theoretic parameter such that CPA will work correctly. Using the theory of maximum adjacency (MA) ordering, a new graph-theoretic parameter for CPA is proposed. Within a factor of two, this parameter approximates the largest t such that CPA works for t-locally bounded Byzantine faults.

論文 | ランダム

• 日本人が間違えやすいドイツ語の発音 (日本人の間違えやすい外国語(その3))
• 日本人歯周炎患者におけるマトリックスメタロプロテイナーゼ-1,及び-3 遺伝子多型の解析
• Canonical stratification of non-degenerate complete intersection varieties
• 白桃缶詰赤肉変色防止に関する研究-1・2-
• On the fundamental group of the complement of certain plane curves

もっと見る

スポンサーリンク