S-TRAP: Optimization and Evaluation of Timely Recovery to Any Point-in-time (TRAP)
Computer Science and Information Systems, Tome 9 (2012) no. 1
Cet article a éte moissonné depuis la source Computer Science and Information Systems website
This paper presents S-TRAP, a novel block-level CDP (Continuous Data Protection) recovery mechanism based on TRAP. In accordance with a certain time interval L , S-TRAP breaks down the parity chain of TRAP and generates new sub-chains. Besides, S-TRAP introduces previous block cache which can reduce the negative impact on the primary storage system. Both mathematical analysis and experimental evaluation demonstrate that S-TRAP not only has the advantage of high recovery efficiency and reliability, but also further reduces the parity storage usage. Even more important, S-TRAP reduces the negative impacts on primary storage system performance to a large extent.
Keywords:
data protection, snapshot, CDP, data backup, data recovery
@article{CSIS_2012_9_1_a19,
author = {Chao Wang and Zhanhuai Li and Na Hu and Yanming Nie},
title = {S-TRAP: {Optimization} and {Evaluation} of {Timely} {Recovery} to {Any} {Point-in-time} {(TRAP)}},
journal = {Computer Science and Information Systems},
year = {2012},
volume = {9},
number = {1},
url = {http://geodesic.mathdoc.fr/item/CSIS_2012_9_1_a19/}
}
TY - JOUR AU - Chao Wang AU - Zhanhuai Li AU - Na Hu AU - Yanming Nie TI - S-TRAP: Optimization and Evaluation of Timely Recovery to Any Point-in-time (TRAP) JO - Computer Science and Information Systems PY - 2012 VL - 9 IS - 1 UR - http://geodesic.mathdoc.fr/item/CSIS_2012_9_1_a19/ ID - CSIS_2012_9_1_a19 ER -
Chao Wang; Zhanhuai Li; Na Hu; Yanming Nie. S-TRAP: Optimization and Evaluation of Timely Recovery to Any Point-in-time (TRAP). Computer Science and Information Systems, Tome 9 (2012) no. 1. http://geodesic.mathdoc.fr/item/CSIS_2012_9_1_a19/