The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We present a distributed algorithm for file allocation that guarantees high assurance, availability, and scalability in a large distributed file system. The algorithm can use replication and fragmentation schemes to allocate the files over multiple servers. The file confidentiality and integrity are preserved, even in the presence of a successful attack that compromises a subset of the file servers. The algorithm is adaptive in the sense that it changes the file allocation as the read-write patterns and the location of the clients in the network change. We formally prove that, assuming read-write patterns are stable, the algorithm converges toward an optimal file allocation, where optimality is defined as maximizing the file assurance.</p>
File system security, replication, fragmentation, distributed systems, peer-to-peer algorithms, assurance.

A. Mei, L. V. Mancini and S. Jajodia, "Secure Dynamic Fragment and Replica Allocation in Large-Scale Distributed File Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 14, no. , pp. 885-896, 2003.
93 ms
(Ver 3.3 (11022016))