.png){kind=icon}
.png){kind=icon}
Return
A constant-time chunking algorithm for packet-level deduplication
.png){kind=icon}
OA
AI
DOI：10.1016/j.icte.2018.05.005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Redundancy elimination or deduplication over network packets requires significant computing resources to find basic units of repeated contents, called chunks, by checking every byte in every packet. In this paper, we present the first constant-time chunking algorithm that divides every packet into a predefined number of chunks, irrespective of the packet size. In addition, we present the best implementation practice for packet-level deduplication by selecting an optimal combination of chunking, fingerprinting, and hash table algorithms. Through experiments with real traffic, we confirm that the throughput is improved by three times, compared with even the state-of-the-art scheme. (C) 2019 The Korean Institute of Communications and Information Sciences (KICS). Publishing Services by Elsevier B.V.
Keywords:
Deduplication
Chunking algorithm
Packet capture
Network security
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.