Communications of the ACM
A layered naming architecture for the internet
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Towards a new generation of information-oriented internetworking architectures
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
TIE: A Community-Oriented Traffic Classification Platform
TMA '09 Proceedings of the First International Workshop on Traffic Monitoring and Analysis
Proceedings of the 5th international conference on Emerging networking experiments and technologies
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Scalable Name Lookup in NDN Using Effective Name Component Encoding
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
PIT overload analysis in content centric networks
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
Named data networking on a router: fast and dos-resistant forwarding with hash tables
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
| Hi-index | 0.00 |
Internet has witnessed its paramount function transition from host-to-host communication to content dissemination. Named Data Networking (NDN) and Content-Centric Networking (CCN) emerge as a clean slate network architecture to embrace this shift. Pending Interest Table (PIT) in NDN/CCN keeps track of the Interest packets that are received but yet un-responded, which brings NDN/CCN significant features, such as communicating without the knowledge of source or destination, loop and packet loss detection, multipath routing, better security, etc. This paper presents a thorough study of PIT for the first time. Using an approximate, application-driven translation of current IP-generated trace to NDN trace, we firstly quantify the size and access frequencies of PIT. Evaluation results on a 20 Gbps gateway trace show that the corresponding PIT contains 1.5 M entries, and the lookup, insert and delete frequencies are 1.4 M/s, 0.9 M/s and 0.9 M/s, respectively. Faced with this challenging issue and to make PIT more scalable, we further propose a Name Component Encoding (NCE) solution to shrink PIT size and accelerate PIT access operations. By NCE, the memory consumption can be reduced by up to 87.44%, and the access performance significantly advanced, satisfying the access speed required by PIT. Moreover, PIT exhibits good scalability with NCE. At last, we propose to place PIT on (egress channel of) the outgoing line-cards of routers, which meets the NDN design and eliminates the cumbersome synchronization problem among multiple PITs on the line-cards.