Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Name routing fast matching search method and device

A name and routing technology, applied in the field of computer networks, to achieve low update rate, reduce misjudgment rate, and shorten search time

Active Publication Date: 2014-06-18
BEIJING UNIV OF POSTS & TELECOMM
View PDF3 Cites 86 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] The purpose of the present invention is to solve the problem of efficient search of routing names in NDN, and propose a method and device for storing, matching and routing update of NDN name prefixes by combining tree bitmap and Bloom filter

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Name routing fast matching search method and device
  • Name routing fast matching search method and device
  • Name routing fast matching search method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] The list of name prefixes in the router is as follows Figure 5 Shown in (a). These prefixes are jointly stored using a tree bitmap and a counting Bloom filter, and the structure is as follows Figure 5 As shown in (c), the name classification level SL=3, the step size in the tree bitmap is 2, and the number of hash functions k=3 in the counting Bloom filter. The internal bitmap and external bitmap of 5 nodes in the tree bitmap are as follows Figure 5 In (b), the schematic diagram of the filter is shown in (d) and (e). Among them, the counting Bloom filter 2-1-1 stores the B segment of the prefix / cn / edu / courses / spring, which is / spring; the filter 3-1-4 stores the prefix / cn / com / sina / movie Section B of / love / oneday / avi and the prefix / cn / com / sina / news / usa / star / oskar are / movie / love / oneday / avi and / news / usa / star / oskar respectively. 3 in 3-1-4 refers to the third child node, 1 refers to the first set of filters pointed to by this node, and 4 refers to the fourth fil...

Embodiment 2

[0064] This example is carried out on the basis of Example 1, and is divided into three cases to demonstrate the name prefix lookup.

[0065] (1) The name of the request packet X= / cn / edu / courses / spring / game / lesson1 / video

[0066] Decompose X into segment T= / cn / edu / courses, segment B= / spring / game / lesson1 / video. Find the longest matching item H of segment T in the tree bitmap, and perform membership search for segment B in the filter bank pointed to by H, such as Figure 6 As shown, it can be seen that the longest matching item in section B has three layers, take the first three layers of section B / spring / game / lesson1 and append it after section T as the longest matching prefix of X, which is / cn / edu / courses / spring / game / lesson1, perform hash calculation on the longest matching prefix to get the forwarding port eth6, forward the request data packet from eth6, and the operation ends.

[0067] (2) The name of the request packet X= / cn / edu

[0068] Decompose X into T section = / ...

Embodiment 3

[0072] This example is carried out on the basis of Example 1, and is divided into three cases to demonstrate the insertion of the name prefix.

[0073] (1) The name prefix to be inserted X= / cn / com / yahoo / entertainment / star

[0074] Decompose X into segment T= / cn / com / yahoo, segment B= / entertainment / star. Find the longest matching prefix of segment T in the tree bitmap, and the filter 3-2-2 pointed to by this prefix has two layers, then insert segment B into it. The method is to perform 3 hash calculations on section B, map to positions 1, 3, and 4 in 3-2-2, and add 1 to the counters at these positions, such as Figure 7 As shown in (b), where (a) is the situation where the filter 3-2-2 is inserted before X, the black solid circle is to explain the counter plus 1.

[0075] (2) The name prefix to be inserted X= / com / baidu / movie

[0076] Decompose X into T segment = / com / baidu / movie, B segment is empty. Because there is only the T section, only the tree bitmap can be changed, su...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a name routing fast matching search method and device. The device mainly comprises a tree-bitmap and a Blond filter. The tree-bitmap is used for storing the first m layers of name routing, and performing fast longest prefix matching on the first m layers of request content name reaching a router; the Blond filter is used for storing the rest of the prefix of the name routing, and performing longest prefix matching on the rest of the request content name reaching the router. According to the different prefix length of the name routing to be updated, the tree-bitmap and the Blond filter can be updated respectively or simultaneously by the method. According to the invention, the characteristics of fast searching, little required storing of the tree-bitmap and the characteristics of high time efficiency and spatial efficiency are utilized, the routing addressing problem based on the content name in the novel network system is solved, and the requirements of little occupied memory, fast matching speed and fast updating speed of the future network routing are met.

Description

technical field [0001] The invention belongs to the technical field of computer networks and can be used for storing, matching and updating routing prefixes in a new network system based on name routing. Background technique [0002] With the development of the Internet, people pay more and more attention to the data itself rather than where the data is stored. In this context, Named Data Networking (NDN) came into being. Compared with the traditional IP (Internet Protocol)-based network system, NDN has many advantages, such as supporting multicast and mobility itself, ensuring the security of the provided content itself, and reducing the load on the server side, etc. However, since NDN uses content names to locate data resources, each of its data packet headers carries the name of the requested content, and router forwarding tables also store several content name prefixes. unprecedented challenges. First of all, unlike the existing routing and forwarding table based on I...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/743H04L12/753H04L29/08G06F17/30
Inventor 关建峰许长桥张宏科权伟韩冰洁张萌李杰石春秋
Owner BEIJING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com