By Topic

Balanced and Efficient Data Placement and Replication Strategy for Distributed Backup Storage Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Renuga, K. ; Data Storage Inst., Singapore, Singapore ; Tan, S.S. ; Zhu, Y.Q. ; Low, T.C.
more authors

The traditional method of centralized backup suffers from single point of failure and scalability problem. It is therefore beneficial to carry out the backup service over geographically distributed networks. Hence, redundant copies of data stored in such networks are essential to ensure the availability and reliability of the backup data. The main objective of this work is to balance and evenly distribute large amounts of backup data for efficient use of disks as well as network bandwidth which leads to faster data access and recovery. We develop an efficient method for data placement and replication. Our method has several attractive features: (1) Balanced and efficient data placement in a distributed storage resource environment. (2) Redistributing as few replicas as possible in the event of storage node addition or failure/removal. (3) There is no central mapping table so that the search performance becomes more efficient. We demonstrate the effectiveness of our method through theoretical analysis and simulation results.

Published in:

Computational Science and Engineering, 2009. CSE '09. International Conference on  (Volume:1 )

Date of Conference:

29-31 Aug. 2009