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 perform...
Building a high performance IP packet forwarding (PF) engine remains a challenge due to increasingly...
Abstract — Today, the Internet is an essential part of everyday life and many important and crucial ...
Abstract—We introduce the first algorithm that we are aware of to employ Bloom filters for longest p...
As an efficient data structure for membership testing, the Bloom filter has found wide applications ...
Network traffic has increased rapidly in recent years, mainly associated with the massive growth of ...
Among the possible future Internet architectures, Information Centric Networking (ICN) is the most p...
Among the possible future Internet architectures, Information Centric Networking (ICN) is the most p...
Hash tables are fundamental components of several network processing algorithms and applications, in...
Efficient IPv6 packet forwarding still is a major bottleneck in todays networks. Especially in the i...
Internet was designed to provide source to destination communication and it had shown good resilienc...
Named Data Networking (NDN) is a recently proposed new Internet architecture. By naming data instead...
Locating the demanded content is one of the major challenges in Information-Centric Networking (ICN)...
Abstract—In this paper we design, implement and evaluate NameFilter, a two-stage Bloom filter-based ...
Bloom filters make use of a “probabilistic ” hash-coding method to reduce the amount of space requir...
Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding inform...
Building a high performance IP packet forwarding (PF) engine remains a challenge due to increasingly...
Abstract — Today, the Internet is an essential part of everyday life and many important and crucial ...
Abstract—We introduce the first algorithm that we are aware of to employ Bloom filters for longest p...
As an efficient data structure for membership testing, the Bloom filter has found wide applications ...
Network traffic has increased rapidly in recent years, mainly associated with the massive growth of ...
Among the possible future Internet architectures, Information Centric Networking (ICN) is the most p...
Among the possible future Internet architectures, Information Centric Networking (ICN) is the most p...
Hash tables are fundamental components of several network processing algorithms and applications, in...
Efficient IPv6 packet forwarding still is a major bottleneck in todays networks. Especially in the i...
Internet was designed to provide source to destination communication and it had shown good resilienc...
Named Data Networking (NDN) is a recently proposed new Internet architecture. By naming data instead...
Locating the demanded content is one of the major challenges in Information-Centric Networking (ICN)...
Abstract—In this paper we design, implement and evaluate NameFilter, a two-stage Bloom filter-based ...
Bloom filters make use of a “probabilistic ” hash-coding method to reduce the amount of space requir...
Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding inform...
Building a high performance IP packet forwarding (PF) engine remains a challenge due to increasingly...
Abstract — Today, the Internet is an essential part of everyday life and many important and crucial ...
Abstract—We introduce the first algorithm that we are aware of to employ Bloom filters for longest p...