Design and Implementation of a Efficient Storage Virtualization System based on Distributed Hash Tables


Jong-Hyeon Kim, Sang-Jun Lee, Journal of Information Processing Systems Vol. 10, No. 3, pp. 103-112, Jun. 2009  


Keywords: P2P, Distributed Hash Tables, Virtualization
Fulltext:

Abstract

This paper proposes an efficient storage virtualization system which allows users to view hard disk resources of numerous nodes as a large logical space using distributed hash tables of P2P techniques. The proposed system is developed at device level of Windows operating system and is suitable for users in Intranet environments. This system is developed to be recognized as one hard disk at the Windows explorer for user conveniences and does not need a supplementary client program at the application layer. In addition, it enhances security via cutting off breaches from external networks.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 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
[APA Style]
Kim, J. & Lee, S. (2009). Design and Implementation of a Efficient Storage Virtualization System based on Distributed Hash Tables. Journal of Internet Computing and Services, 10(3), 103-112.

[IEEE Style]
J. Kim and S. Lee, "Design and Implementation of a Efficient Storage Virtualization System based on Distributed Hash Tables," Journal of Internet Computing and Services, vol. 10, no. 3, pp. 103-112, 2009.

[ACM Style]
Jong-Hyeon Kim and Sang-Jun Lee. 2009. Design and Implementation of a Efficient Storage Virtualization System based on Distributed Hash Tables. Journal of Internet Computing and Services, 10, 3, (2009), 103-112.