2012•Journal of Lanzhou University of TechnologyRequires access
IPv6 routing search algorithm based on binary search and Trie
LI Ren-guo
Open publisher page 0 citations
Abstract
The merit and defect of both the binary routing search algorithm based on prefix length and that based on Trie were briefly analyzed.On this basis,an improved routing search algorithm was presented and its realization scheme was also given out in the case of IPv6.Due to the good expansibility and fast speed of searching with the first search algorithm mentioned above and the flexibility of algorithm implementing and fast dynamic updating of forwarding table with the second search algorithm above-mentioned,the algorithm presented was made to have the merits such as fast dynamic updating of routing forwarding table,fast searching speed,and good expansibility of prefix length.It was shown by the simulation result that this algorithm could well meet the requirement of IPv6.