ABSTRACT
We propose compressed PIT structure based on Bloom Filter. And we argue that United Bloom Filter is better than Counting Bloom Filter in the PIT compression.
Recommendations
On pending interest table in named data networking
ANCS '12: Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systemsInternet 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 Sizing in Named Data Networking
ACM-ICN '15: Proceedings of the 2nd ACM Conference on Information-Centric NetworkingNamed Data Networking (NDN) has emerged as a promising candidate for shifting Internet communication model from host-centric to content-centric. A core component of NDN is its stateful forwarding plane: Content Routers keep track of pending requests (...
Enabling Correct Interest Forwarding and Retransmissions in a Content Centric Network
ANCS '15: Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systemsWe show that the mechanisms used in the name data networking (NDN) and the original content centric networking (CCN) architectures may not detect Interest loops, even if the network in which they operate is static and no faults occur. Furthermore, we ...
Comments