Optimal information-dispersal for increasing the reliability of a distributed service
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
472 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
462 | en_US |
dc.citation.volume |
46 | en_US |
dc.citation.woscount |
5 | |
dc.contributor.author |
Sun, HM | en_US |
dc.contributor.author |
Shieh, SP | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:01:18Z | |
dc.date.available |
2014-12-08T15:01:18Z | |
dc.date.issued |
1997-12-01 | en_US |
dc.description.abstract |
This paper investigates the (m,n) information dispersal scheme (IDS) used to support fault-tolerant distributed servers in a distributed system. In an (m, n)-IDS, a file M is broken into n pieces such that any m pieces collected suffice for reconstructing M. The reliability of an (m, n)-IDS is primarily determined by 3 important factors: n = information dispersal degree (IDD), n/m = information expansion ratio (IER), P-a = success-probability of acquiring a correct piece. It is difficult to determine the optimal IDS with the highest reliability from very many choices. Our analysis shows: several novel features of (m, n)-IDS which can help reduce the complexity of finding the optimal IDS with the highest reliability; that an IDS with a higher IER might not have a higher reliability, even when P-s-->1. Based on the theorems given herein, we have developed a method that reduces the complexity for computing the highest reliability from, O(v) [v = number of servers] to O(1) when the 'upper bound of the IER' = 1, or O(v(2)) to O(1) when the 'upper bound of the IER' > 1. | en_US |
dc.identifier.doi |
10.1109/24.693779 | en_US |
dc.identifier.issn |
0018-9529 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON RELIABILITY | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/24.693779 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/179 | |
dc.identifier.wosnumber |
WOS:000073757700006 | |
dc.language.iso |
en_US | en_US |
dc.subject |
fault tolerance | en_US |
dc.subject |
security | en_US |
dc.subject |
threshold scheme | en_US |
dc.subject |
distributed server | en_US |
dc.subject |
data storage | en_US |
dc.title |
Optimal information-dispersal for increasing the reliability of a distributed service | en_US |
dc.type |
Article | en_US |
檔案
- 000073757700006.pdf (903.4 KB, Adobe PDF)
所屬典藏: 期刊論文