Name
Abstract | ||
|---|---|---|
Named data networking (NDN) is a new networking paradigm using named data instead of named hosts for communication. Implementation of scalable NDN packet forwarding remains a challenge because NDN requires fast variable-length hierarchical name-based lookup, per-packet data plane state update, and large-scale forwarding tables. We have designed and implemented an NDN data plane with a software forwarding engine on an Intel Xeon-based line card in a Cisco ASR9000 router. In order to achieve high-speed forwarding, our design features (1) name lookup via hash tables with fast collision-resistant hash computation, (2) an efficient and secure FIB lookup algorithm that provides good average and bounded worst-case FIB lookup time, (3) PIT partitioning that enables linear multi-core speedup, and (4) an optimized data structure and software prefetching to maximize data cache utilization. In this demonstration, we showcase our NDN router implementation on the ASR9000 and demonstrate that it can forward real NDN traffic at 20Gbps or higher. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2486001.2491699 | SIGCOMM |
Keywords | Field | DocType |
ndn data plane,scalable ndn packet forwarding,real ndn traffic,per-packet data plane state,high-speed forwarding,optimized data structure,data cache utilization,bounded worst-case fib lookup,ndn router implementation,data network | Data structure,Forwarding plane,Computer science,Computer network,Hash function,Router,Packet forwarding,Distributed computing,ASR9000,Hash table,Scalability | Conference |
Volume | Issue | ISSN |
43 | 4 | 0146-4833 |
Citations | PageRank | References |
19 | 0.83 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Won So | 1 | 107 | 5.77 |
| Ashok Narayanan | 2 | 155 | 8.59 |
| David Oran | 3 | 451 | 44.37 |
| Mark Stapp | 4 | 29 | 1.39 |