Autonomous distributed secret sharing storage system
โ Scribed by Toshiyuki Miyamoto; Shinji Doi; Hiroki Nogawa; Sadatoshi Kumagai
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 612 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
A safe and durable storage system is essential for mission critical and safe critical operations. In this paper, the authors propose a distributed storage system that uses the (k, n) threshold scheme. Using the (k, n) threshold scheme enables robustness to network problems or data loss due to disk failures to be increased and data secrecy to be improved at the same time. Since the authors have already developed agents for implementing the basic functions for realizing the distributed storage system, they introduce them here. ยฉ 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 37(6): 55โ63, 2006; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20388
๐ SIMILAR VOLUMES
There have been many studies of load balancing in computer systems, for which various algorithms have been proposed. The load balancing methods to date can largely be divided into two types. In the first method, the load information is exchanged among the nodes, and the loads of the nodes are balanc