【摘要】 为了更加直观的比较线性表算法、Trie tree算法以及Hash算法在卫星路由查找的性能,通过OPNET平台进行建模仿真.实验结果表明,三种算法路由查询次数相同.如果以访问次数为标准,选择Trie tree算法为宜.如果以查询深度为标准,选择Trie tree算法为宜.如果以响应时间为标准,由于Hash算法不稳定,选择线性表算法和Trie tree算法为宜.因此实验结论为,Trie tree算法总体性能最佳,但算法实现比较复杂,Hash算法不稳定,但对规则的增减比较容易,线性表算法易于实现,但访问次数较高.更多还原

【Abstract】 For a more intuitive comparison of the Linear list algorithm,Trie tree algorithm and Hash algorithm performance in the satellite route lookup,OPNET platform is used for modeling and simulation.The experimental results show that Experimental results show that the three algorithms the number of route query is the same.If the number of visits as a standard,select the Trie tree algorithm is appropriate.If the query depth as a standard,select the Trie tree algorithm is appropriate.If the response time as a standard.If the response time for the standard,the Hash algorithm is not stable,the selection of linear table algorithm and Trie tree algorithm is appropriate.Therefore,the experimental conclusions is that Trie tree algorithm is the best overall performance,but the algorithm is more complex,Hash algorithm is not stable,but the rules change easier,Linear list is easy to achieve,but the algorithm has a high number of visits.更多还原