Abstract
For distributed storage systems the way how the data are replicated and distributed significantly affects availability, security, and performance. Here many factors such as the number of nodes and partitions, replications, node survivability, etc. are interrelated. This paper investigates the availability of Information Dispersal Scheme that can be used for distributed storage system. It will help construct a large distributed system allowing high availability.
This work was supported in part by 21C Frontier Ubiquitous Computing and Networking, Korea Research Foundation Grant (KRF – 2003 – 041 – D20421) and the Brain Korea 21 Project in 2003. Corresponding author: Hee Yong Youn
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Wylie, J.J., Bigrigg, M.W., Strunk, J.D., Ganger, G.R., Kiliccote, H., Khosla, P.K.: Survivable information storage systems. IEEE Computer, 61–68 (2000)
Wylie, J.J., Bakkaloglu, M., Pandurangan, V., Bigrigg, M.W., Oguz, S., Tew, K., Williams, C., Ganger, G.R., Khosla, P.K.: Selecting the Right Data Distribution Scheme for a Survivable Storage System. Technical Report CMU-CS-01-120 Carnegie Mel-lon University (2001)
Choi, S.J., Youn, H.Y., Choi, J.S.: An Efficient Dispersal and Encryp-tion Scheme for Secure Distributed formation Storage. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2659, pp. 958–967. Springer, Heidelberg (2003)
Rabin, M.O.: Efficient Dispersal of Information for Security. In: Load Balancing and Fault Tolerance, pp. 335–348. ACM, New York (1989)
Shamir, A.: How to Share a Secret. Comm. ACM, 612–613 (1979)
Blakley, G.R.: Catherine Meadows: Security of ramp scheme. In: Advances in Cryptology, pp. 242–268. Springer, Heidelberg (1985)
Karnin, E., Greene, J., Hellman, M.: On Secret Sharing Systems. IEEE Trans. Informa-tion Theory, 35–41 (1983)
De Santis, A., Masucci, B.: Multiple Ramp Schemes. IEEE Trans. Information Theory, 1720–1728 (1999)
Song, S.K., Youn, H.Y., Park, J.K.: Deciding Optimal Information Dispersal for Parallel Computing with Failures. In: International Conference on Parallel Computing Technologies, pp. 332–335. Springer, Heidelberg (2003)
Sun, H.-M., Shieh, S.-P.: Optimal Information Dispersal for Increasing the Reliability of a Distributed Service. IEEE Trans. 46, 462–472 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, S.K., Youn, H.Y., Park, GL., Tae, K.S. (2004). On the Availability of Information Dispersal Scheme for Distributed Storage Systems. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24685-5_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-24685-5_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22114-2
Online ISBN: 978-3-540-24685-5
eBook Packages: Springer Book Archive