Hash Bloom filter (HBF) for name lookup in NDN and data forwarding method

Abstract

The invention discloses a Hash Bloom filter (HBF) for name lookup in an NDN and a data forwarding method. The Hash Bloom filter comprises g counter Bloom filters positioned in an on-chip memory, g counters and g Hash tables positioned in an off-chip memory, wherein each Hash table is associated with one counter Bloom filter and one counter; the Hash Bloom filter uniformly disperses and stores FIB / CS / PIT table entry complete information in an NDN router in the g counter Bloom filters and g Hash tables. The HBF utilizes the positioning and filtering functions of CBF in the on-chip memory to greatly reduce the access expenses of the off-chip memory, so that the overall access cost of the HBF is reduced, the data package forwarding rate is increased, and flooding attack is effectively avoided.

Description

technical field

[0001] The invention relates to the field of big data processing in the fields of distributed systems, networks, etc., in particular to a hashbloom filter and a data forwarding method for name lookup in NDN. Background technique

[0002] With the transformation of the Internet application mode, the Internet based on the TCP / IP system structure has also exposed several problems. At the beginning of the Internet design, it was to solve the interconnection problem of network devices to realize the sharing of hardware resources. However, with the development of Internet of Things, mobile Internet, cloud computing and other technologies, the main body of network applications has changed to text information, images and videos, and content services have become Become the main body of network services. The TCP / IP architecture designed according to the end-to-end principle has increasingly prominent problems in routing scalability, dynamics, manageability, security, ...

Examples

Embodiment

[0116] The present invention verifies the correctness of theoretical analysis through actual experiments, finds out optimal parameter settings, optimizes the overall access cost of HBF, reduces access overhead, and improves the forwarding rate of NDN data packets. At the same time, compare and analyze the number of visits and visit costs of HBF and d-left HTPIT.

technical field

[0001] The invention relates to the field of big data processing in the fields of distributed systems, networks, etc., in particular to a hashbloom filter and a data forwarding method for name lookup in NDN. Background technique

[0002] With the transformation of the Internet application mode, the Internet based on the TCP / IP system structure has also exposed several problems. At the beginning of the Internet design, it was to solve the interconnection problem of network devices to realize the sharing of hardware resources. However, with the development of Internet of Things, mobile Internet, cloud computing and other technologies, the main body of network applications has changed to text information, images and videos, and content services have become Become the main body of network services. The TCP / IP architecture designed according to the end-to-end principle has increasingly prominent problems in routing scalability, dynamics, manageability, security, ...

Examples

Embodiment

[0116] The present invention verifies the correctness of theoretical analysis through actual experiments, finds out optimal parameter settings, optimizes the overall access cost of HBF, reduces access overhead, and improves the forwarding rate of NDN data packets. At the same time, compare and analyze the number of visits and visit costs of HBF and d-left HTPIT.

Images