Paper Title:
Routing Lookup Algorithm Performance Analysis and Research
  Abstract

This paper describes several current routing lookup algorithms, to study and analysize the complexity and operating practical performance of these routing lookup algorithms. The results show that although the binary search algorithm is not greatly improved in the searching performance, but in IPv6 environment, because searching performance of multi-branch Trie tree will decrease greatly, thus the superiority of binary search algorithm will be reflected better.

  Info
Periodical
Advanced Materials Research (Volumes 181-182)
Edited by
Qi Luo and Yuanzhi Wang
Pages
109-112
DOI
10.4028/www.scientific.net/AMR.181-182.109
Citation
X. M. Wei, "Routing Lookup Algorithm Performance Analysis and Research", Advanced Materials Research, Vols. 181-182, pp. 109-112, 2011
Online since
January 2011
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Shu Min Zhou, Rui Chen, Bin Tang
Abstract:Based on the analysis of current zip code, this article put forward a new encoding algorithm of the address tree - the largest matching...
296
Authors: Yun Xia Yu, Wei Qun Han, Xiao Xuan Tian
Chapter 3: Power Systems, Electronics and Microelectronics, Embedded and Integrated Systems, Communication
Abstract:Multicast address allocation is a key and difficult points of HLA simulation system. Multicast address allocation need to select or improve...
2111
Authors: Yuan Jun Luo
Chapter 9: Artificial Intelligence Techniques and Optimization Algorithms
Abstract:With the continuous advance of mobile Internet applications and deepening of the mobile node based multicast applications are rapidly...
1242