A Compression Technique Exploiting References for Data Synchronization Services
Department of Computer Science and Engineering In a variety of network applications, there exists significant amount of shared data between two end hosts. Examples include data synchronization services that replicate data from one node to another. Given that shared data may have high correlation wit...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Master Thesis |
| Language: | English |
| Published: |
Graduate School of UNIST
2019
|
| Subjects: | |
| Online Access: | https://scholarworks.unist.ac.kr/handle/201301/25876 http://unist.dcollection.net/common/orgView/200000179584 |
| Summary: | Department of Computer Science and Engineering In a variety of network applications, there exists significant amount of shared data between two end hosts. Examples include data synchronization services that replicate data from one node to another. Given that shared data may have high correlation with new data to transmit, we question how such shared data can be best utilized to improve the efficiency of data transmission. To answer this, we develop an encoding technique, SyncCoding, that effectively replaces bit sequences of the data to be transmitted with the pointers to their matching bit sequences in the shared data so called references. By doing so, SyncCoding can reduce data traffic, speed up data transmission, and save energy consumption for transmission. Our evaluations of SyncCoding implemented in Linux show that it outperforms existing popular encoding techniques, Brotli, LZMA, Deflate, and Deduplication. The gains of SyncCoding over those techniques in the perspective of data size after compression in a cloud storage scenario are about 12.4%, 20.1%, 29.9%, and 61.2%, and are about 78.3%, 79.6%, 86.1%, and 92.9% in a web browsing scenario, respectively. open |
|---|