An updating algorithm is proposed, which has a time complexity of O(?W?/2) in the worst case(where ?W? indicates the number of prefix length sets) and improves the updating ability of TCAM effectively. ?

• 对TCAM的路由更新问题进行了讨论,提出一个最坏情况下O(W 2)的更新算法(W为前缀长度集合的数目),有效地提高了TCAM的更新性能。