基于路由表哈希匹配算法的压缩策略

Compression strategy for hash match algorithm in route list

哈希算法是一种最优的匹配算法。但是在现今的网络应用中,该匹配算法的应用有一定的局限性。在分析了路由表地址匹配的延迟过程之后,得出产生延迟的主要原因是现今的路由表容量比较有限,从而造成在路由表中无法找到IP目的地址。提出了一种以现实的最大路由表容量为准来解决路由匹配延迟的压缩策略。其目的是去掉无法找到路由表目的地址的现象,通过对压缩后路由表容量的仿真试验,结果显示,在路由表中查找目的地址失败的问题已经解决,所以该策略是可行的。

Hash algorithm is a traditionally optimal match algorithm. In present network applications, however, this kind of match algorithm has certain limitaions. After analyzing the procedure of delay in route list addresses, the main reason why route match is delayed is obtained. It is the finite capacity of the route list that causes the failure to find destination addresses. A novel compression strategy is proved in which the real maximal route list capacity is the yardstick of solving route match delay. Its purpose is to eliminate the failure to find destination addresses in route list. Simulation results show that the problem of failure to find destination addresses in route list is solved, thus the strategy is feasible.