In a content centric network, packet forwarding is performed over data names instead of IP addresses. Since data names are order-of-magnitude larger in number and complexity, CAM-based or Trie-based techniques are not applicable any more. and new forwarding schemes are proposed to solve the problem. These schemes use hashing to store the large routing table for named data into relatively abundant off-chip memory, and use some on-chip Bloom filter to minimize expensive off-chip memory access by quickly screen out table lookup queries for unrecorded names. In this paper we propose to add a ‘summary vector’ to the on-chip Bloom filter that can help in constructing an efficient off-chip hash table for better storage and lookup performance: a dynamic collision-free hash table that only needs to read into only one routing record for any lookup queries.
展开▼
