ONE POPULAR HARDWARE DEVICE FOR PERFORMING FAST ROUTING LOOKUPS AND PACKET
CLASSIFICATION IS A TERNARY CONTENT-ADDRESSABLE MEMORY (TCAM). WE PROPOSE T
WO ALGORITHMS TO MANAGE THE TCAM SUCH THAT INCREMENTAL UPDATE TIMES REMAIN
SMALL IN THE WORST CASE.