Erasure coding is a storage-efficient alternative to replication for achieving reliable data backup in distributed storage systems. During the storage process, traditional erasure codes require a unique source node to create and upload all the redundant data to the different storage nodes. However, such a source node may have limited communication and computation capabilities, which constrain t...

A tape library is seldom considered as a viable place for constructing a file system for a sequential write/read device. Storage virtualization technology has become a buzzword in technology circles lately, in this paper we propose a tape library file system, called TLFS. The purpose of TLFS is to maintain a consistent view of mass storage so that the user can effectively manage it. Like disk f...

The mobile database is using SQL Server CE mobile database engine. Data conversion layer provides backup restore function (fully backup and restore, table with import and export) of SQL Server CE' local database, and to provide similar interface functions of storage procedure (it include: function of operating local database, function of remote upload and download, function of operation remote ...

Conventional wisdom holds that Paxos is too expensive to use for high-volume, high-throughput, data-intensive applications. Consequently, fault-tolerant storage systems typically rely on special hardware, semantics weaker than sequential consistency, a limited update interface (such as append-only), primary-backup replication schemes that serialize all reads through the primary, clock synchroni...

Distributed hash tables have been proposed as a way to simplify the construction of large-scale distributed applications (e.g. [1, 6]). DHTs are completely decentralized systems that provide block storage on a changing collection of nodes spread throughout the Internet. Each block is identified by a unique key. DHTs spread the load of storing and serving blocks across all of the active nodes an...

Peer-to-peer (P2P) backup systems are an attractive alternative to server-based systems because the immense costs of large data centers can be saved by using idle resources on millions of private computers instead. This paper presents the design and theoretical analysis of a market for a P2P backup system. While our long-term goal is an open resource exchange market using real money, here we co...

In an effort to combine research in peer-to-peer systems with techniques for incremental backup systems, we propose pStore: a secure distributed backup system based on an adaptive peer-to-peer network. pStore exploits unused personal hard drive space attached to the Internet to provide the distributed redundancy needed for reliable and effective data backup. Experiments on a 30 node network sho...

This proposal examines a cost effective design that integrates cloud-based storage with a local file server network. Our design focus was constrained on small to medium institutions with a total storage limit of 1TB. The proposed design shifts external backup of a server to the cloud.

The secure storage systems adopting the encrypt-on-disk scheme, in which files are stored in cipher for efficient data transmission, need to re-encrypt files with new cryptographic keys when a revocation occurs. There are two re-encryption methods, namely active revocation in which the re-encryption is immediately performed and lazy revocation in which the re-encryption is delayed until the fil...