Final published version
Licence: CC BY: Creative Commons Attribution 4.0 International License
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Hash Table Assisted Efficient File Level De-duplication Scheme in SD-IoV Assisted Sensing Devices
AU - Said, Ghawar
AU - Ullah, Ata
AU - Ghani, Anwar
AU - Azeem, Muhammad
AU - Yahya, Khalid
AU - Bilal, Muhammad
AU - Shah, Sayed Chhattan
PY - 2024/1/26
Y1 - 2024/1/26
N2 - The Internet of Things (IoT) and cloud technologies have encouraged massive data storage at central repositories. Software-defined networks (SDN) support the processing of data and restrict the transmission of duplicate values. It is necessary to use a data de-duplication mechanism to reduce communication costs and storage overhead. Existing State of the art schemes suffer from computational overhead due to deterministic or random treebased tags generation which further increases as the file size grows. This paper presents an efficient file-level de-duplication scheme (EFDS) where the cost of creating tags is reduced by employing a hash table with keyvalue pair for each block of the file. Further, an algorithm for hash tablebased duplicate block identification and storage (HDBIS) is presented based on fingerprints that maintain a linked list of similar duplicate blocks on the same index. Hash tables normally have a consistent time complexity for lookup, generating, and deleting stored data regardless of the input size. The experiential results show that the proposed EFDS scheme performs better compared to its counterparts.
AB - The Internet of Things (IoT) and cloud technologies have encouraged massive data storage at central repositories. Software-defined networks (SDN) support the processing of data and restrict the transmission of duplicate values. It is necessary to use a data de-duplication mechanism to reduce communication costs and storage overhead. Existing State of the art schemes suffer from computational overhead due to deterministic or random treebased tags generation which further increases as the file size grows. This paper presents an efficient file-level de-duplication scheme (EFDS) where the cost of creating tags is reduced by employing a hash table with keyvalue pair for each block of the file. Further, an algorithm for hash tablebased duplicate block identification and storage (HDBIS) is presented based on fingerprints that maintain a linked list of similar duplicate blocks on the same index. Hash tables normally have a consistent time complexity for lookup, generating, and deleting stored data regardless of the input size. The experiential results show that the proposed EFDS scheme performs better compared to its counterparts.
KW - Hash table
KW - de-duplication
KW - linked list
KW - IoT
KW - sensing devices
U2 - 10.32604/iasc.2023.036079
DO - 10.32604/iasc.2023.036079
M3 - Journal article
VL - 38
SP - 83
EP - 99
JO - Intelligent Automation Soft Computing
JF - Intelligent Automation Soft Computing
IS - 1
ER -