Editing Content-addressable memory (section)

==Alternative implementations==
To achieve a different balance between speed, memory size and cost, some implementations emulate the function of CAM by using standard tree search or hashing designs in hardware, using hardware tricks like replication or pipelining to speed up effective performance. These designs are often used in [[Router (computing)|router]]s.{{Citation needed|date=April 2016}} The [[Luleå algorithm]] is an efficient implementation for longest prefix match searches as required in internet routing tables.