Virual Oral Presentation Slide by Slide

IEEE/ICACT20260323 Slide.19        [Big Slide]	Oral Presentation
	We compare HPPC against a chain-based cache that maintains per-flow linked buffers in DDR, which induces pointer chasing and scattered accesses. We also discuss a single-level flat index as an analytical strawman: storing per-packet indices in fast memory is capacity-limited, while placing the index in DDR increases the number of DDR transactions on the critical path. We additionally include qualitative reference markers from P4-based loss masking and NIC-based selective retransmission, but our main focus is structural: how ring-plus-two-level indexing improves DDR access patterns and efficiency at line rate.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!