Named data networking on a router: forwarding at 20gbps and beyond

@article{So2013NamedDN,
  title={Named data networking on a router: forwarding at 20gbps and beyond},
  author={Wong-chuen Joseph So and Ashok Narayanan and Dave Oran and Mark Stapp},
  journal={Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM},
  year={2013}
}
  • W. SoA. Narayanan M. Stapp
  • Published 12 August 2013
  • Computer Science
  • Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
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… 

Figures from this paper

Reliable Memory Efficient Name Forwarding in Named Data Networking

  • Divya SaxenaV. RaychoudhuryC. BeckerN. Suri
  • Computer Science
    2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES)
  • 2016
This paper proposes a scalable and memory-efficient radix trie based name component encoding scheme, named RaCE, to implement NDN FIB, and experiment results show that the RaCE scheme is reducing memory consumption and size compared to the original size of data and NCE scheme for the 29 million dataset, respectively.

Name Lookup in Named Data Networking: A Review

The existing NDN approaches and architectures are explored by using a novel classification method and name lookup approaches were analyzed and compared in a novel manner to improve NDN name lookup in minimizing implementation cost and enhancing performance.

N-FIB: Scalable, memory efficient name-based forwarding

Caesar: A content router for high-speed forwarding on content names

This paper designs and prototype a content router called Caesar for high-speed forwarding on content names, and builds Caesar as an enterprise router, and shows that every line card sustains up to 10 Gbps using a forwarding table with more than 10 million content prefixes.

Caesar: a content router for high-speed forwarding on content names

This paper designs and prototype a content router called Caesar for high-speed forwarding on content names, and builds Caesar as an enterprise router, and shows that every line card sustains up to 10 Gbps using a forwarding table with more than 10 million content prefixes.

Efficient name matching based on a fast two-dimensional filter in named data networking

This paper proposes, design and implements a new approach called fast two-dimensional filter with hash table (FTDF-HT), which can achieve high lookup speed and exhibit good scalability to large-scale prefixes table.

A Method for Designing High-speed Software NDN Routers

This work implements a prototype of building blocks of the state-of-the-art NDN software router and empirically measure the consumption of CPU cycles and dynamic random-access memory (DRAM) channels of commercial off- the-shelf (COTS) computers.

Packet Forwarding in Named Data Networking Requirements and Survey of Solutions

This survey gives the complete requirements and compares all the schemes proposed for NDN forwarding plane based on the data structure utilized, and discusses some issues, challenges, and directions in future research.

Efficient Name Lookup Scheme Based on Hash and Character Trie in Named Data Networking

  • Yunsong TanShuhua Zhu
  • Computer Science
    2015 12th Web Information System and Application Conference (WISA)
  • 2015
Experimental results show that SNT supports longest prefix match very well and can reduce 30% ~ 38% memory cost by component hash and can improve general memory efficiency by 23% ~ 49%.

TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in Content-Centric Networking

An in-depth study of characteristics of large-scale CCN names is made, and a simple yet efficient CCN-customized name lookup engine (named by TB2F), which capitalizes the strengths of Tree-Bitmap (TB) and Bloom-Filter (BF) mechanisms, while counteracts their main limitations is proposed.

References

SHOWING 1-3 OF 3 REFERENCES

Toward fast NDN software forwarding lookup engine based on hash tables

This paper proposes a design of an NDN software forwarding lookup engine based on hash tables and evaluates its performance with different design options, demonstrating that its design reaches about 1.5MPPS with a single thread on an Intel 2.0GHz Xeon processor.

Networking named content

Content-Centric Networking (CCN) is presented which uses content chunks as a primitive---decoupling location from identity, security and access, and retrieving chunks of content by name, and simultaneously achieves scalability, security, and performance.

SipHash: A Fast Short-Input PRF

This work proposes that hash tables switch to SipHash as a hash function, which is simpler than MACs based on universal hashing, and faster on short inputs than state-of-the-art MACs.