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.
論文 | ランダム
- 低消費電力・低アスペクト比半導体レーザ(光部品の実装・信頼性,一般)
- 低消費電力・低アスペクト比半導体レーザ(光部品の実装・信頼性,一般)
- 21pXB-5 結晶性高分子の高次構造形成(21pXB 領域9,領域12合同シンポジウム:ソフトコンデンスドマターの結晶成長,領域9(表面・界面,結晶成長))
- 21pXB-5 結晶性高分子の高次構造形成(21pXB 領域9,領域12合同シンポジウム:ソフトコンデンスドマターの結晶成長,領域12(ソフトマター物理,化学物理,生物物理))
- AFMでみる結晶性高分子のモルフォロジー