Optimal Information Dispersal Scheme for Survivable Storage Systems


The KIPS Transactions:PartA, Vol. 10, No. 6, pp. 657-664, Dec. 2003
10.3745/KIPSTA.2003.10.6.657,   PDF Download:

Abstract

Supporting the availability, integrity, and confidentiality of the information is crucial. The survivability storage systems require to encode and distribute data over multiple storage nodes or data base to survive failures and malicious attacks. Information dispersal scheme is one of the most efficient schemes allowing high availability and security with reasonable overhead. In this paper, we propose an algorithm determining the optimal (m, n)-IDS in terms of availability, given a set of IDS´s The proposed algorithm will be very useful for designing a highly available and secure storage system since many factors such as node number, storage space, operation speed, etc. interact with each other and thereby finding an optimal information dispersal scheme is very difficult.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. S. Geun, Y. H. Yong, L. H. Su, L. G. Sin, "Optimal Information Dispersal Scheme for Survivable Storage Systems," The KIPS Transactions:PartA, vol. 10, no. 6, pp. 657-664, 2003. DOI: 10.3745/KIPSTA.2003.10.6.657.

[ACM Style]
Song Seong Geun, Yun Hui Yong, Lee Hyeong Su, and Lee Gang Sin. 2003. Optimal Information Dispersal Scheme for Survivable Storage Systems. The KIPS Transactions:PartA, 10, 6, (2003), 657-664. DOI: 10.3745/KIPSTA.2003.10.6.657.