WEKO3
アイテム
Analysis of Probabilistic Trapezoid Protocol for Data Replication
https://ipsj.ixsq.nii.ac.jp/records/9561
https://ipsj.ixsq.nii.ac.jp/records/9561f9f65204-7396-44ed-b2dd-d439fbb37328
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL4906031.pdf (634.7 kB)
|
Copyright (c) 2008 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2008-06-15 | |||||||
| タイトル | ||||||||
| タイトル | Analysis of Probabilistic Trapezoid Protocol for Data Replication | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Analysis of Probabilistic Trapezoid Protocol for Data Replication | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 特集：ディペンダブル情報処理 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| その他タイトル | ||||||||
| その他のタイトル | フォールトトレランス | |||||||
| 著者所属 | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属 | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属 | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属 | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属 | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Tokyo Metropolitan University | ||||||||
| 著者名 |
Tabito, Suzuki
× Tabito, Suzuki
|
|||||||
| 著者名(英) |
Tabito, Suzuki
× Tabito, Suzuki
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Maintaining replicated data between nodes can improve the dependability of data. We propose a probabilistic trapezoid protocol for replicated data that combines the trapezoid protocol with the concept of a probabilistic quorum system. We analyzed the read availability the latest version's read availability and the average number of nodes accessed for the protocol. Our numerical evaluations demonstrated that it improves not only the read availability but also the latest version's read availability. Furthermore when the number of nodes is greater than 100 it could effectively reduce the system's load. We designed and implemented a file transfer protocol to replicate data. Experimental results proved that the trapezoid protocol could achieve a better throughput than the voting system or the grid protocol. Despite node failure the probabilistic trapezoid protocol also achieved a relatively better throughput. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Maintaining replicated data between nodes can improve the dependability of data. We propose a probabilistic trapezoid protocol for replicated data that combines the trapezoid protocol with the concept of a probabilistic quorum system. We analyzed the read availability, the latest version's read availability and the average number of nodes accessed for the protocol. Our numerical evaluations demonstrated that it improves not only the read availability but also the latest version's read availability. Furthermore, when the number of nodes is greater than 100, it could effectively reduce the system's load. We designed and implemented a file transfer protocol to replicate data. Experimental results proved that the trapezoid protocol could achieve a better throughput than the voting system or the grid protocol. Despite node failure, the probabilistic trapezoid protocol also achieved a relatively better throughput. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 49, 号 6, p. 2092-2105, 発行日 2008-06-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
