Updating process for a content-addressable industry type memory, such a method and router in order to implement

摘要

Data is registered in the TRIE memory according to insert and delete commands for binary patterns of varying length associated with a reference. The data is registered in such a manner that during analysis of a chain of bits the reference delivered is that associated with the longest binary patter coincident with the beginning of the chain being analyzed. TRIE type memory (112) is organized into 2K cells with a carrier register from which binary chains are analyzed in successive portions of K bits. An Independent claim is made for a packet router using a TRIE type associative memory. The router analyses packets received in a head to head manner using a TRIE type memory and uses means (113-115) to update the memory.