S-TRAP: Optimization and Evaluation of Timely Recovery to Any Point-in-time (TRAP)

Chao Wang1, Zhanhuai Li1, Na Hu1 and Yanming Nie1

  1. School of Computer Science, Northwestern Polytechnical University
    710072 Xi'an, China
    {wch, huna601, yanming}@mail.nwpu.edu.cn, lizhh@nwpu.edu.cn

Abstract

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.

Key words

data protection, snapshot, CDP, data backup, data recovery

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS110413071W

Publication information

Volume 9, Issue 1 (January 2012)
Year of Publication: 2012
ISSN: 1820-0214 (Print) 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

DownloadAvailable in PDF
Portable Document Format

How to cite

Wang, C., Li, Z., Hu, N., Nie, Y.: S-TRAP: Optimization and Evaluation of Timely Recovery to Any Point-in-time (TRAP). Computer Science and Information Systems, Vol. 9, No. 1, 431-454. (2012)