A Secure File Allocation Algorithm for Heterogeneous Distributed Systems

In this study we develop a secure allocating processing(SAP) algorithm for the S-FAS scheme [13] to improve the security level and consider its performance using the heterogeneous feature of a large distributed system. The SAP allocation algorithm considers load balancing, delayed effects caused by the workload variance of many consecutive requests, and the heterogeneous feature of the storage nodes in the system. We develop a prototype using the multi-threading technique for the S-FAS scheme with the SAP algorithm to guide the file allocation. We did some experiments and the results show that the proposed solution can not only improve the security level, but also improve the throughput of the distributed storage system with heterogeneous vulnerabilities by using the multi-thread technique.

[1]  Gerhard Weikum,et al.  Data partitioning and load balancing in parallel disk systems , 1998, The VLDB Journal.

[2]  Gregory A. Koenig,et al.  Clusters and security: distributed security for distributed systems , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[3]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[4]  Li Xiao,et al.  Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands , 2002, IEEE Trans. Parallel Distributed Syst..

[5]  Pradeep K. Khosla,et al.  Survivable Information Storage Systems , 2000, Computer.

[6]  Bhavani M. Thuraisingham,et al.  Secure Data Objects Replication in Data Grid , 2010, IEEE Transactions on Dependable and Secure Computing.

[7]  Peter Scheuermann,et al.  File Assignment in Parallel I/O Systems with Minimal Variance of Service Time , 2000, IEEE Trans. Computers.

[8]  Rahul Simha,et al.  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems , 1989, IEEE Trans. Computers.

[9]  Sushil Jajodia,et al.  Secure Dynamic Fragment and Replica Allocation in Large-Scale Distributed File Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[10]  Dan Boneh,et al.  Building intrusion tolerant applications , 1999, Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00.

[11]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.

[12]  Yiming Yang,et al.  Secure Fragment Allocation in a Distributed Storage System with Heterogeneous Vulnerabilities , 2011, 2011 IEEE Sixth International Conference on Networking, Architecture, and Storage.

[13]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[14]  Tom W. Keller,et al.  Data placement in Bubba , 1988, SIGMOD '88.

[15]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[16]  Anthony T. Chronopoulos,et al.  Static load balancing for CFD simulations on a network of workstations , 2001, Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001.

[17]  Luigi V. Mancini,et al.  Towards a secure dynamic allocation of files in large scale distributed file systems , 2004 .

[18]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.