科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
