WEKO3
アイテム
Doubly-Expedited One-Step Byzantine Consensus
https://nitech.repo.nii.ac.jp/records/5909
https://nitech.repo.nii.ac.jp/records/590995dd0c3d-2051-45cd-bf65-5f37a6bd9097
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
本文_fulltext (200.1 kB)
|
(c)2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
|
| Item type | 会議発表論文 / Conference Paper(1) | |||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-06-25 | |||||||||||||||||
| タイトル | ||||||||||||||||||
| タイトル | Doubly-Expedited One-Step Byzantine Consensus | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| 言語 | ||||||||||||||||||
| 言語 | eng | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 言語 | en | |||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | Distributed Algorithm | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 言語 | en | |||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | Byzantine Agreement | |||||||||||||||||
| 資源タイプ | ||||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||||||||||||||
| 資源タイプ | conference paper | |||||||||||||||||
| 著者 |
Banu, Nazreen
× Banu, Nazreen
× 泉, 泰介
× Wada, Koichi
|
|||||||||||||||||
| 著者別名 | ||||||||||||||||||
| 識別子Scheme | WEKO | |||||||||||||||||
| 識別子 | 8720 | |||||||||||||||||
| 識別子Scheme | NRID | |||||||||||||||||
| 識別子URI | http://rns.nii.ac.jp/nr/1000020432461 | |||||||||||||||||
| 識別子 | 1000020432461 | |||||||||||||||||
| 姓名 | Izumi, Taisuke | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| 姓名 | 泉, 泰介 | |||||||||||||||||
| 言語 | ja | |||||||||||||||||
| 姓名 | イズミ, タイスケ | |||||||||||||||||
| 言語 | ja-Kana | |||||||||||||||||
| 姓 | Izumi | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| 姓 | 泉 | |||||||||||||||||
| 言語 | ja | |||||||||||||||||
| 姓 | イズミ | |||||||||||||||||
| 言語 | ja-Kana | |||||||||||||||||
| 名 | Taisuke | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| 名 | 泰介 | |||||||||||||||||
| 言語 | ja | |||||||||||||||||
| 名 | タイスケ | |||||||||||||||||
| 言語 | ja-Kana | |||||||||||||||||
| 著者別名 | ||||||||||||||||||
| 識別子Scheme | WEKO | |||||||||||||||||
| 識別子 | 8926 | |||||||||||||||||
| 姓名 | 和田, 幸一 | |||||||||||||||||
| 書誌情報 |
en : Proceedings of the 2010 IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) p. 373-382, 発行日 2010-04-09 |
|||||||||||||||||
| 出版者 | ||||||||||||||||||
| 出版者 | Institute of Electrical and Electronics Engineers Computer Society | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| ISBN | ||||||||||||||||||
| 識別子タイプ | ISBN | |||||||||||||||||
| 関連識別子 | 9781424475018 | |||||||||||||||||
| 著者版フラグ | ||||||||||||||||||
| 出版タイプ | AM | |||||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||||
| DOI | ||||||||||||||||||
| 関連タイプ | isVersionOf | |||||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||||
| 関連識別子 | http://dx.doi.org/10.1109/DSN.2010.5544293 | |||||||||||||||||
| 関連名称 | 10.1109/DSN.2010.5544293 | |||||||||||||||||
| 内容記述 | ||||||||||||||||||
| 内容記述タイプ | Other | |||||||||||||||||
| 内容記述 | It is known that Byzantine consensus algorithms guarantee one-step decision only in favorablesituations (e.g. when all processes propose the same value) and no one-step algorithm can support two-step decision. This paper presents DEX, a novel one-step Byzantine algorithm that circumvents theseimpossibilities using the condition-based approach. Algorithm DEX has two distinguished features:Adaptiveness and Double-expedition property. Adaptiveness makes it sensitive to only actual numberof failures so that it provides fast termination for more number of inputs when there are fewer failures (acommon case in practice). The double-expedition property facilitates two-step decision in addition toone-step decision by running two condition-based mechanisms in parallel. To the best of our knowledge,double-expedition property is the new concept introduced by this paper, and DEX is the ￣rst algorithmhaving such a feature. Although DEX takes four steps at worst in well-behaved runs while existingone-step algorithms take only three, it is expected to work efficiently because the worst-case does notoccur so often in practice. | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| 内容記述 | ||||||||||||||||||
| 内容記述タイプ | Other | |||||||||||||||||
| 内容記述 | This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.Proceedings on The 40th Annual IEEE/IFIP International Conference on Dependable Systems and Networks | |||||||||||||||||
| 言語 | en | |||||||||||||||||
