Scalable Pending Interest Table Design: From Principles to Practice
A Pending Interest Table (PIT) is a core component in named data networking. Scalable PIT design is challenging because it requires per-packet updates, and the names stored in the PIT are long, requiring more memory. As the line speed keeps increasing, e.g., 100Gbps, traditional hash-table based methods cannot meet these requirements. In this paper, the authors propose a novel Pending Interest Table design that guarantees packet delivery with a compact and approximate storage representation. To achieve this, the PIT stores fixed-length fingerprints instead of name strings. To overcome the classical fingerprint collision problem, the Interest aggregation feature in the core routers is relaxed.