Ying Wan

TL;DR: ABUT as mentioned in this paper applies the topology grouping and maintains the group order invariance in TCAM, achieving substantial computing time reduction yet still yields the best-in-class placement cost, which is ideal for low-latency and high-throughput batch TCAM updates in modern highperformance switches.

TL;DR: A new route lookup algorithm, OBMA, which improves update performance and storage efficiency while maintaining high lookup speed is proposed, which is 12.5 times faster than the state-of-the-art algorithm Poptrie.

TL;DR: FastUp as discussed by the authors is a faster and more balanced TCAM update scheme, which not only achieves the shortest interrupt time so far but also significantly reduces the computation time by using a novel sequential stack.

TL;DR: This paper proposes PlusBitmap Caching (PBC), which associates a bitmap to each cached prefix to denote the existence or absence of any longer prefix in the main table, and which increases cache hit ratio by 16% over a wide range of cache size.