RMI-DRE: a redundancy-maximizing identification scheme for data redundancy elimination  

作　　者：Nan ZHANG Xiaolong YANG Min ZHANG Keping LONG 

机构地区：[1]School of Computer and Communication Engineering, University of Science and Technology Beijing (USTB)

出　　处：《Science China(Information Sciences)》2016年第8期252-254,共3页中国科学（信息科学）（英文版）

基　　金：supported by National Basic Research Program of China (973) (Grant No. 2012CB315905);National Natural Science Foundation of China (Grant Nos. 61172048, 61100184, 61201128);National High Technology Research and Development Program of China (863) (Grant No. 2013AA01A209)

摘　　要：Dear editor, Data redundancy elimination （DRE） technology can efficiently reduce the redundant IP traffic in the network [1,2]. A detailed DRE process consists of many steps, such as the fingerprint selection, chunk matching, packet encoding, and packet decoding [3]. Fingerprint selection is one of the most important factors for DRE. In traditional DRE, the redundant chunk size is set to a fixed value. The fixed chunk size will affect the DRE performance seriously, so keeping the redundant chunk size variable is necessary [4]. Hence, multi-resolution chunking （MRC） has been proposed. However, MRC does not consider the overlap between the adjacent chunks, which in- evitably brings some unnecessary overhead. Be- sides, chunk-matching is another key point for DRE. There are two popular chunk matching mechanisms, i.e., Chunk-Match and Max-Match. Chunk-Match may not bring much storage over- head, but the size of chunk-matching is lim- ited, which results in some redundant bytes to be missed. By contrast, Max-Match can maxi- mize the size of chunk-matching by extending the boundary of the identified redundant chunk to- wards its front or rear.Dear editor, Data redundancy elimination （DRE） technology can efficiently reduce the redundant IP traffic in the network [1,2]. A detailed DRE process consists of many steps, such as the fingerprint selection, chunk matching, packet encoding, and packet decoding [3]. Fingerprint selection is one of the most important factors for DRE. In traditional DRE, the redundant chunk size is set to a fixed value. The fixed chunk size will affect the DRE performance seriously, so keeping the redundant chunk size variable is necessary [4]. Hence, multi-resolution chunking （MRC） has been proposed. However, MRC does not consider the overlap between the adjacent chunks, which in- evitably brings some unnecessary overhead. Be- sides, chunk-matching is another key point for DRE. There are two popular chunk matching mechanisms, i.e., Chunk-Match and Max-Match. Chunk-Match may not bring much storage over- head, but the size of chunk-matching is lim- ited, which results in some redundant bytes to be missed. By contrast, Max-Match can maxi- mize the size of chunk-matching by extending the boundary of the identified redundant chunk to- wards its front or rear.

关 键 词：RMI-DRE a redundancy-maximizing identification scheme for data redundancy elimination DRE data 

分 类 号：TP393.06[自动化与计算机技术—计算机应用技术]