A constant-time chunking algorithm for packet-level deduplication

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...

Full description

Bibliographic Details
Main Author: MyungKeun Yoon
Format: Article
Language:English
Published: Elsevier 2019-06-01
Series:ICT Express
Online Access:http://www.sciencedirect.com/science/article/pii/S2405959518302157
id doaj-e4497667d67444a2b5f08343fcc7b7e6
record_format Article
spelling doaj-e4497667d67444a2b5f08343fcc7b7e62020-11-25T01:59:20ZengElsevierICT Express2405-95952019-06-0152131135A constant-time chunking algorithm for packet-level deduplicationMyungKeun Yoon0Department of Computer Engineering, Kookmin University, Seoul, Republic of KoreaRedundancy 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. Keywords: Deduplication, Chunking algorithm, Packet capture, Network securityhttp://www.sciencedirect.com/science/article/pii/S2405959518302157
collection DOAJ
language English
format Article
sources DOAJ
author MyungKeun Yoon
spellingShingle MyungKeun Yoon
A constant-time chunking algorithm for packet-level deduplication
ICT Express
author_facet MyungKeun Yoon
author_sort MyungKeun Yoon
title A constant-time chunking algorithm for packet-level deduplication
title_short A constant-time chunking algorithm for packet-level deduplication
title_full A constant-time chunking algorithm for packet-level deduplication
title_fullStr A constant-time chunking algorithm for packet-level deduplication
title_full_unstemmed A constant-time chunking algorithm for packet-level deduplication
title_sort constant-time chunking algorithm for packet-level deduplication
publisher Elsevier
series ICT Express
issn 2405-9595
publishDate 2019-06-01
description 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. Keywords: Deduplication, Chunking algorithm, Packet capture, Network security
url http://www.sciencedirect.com/science/article/pii/S2405959518302157
work_keys_str_mv AT myungkeunyoon aconstanttimechunkingalgorithmforpacketleveldeduplication
AT myungkeunyoon constanttimechunkingalgorithmforpacketleveldeduplication
_version_ 1724965066182230016