Broadcasting in Hypercubes with Randamly Distributed Byzantine Faults
スポンサーリンク
概要
- 論文の詳細を見る
本論文ではランダムに分布しているビザンチンタイプの故障を有するn次元ハイパーキューブ上でのブロードキャストについて論じる。BC1-n-cubeとよばれる方式では、f個のビザンチンタイプの故障がノードまたは結線にランダムに分布している時、2nラウンド内で全ての健善なノードから全ての目的ノードへのブロードキャストが成功する確率は1-(64nf, 2^n)^[n/2]>以上である。故障が結線にだけ存在する場合、BC2-n-cubeと呼ばれる方式を提案する。この方式では、故障結線の割合が高々1/48kの時2n^2ラウンド内でブロードキャストが成功する確率は1-nk-^[n/2]>以上である。
- 社団法人電子情報通信学会の論文
- 1994-10-21
著者
-
Bao F
National Univ. Sinpapore Singapore
-
Igarashi Yoshihide
Department of Computer Science, Gunma University
-
Bao Feng
Department of Computer Science Gunma University
-
Katano Keiko
Department of Computer Science,Faculty of Engineering,Gunma University
-
Katano Keiko
Faculty Of Engineering Gunma University
-
Igarashi Y
Gunma Univ. Kiryu‐shi Jpn
-
Igarashi Yoshihide
Department Of Computer Science Gunma University
関連論文
- Information Disseminating Schemes and Their Fault Tolerance in Hypercubes
- A More Efficient Improvement of the Virtual Software Token Protocols (Fundamental Theories for Communications)
- Security Notes on Generalization of Threshold Signature and Authenticated Encryption(Information Security)
- Optimal Time Broadcasting Schemes in Faulty Star Graphs (Special Section on Discrete Mathematics and Its Applications)
- Reliable Broadcasting and Secure Distributing in Channel Networks(Special Section on Discrete Mathematics and Its Applications)
- Independent Spanning Trees of Product Graphs and Their Construction
- Independent Spanning Trees of Product Graphs and Their Construction
- Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs (Special Section on Discrete Mathematics and Its Applications)
- Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults
- Broadcasting in Hypercubes with Randamly Distributed Byzantine Faults
- Embeddings of Hyper-Rings in Hypercubes
- REMARKS ON REAL-TIME DETERMINISTIC CONTEXT-FREE LANGUAGES(Mathematical Theories on Computing Schemes and Their Applications)
- Roughly Sorting: Sequential and Parallel Approach
- Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model (Special Issue on Selected Papers from LA Symposium)
- Highly Concurrent Group Mutual Exclusion Algorithms Based on Ticket Ordersl(Foundations of Computer Science)
- Construction of Secret Key Exchange Spanning Trees by Random Deals of Cards on Hierarchical Structures (Special Section on Discrete Mathematics and Its Applications)
- Secure Multi-Party Computation over Networks(Special Issue on Algorithm Engineering : Surveys)
- Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
- Roughly Sorting: A Generalization of Sorting