WEKO3
アイテム
On the probabilistic omission adversary
https://nitech.repo.nii.ac.jp/records/3581
https://nitech.repo.nii.ac.jp/records/3581bd706f43-5b64-4f9d-bf3d-dec379397585
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
本文_fulltext (138.7 kB)
|
Copyright 2007 Springer-Verlag The final publication is available at www.springerlink.com.
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-06-25 | |||||||||||||||
| タイトル | ||||||||||||||||
| タイトル | On the probabilistic omission adversary | |||||||||||||||
| 言語 | en | |||||||||||||||
| 言語 | ||||||||||||||||
| 言語 | eng | |||||||||||||||
| 資源タイプ | ||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||
| 資源タイプ | journal article | |||||||||||||||
| 著者 |
泉, 泰介
× 泉, 泰介
× Wada, Koichi
|
|||||||||||||||
| 著者別名 | ||||||||||||||||
| 姓名 | Izumi, Taisuke | |||||||||||||||
| 言語 | en | |||||||||||||||
| 姓名 | 泉, 泰介 | |||||||||||||||
| 言語 | ja | |||||||||||||||
| 姓名 | イズミ, タイスケ | |||||||||||||||
| 言語 | ja-Kana | |||||||||||||||
| 著者別名 | ||||||||||||||||
| 姓名 | wada, koichi | |||||||||||||||
| bibliographic_information |
en : Proceedings of the 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Lecture Notes in Computer Science 巻 4838/2007, p. 357-371, 発行日 2007 |
|||||||||||||||
| 出版者 | ||||||||||||||||
| 出版者 | Springer Verlag | |||||||||||||||
| 言語 | en | |||||||||||||||
| ISSN | ||||||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||||||
| 収録物識別子 | 0302-9743 | |||||||||||||||
| ISBN | ||||||||||||||||
| 識別子タイプ | ISBN | |||||||||||||||
| 関連識別子 | 9783540766261 | |||||||||||||||
| item_10001_relation_32 | ||||||||||||||||
| 識別子タイプ | NCID | |||||||||||||||
| 関連識別子 | BA83981944 | |||||||||||||||
| 出版タイプ | ||||||||||||||||
| 出版タイプ | AM | |||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||
| item_10001_relation_34 | ||||||||||||||||
| 関連タイプ | isVersionOf | |||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||
| 関連識別子 | http://dx.doi.org/10.1007/978-3-540-76627-8_27 | |||||||||||||||
| 関連名称 | 10.1007/978-3-540-76627-8_27 | |||||||||||||||
| 内容記述 | ||||||||||||||||
| 内容記述タイプ | Other | |||||||||||||||
| 内容記述 | This paper newly proposes a novel round-based synchronoussystem suffering crash and probabilistic omission failures. In this model,a novel class of adversaries, called p-probabilistic omission adversary (p-POA) is introduced. In addition to the ability of complete control of thecrash-failure behavior, p-POA can select any subset of all transmittedmessages as omission candidates. Then, each message in the omissioncandidates is lost with probability p. This paper investigates the feasiblityand complexity of the consensus problem under p-POA. We firstshow two impossibility results that (1) for any p > 0, there exists nouniform consensus algorithm tolerating more than or equal to n/2 crashfailures, and that (2) for any p > 0, any uniform consensus algorithmcannot halt. We also show two consensus algorithms CPO and F-CPO.Both algorithms work under (1/2)-POA and respectively have distinctadvantages. The algorithm CPO can tolerate at most n/2 ! 1 crash failuresand achieves O(f) expected round complexity, where f is the actualnumber of crash failures. This implies that CPO has maximum crashfailureresiliency. While the second algorithm F-CPO assumes the maximumnumber of crash failures less than n/3, it achieves f + O(1) roundcompexity in expectation. Since it is known that the lower bound forcrash-tolerant consensus is f +1, this result implies that only a constantnumber of extra rounds is nessesary to tolerate a drastic number of messageomissions. | |||||||||||||||
| 言語 | en | |||||||||||||||
