arrow
Return

A novel routing algorithm for IoT cloud based on hash offset tree

delete2018-09-01
delete13
PRE
AI
韩
韩志杰 (Zhijie Han)
Y
Yaqiong Li
李
李洁 (Jie Li) *
DOI:10.1016/j.future.2018.02.047delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
IoT-Cloud has been played significant role and helped doctors or physicians to add wisdom for healthcare, A data center network (DCN) and a software defined network (SDN) in IoT-Cloud are characterized by a considerable increase in routing table entries, substantial rise in network traffic and higher demands on route forwarding speed. To address these issues, an efficient prefix-matching algorithm that combines the strengths of the hash and Trie methods is proposed to look up and forward the packets more efficiently in the SDN for Healthcare IoT-Cloud. To achieve this objective, the presented study designs a hash offset Trie match on longest prefix (HOTMLP) algorithm. The routing table matching on longest prefix is divided into common prefix match and feature prefix match in this routing algorithm. Common parts of all route prefixes are stored using the hash table to reduce storage space and matching step size. The exact prefix matching entry is identified using the Trie method. Theoretical analysis demonstrates that the proposed algorithm looks up faster, updates more easily, and stores the data with less space. Achieving the longest prefix match via HOTMLP has a complexity of O(2 + n/k). In the worst case, the largest number of n is 8 for the ipv4 address and 32 for the ipv6 address. Experimental results prove that the proposed algorithm is able to meet the requirements of the core route on routing lookup efficiency and forward tens of millions of packets per second. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Routing lookup
Hash table
Trie
Longest prefix match
Reduced storage space
Efficient lookup
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
Papers:
6.9K
Citations:
2.3W

Organization

J
jinan university
Scholars:
4.3W
Papers: 2.7W
Citations: 38
H
henan university
Scholars:
2.3W
Papers: 1.3W
Citations: 20
Cited Papers

Cited Papers

Priority Tries for IP Address Lookup
err2010-06-01
err49
PREAI
errLim, Hyesook; Yim, Changhoon; Swartzlander, Earl E., Jr.
errShare
errSave
Evolutionary design of hash function pairs for network filters
err2017-07-01
err6
PREAI
errDobai, Roland; Korenek, Jan; Sekanina, Lukas
errShare
errSave
errShare
errSave
Analyses of the Gravimetric and Electrochemical Effects of C16H13N3O3 on Mild Steel Corrosion in 0.5 M H2SO4
err2019-12-01
err0
errOAAI
errFrancis O. Edoziuno; Benjamin U. Odoni; Adeolu A. Adediran; Joshua O. Okeniyi; Esther T. Akinlabi
errShare
errSave
Phase-Change Memory Optimization for Green Cloud with Genetic Algorithm
err2015-12-01
err255
PREAI
errQiu, Meikang; Ming, Zhong; Li, Jiayin; Gai, Keke; Zong, Ziliang
errShare
errSave
SOFTWARE DEFINED HEALTHCARE NETWORKS
err2015-12-01
err80
PREAI
errHu, Long; Qiu, Meikang; Song, Jeungeun; Hossain, M. Shamim; Ghoneim, Ahmed
errShare
errSave
errShare
errSave
Survey and taxonomy of IP address lookup algorithms
err2001-01-01
err355
PREAI
errRuiz-Sánchez, MA; Biersack, EW; Dabbous, W
errShare
errSave
researcher View more