Scalable Pending Interest Table design: From principles to practice
Authors:
- 1 April 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 2049-2057
Abstract
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., 100 Gbps, traditional hash-table based methods cannot meet these requirements. In this paper, we 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. The memory requirement and network traffic overhead are analyzed, and the performance of a software implementation of the proposed design is measured. Our results show that 37 MiB to 245 MiB are required at 100 Gbps, so that the PIT can fit into SRAM or RLDRAM chips.Keywords
This publication has 13 references indexed in Scilit:
- On the design and implementation of a wire-speed pending interest table2013
- Toward fast NDN software forwarding lookup engine based on hash tables2012
- On pending interest table in named data networking2012
- Realistic storage of pending requests in Content-Centric Network routers2012
- DiPIT: A Distributed Bloom-Filter Based PIT Table for CCN Nodes2012
- Scalable NDN Forwarding: Concepts, Issues and Principles2012
- A reality check for content centric networking2011
- BUFFALO2009
- Networking named content2009
- Web caching and Zipf-like distributions: evidence and implications1999