基于OPNET的二叉树路由查找算法的设计与实现  

The Design and Implementation of Binary Tree Routing Lookup Algorithm Based on OPNET

作　　者：戴泽华 张连连[2] 邓全才[2] 葛宇[2] 

机构地区：[1]张家口市交通局,河北张家口075000 [2]河北建筑工程学院,河北张家口075024

出　　处：《河北建筑工程学院学报》2012年第3期55-59,共5页Journal of Hebei Institute of Architecture and Civil Engineering

摘　　要：路由器是构成因特网的中间节点,其转发性能决定了因特网的整体性能.IP查表算法的优劣直接影响了当前和未来因特网网络的整体性能.深入研究了二叉树路由查找算法,并在OPNET上对其进行了设计实现,从路由查询次数,单次查询所需时间。Routers is the intermediate node of Internet, whose forwarding performance determines the overall performance of the Internet. The performance of IP lookup algorithm will directly affect the overall performance of current and future Internet. The paper researches the binary tree routing lookup algorithm, implements the algorithm in OPNET, and gives performance analysis in the number of inquiries, the time required for a single query and the length of the routing tables.

关 键 词：二叉树 路由查找 OPNET 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]