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. ?是什么意思_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. ?在線(xiàn)翻譯_英語(yǔ)_讀音_用法_例句