Information Security on the Logistical Network: An End-to-End Approach
SISW '03 Proceedings of the Second IEEE International Security in Storage Workshop
On the Optimal Placement of Secure Data Objects over Internet
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Allocating Fragments in Distributed Databases
IEEE Transactions on Parallel and Distributed Systems
Dependable and secure distributed storage system for ad hoc networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Data-centric privacy protocol for intensive care grids
IEEE Transactions on Information Technology in Biomedicine
A demand based fault tolerant file replication model for clouds
Proceedings of the CUBE International Information Technology Conference
A synchronized design technique for efficient data distribution
Computers in Human Behavior
| Hi-index | 0.00 |
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.