CN105704040A - Routing table constructing and lookup method - Google Patents
Routing table constructing and lookup method Download PDFInfo
- Publication number
- CN105704040A CN105704040A CN201610224760.XA CN201610224760A CN105704040A CN 105704040 A CN105704040 A CN 105704040A CN 201610224760 A CN201610224760 A CN 201610224760A CN 105704040 A CN105704040 A CN 105704040A
- Authority
- CN
- China
- Prior art keywords
- routing table
- node
- decision diagram
- routing
- pseudo
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000006870 function Effects 0.000 claims abstract description 35
- 230000008569 process Effects 0.000 claims abstract description 5
- 238000010586 diagram Methods 0.000 claims description 38
- 230000009191 jumping Effects 0.000 claims description 5
- 230000007480 spreading Effects 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 3
- 238000010276 construction Methods 0.000 abstract 1
- 238000012217 deletion Methods 0.000 description 7
- 230000037430 deletion Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- RJKFOVLPORLFTN-LEKSSAKUSA-N Progesterone Chemical compound C1CC2=CC(=O)CC[C@]2(C)[C@@H]2[C@@H]1[C@@H]1CC[C@H](C(=O)C)[C@@]1(C)CC2 RJKFOVLPORLFTN-LEKSSAKUSA-N 0.000 description 2
- 238000009432 framing Methods 0.000 description 2
- 230000010354 integration Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 239000012466 permeate Substances 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a routing table constructing and lookup method. The method includes processes of converting routing table items to a pseudo-boolean function expression, performing ADD expression of the routing table items, updating routing table items, deleting the routing table items and performing routing lookup according to uploaded data packets. A routing table is processed by utilizing high compact ADD expression and through processing multiple sets of data in an integrated manner, the node redundancy of the routing table and the routing lookup and comparison frequency can be reduced and the routing forwarding performance is improved. According to the invention, construction of the routing table can be completed in a condition with comparatively low memory occupancy. At the same time, routing lookup of data packets can be realized at comparatively low comparison frequency.
Description
Technical field
The present invention relates to technical field of information communication, be specifically related to structure and the lookup method of a kind of routing table。
Background technology
Internet engineering duty group (TheInternetEngineeringTaskForce since 1993, IETF) CIDR (ClasslessInter-DomainRouting is proposed, CIDR) structure, make traditional routing lookup algorithm no longer applicable, longest prefix match (LongestPrefixMatching, LPM) becomes the core of Routing Algorithm。
And along with the progress of technology, the integration of three networks is increasingly becoming the developing direction of future network technology。The manifestation mode of the integration of three networks is that network system crosses one another, permeates, and network technology tends to unified IP agreement, is progressively integrated into unified communication network。This means that IP agreement will be more widely used, the length and quantity that make IP address are all largely expanded by the application of IPv6 agreement simultaneously, router performance is proposed new requirement by this, and optimizes routing table storage organization and Routing Algorithm is an up the key of router performance。
The research of the problems demand people constantly expanded of route table items and solution, and find one and can maximize deletion redundancy and reduce the key that the method for internal storage access number of times is this problem of solution。Current Routing Algorithm mainly has:
(1) utilizing the different characteristic of prefix length based on the Routing Algorithm of address prefix length, routing table (Look-upTable, LUT) is divided into multiple set, typical algorithm has Hash lookup algorithm, binary chop algorithm。This kind of algorithm advantage is that its lookup time is only relevant with prefix length, but hash algorithm is difficult to find a general hash function to can adapt to whole matched routings item。
(2) using each in prefix to build node based on the Routing Algorithm of Trie structure, routing forwarding information preserves in node, and typical Trie tree finding algorithm has LC-Trie, path compression Trie tree, Multi-branch Trie Tree etc.。Algorithm based on Trie tree has the advantages such as data structure is single, algorithm is simple, but its search procedure needs substantial amounts of internal storage access, and has back tracking operation in algorithm。
(3) based on the restructural router-table structure of symbol BDD and algorithm, but nodes is more affects router performance。
From existing Routing Algorithm it can be seen that the aspects such as node number of comparisons and number of nodes can not be taken into account, and in lookup, it is likely to have back tracking operation。
Summary of the invention
The technical problem to be solved is that existing route lookup method can not take into account node number of comparisons and number of nodes and the problem being likely to have back tracking operation in lookup, it is provided that the structure of a kind of routing table and lookup method。
For solving the problems referred to above, the present invention is achieved by the following technical solutions:
The structure of a kind of routing table and lookup method, comprise the steps:
Step A to, routing table and route table items thereof are converted the algebraic decision diagram of pseudo-Boolean functions；
Step B, the route table items in the routing table of algebraic decision diagram structure obtained for step A is carried out selectively removing；
Step C, the algebraic decision diagram that the route table items added will be needed to convert pseudo-Boolean functions to, and be added in the routing table of algebraic decision diagram structure obtained for step B by the mode of recurrence conjunction；
Step D, the node in the routing table of algebraic decision diagram structure obtained for step C is deleted and merged, it is thus achieved that the routing table of the algebraic decision diagram structure after abbreviation；
Step E, routing table based on the step D algebraic decision diagram structure set up, utilize deep search that the purpose IP address in incoming packet is mated, and searches down hop port。
Described step A particularly as follows:
Step A1, each route table items in routing table is used pseudo-Boolean functions f (x0,x1,…,xl, v) represent, wherein x0,x1,x2,...,xlRepresenting prefix, v represents down hop port；
Step A2, the pseudo-Boolean functions of route table items all in routing table is added obtains new pseudo-Boolean functions；
Step A3, according to fixed variable sequence, the variable in the step A2 new pseudo-Boolean functions generated gradually is carried out Shannon expansion, and the form spreading out process figure represents, obtains the algebraic decision diagram of pseudo-Boolean functions。
Described step B particularly as follows:
Step B1, according to current prefix value to routing table deep search, obtain the node that prefix is pointed to；
If in step B2 routing table, corresponding prefix points to leaf node and port numbers for acquiescence jumping, then it represents that does not have corresponding route table items in routing table, terminates to return；
If corresponding prefix sensing leaf node and port numbers are that non-default is jumped in step B3 routing table, then this route table items is deleted from routing table；
If corresponding prefix points to intermediate node in step B4 routing table, then according to node and output arc direction, Node price below is deleted, and reclaim internal memory。
Described step C particularly as follows:
Step C1, by the prefix needed in the route table items that adds and down hop port, to portray be an algebraic decision diagram；
Step C2, the algebraic decision diagram that the step C1 algebraic decision diagram generated and step B generate is extracted and synthesized a new algebraic decision diagram。
Described step E particularly as follows:
Step E1, record root node are as present node；
If step E2 present node is leaf node, jump to step E5；
If step E3 present node is not leaf node, and the value of the i-th ndex position (i.e. index bit) that the binary value of purpose IP address is from left to right is that 1 present node points to its right child nodes, returns step E2；
If step E4 present node is not leaf node, and the value of the i-th ndex position (i.e. index bit) that the binary value of purpose IP address is from left to right is that 0 present node points to its left child nodes, returns step E2；
Step E5, taking-up leaf node value also return。
Compared with prior art, the present invention has a characteristic that
1, the present invention considers the advantage of router-table structure feature and symbolic algorithm, establishes the routing table based on prefix。
2, the present invention proposes to use the thought of ADD structure structure routing table first time, it is effectively utilized the characteristic representing pseudo-Boolean functions and knowledge sharing of compact efficient, reduce the memory space of routing table, this method can solve the problem of volume expansions under the increasing trend of route table items, applies abbreviation simultaneously and also reduces number of comparisons during route querying with deletion redundant node。
3, the present invention has good autgmentability, can be directly applied in IPv6 agreement。
Accompanying drawing explanation
Fig. 1 is the flow chart of the structure of a kind of routing table and lookup method。
Fig. 2 is the instantiation block diagram of the structure of a kind of routing table and lookup method。
Fig. 3 be a kind of routing table structure and search system structural framing figure。
Detailed description of the invention
The structure of a kind of routing table and lookup method, as it is shown in figure 1, comprise the steps:
Stage 1, routing table Formal Modeling stage:
Step A, set up a routing table based on the algebraic decision diagram structure of pseudo-Boolean functions。
Step A1, use pseudo-Boolean functions represent route table items, the binary value according to the prefix in routing table, from left to right use pseudo-Boolean variable to represent one by one, if current binary digit is 0, use ri=xi' represent。On the contrary, if binary value is 1, r is usedi=xiRepresent。Down hop port v ∈ V corresponding to prefix represents leaf node, and so each prefix route table items can use pseudo-Boolean functions f (x0,x1,x2,...,xi, v)=r0∧r1∧r2∧…∧ri∧ v represents, wherein i ∈ [0,32]。
As 811615232233223957901 represent an actual route table items。Wherein IP for the purpose of " 811615232 ", " 23 " are masks, and purpose IP and mask constitute the prefix of route table items。" 3223957901 " are down hop port。
Step A2, by routing table all route table items use pseudo-Boolean functions represent, by all pseudo-Boolean functions be added obtain new pseudo-Boolean functions。
Step A3, according to fixed variable sequence x0<x1<x2<...<xl, to the step A2 pseudo-Boolean functions f (x generated0,x1,…,xl, the variable in v) gradually carries out Shannon expansion, and the form spreading out process figure represents: root node represents pseudo-Boolean functions self, draws Liang Ge branch from root node, represents respectively through variable xiFirst time Shannon launch after obtained pseudo-Boolean functions fxi' and fxi。Continue f equallyxi' and fxiFurther spread out, until launching item is constant value。According to the method, it is possible to obtain the algebraic decision diagram of pseudo-Boolean functions。
Stage 2, routing table update stage, including the deletion of route table items, interpolation and the abbreviation to whole routing table:
Step B, the route table items in the routing table of algebraic decision diagram structure obtained for step A is carried out selectively removing。
Step B1, according to current prefix value to routing table deep search, obtain the node that prefix is pointed to。
In step B2, routing table, corresponding prefix points to leaf node and port numbers for acquiescence jumping, then do not have corresponding route table items in routing table, terminate to return。
Step B3, prefix point to leaf node and port numbers is that non-default is jumped, and are deleted by this route table items from routing table。
Step B4, prefix point to intermediate node, then all child node recurrence of this node and this node deleted。
Step C, the route table items conversion algebraic decision diagram that adds will be needed, and be added in the routing table of algebraic decision diagram structure obtained for step B by the mode of recurrence conjunction。
Step C1, the prefix value in route table items and down hop port are portrayed into algebraic decision diagram, use the method in step A1, route table items is carried out pseudo-Boolean functions expression, then according to its Shannon is decomposed the algebraic decision diagram obtaining route table items by step A3。
Step C2, by step C1 generate algebraic decision diagram recurrence conjunction be added to routing table, its recursive computing formula is:
F=ITE (g, 1, h)。
Wherein, the algebraic decision diagram that g is routing table represents, the algebraic decision diagram that h is route table items represents, f is the routing table being currently generated。
Step D, the node in the routing table of algebraic decision diagram structure obtained for step C is deleted and merged, it is thus achieved that the routing table of the algebraic decision diagram structure after abbreviation。
Step D1, each node of algebraic decision diagram is respectively stored in chained list according to index value。
Step D2, from the chained list that index value is maximum start to each node perform step D3 and step D4, until all node processing complete。
If step D3 has identical leaf node, then leaf node is merged into one。All of input arc points to the node after merging。
If the left child nodes of step D4 node and right child nodes point to same node, then the father node of present node is directly connected to its child nodes, and present node is deleted。If the left child nodes of u and v that there are two nodes is identical, right child nodes is also identical, then delete u node, and its father node is connected to node v。
Stage 3, route querying down hop port stage:
Step E, routing table set up basis on, utilize deep search that the purpose IP address in incoming packet is mated, search down hop port。
Step E, include step:
Step E1, record root node are as present node。
If step E2 present node is leaf node, jump to step E5。
If step E3 present node is not leaf node, and the value of the i-th ndex position that the binary value of purpose IP address is from left to right is that 1 present node points to its right child nodes, returns step E2。
If step E4 present node is not leaf node, and the value of the i-th ndex position that the binary value of purpose IP address is from left to right is that 0 present node points to its left child nodes, returns step E2。
Step E5, taking-up leaf node value also return。
In order to make technical scheme and advantage clearly understand, below in conjunction with embodiment, structure and lookup method to a kind of routing table of the present invention are described in further detail。Should be appreciated that specific embodiment described herein is only in order to explain the present invention, is not intended to limit the present invention。
Step 1, being represented by route table items pseudo-Boolean functions, each route table items uses a pseudo-Boolean functions to represent。Using the present invention to propose method for table 1 Article 1 list item, prefix is " 01 ", and first is 0 use r0=x0' represent, second is 1 use r1=x1Represent, down hop port v=2, it is shown that the pseudo-Boolean functions of this route table items is expressed as f (x, v)=r0∧r1∧ v=2 x0′·x1。
Step 2, introducing fixed variable sequence π: x0<x1<x2, wherein prefix length is 3。
Step 3, according to variable sequence by f (x, v) Shannon decompose can obtain ADD structure such as shown in Fig. 2 (a)。In figure, leaf node 0 is acquiescence down hop port, and the route table items not having in routing table, Systematic selection default port is as output port。Without default port, then directly abandon。Having 3 routes in table 1, pseudo-Boolean functions is expressed as f (x, v)=2 x0’·x1+x0’·x1·x2+2x0·x1', its Shannon is decomposed structure ADD and represents as shown in Fig. 2 (b)。
Table 1 prefix routing table
Step 4, route table items deletion, it is assumed that delete route table items { 010*, 1}。
Step S41, the route table items of required deletion is built into algebraic decision diagram fi。Binary first of route prefix according to required deletion starts, and to routing table deep search, obtains the node n that prefix is pointed to。
If step S42 node n is not leaf node jumps to step S43。If the port numbers of node n is jumped for acquiescence, terminate to return, jump if not acquiescence and then this route table items is deleted from routing table。
Step S43, according to node and output arc direction, Node price below is deleted, in the routing table that table 1 builds, delete that { 010*, 1}, as shown in Fig. 2 (c)。Delete the algebraic decision diagram f=f-f obtaining new routing tablei。
Step 5, interpolation route table items, it is assumed that on the basis of the such as algebraic decision diagram shown in Fig. 2 (b), add route table items { 010*, 2}。
Step S51, convert the route table items of required interpolation to algebraic decision diagram fi。。
The algebraic decision diagram f=f+f obtaining new routing table in routing table is added in step S52, recurrence conjunction toi。
Step 6, according to purpose IP address search down hop port。Assume that the purpose IP address inputted is: 2147483648, the routing table shown in Fig. 2 (b) is made a look up。
Step S61, being represented in binary as of purpose IP address: 10000000000000000000000000000000。First from root node x0Starting, first that takes out IP address binary value is 1, so jumping to x0Right child nodes x1(node that solid line output arc points to), as shown in Fig. 2 (d)。Then taking out the second two of IP address, to enter value be 0, so jumping to x1Left child (solid line output arc point to node)。
Step S62, present node are leaf node, so the value 2 taking out this leaf node is down hop port value。
The invention discloses a kind of route querying modeling based on symbol technology and lookup method, the problem causing that routing table storage redundancy is big and search efficiency is low in order to solve route table items to be continuously increased。The method includes: route table items is converted to that pseudo-Boolean functions represents, the ADD of route table items represents, update route table items, delete route table items, carry out route querying according to incoming packet。By utilizing the high compact representation of ADD and processing routing table in the way of aggregate manner processes multi-group data, reduce node redundancy and the route querying number of comparisons of routing table, improve routing forwarding performance。The present invention can complete the structure to routing table when relatively low EMS memory occupation, can also complete the route querying of packet under less number of comparisons simultaneously。
Present invention incorporates the high intense of this data structure of symbol ADD and easy-operating feature, be applied in the structure of routing table and search, the memory space that can either reduce routing table again can combined symbol algorithm optimization route querying performance。
Based on the structure and the lookup system that are a kind of routing table designed by said method, its structural framing is as it is shown on figure 3, wherein comprise: routing table Formal Modeling module, routing table update module and routing message searching module, wherein:
(1) routing table Formal Modeling module: input is routing table lookup problem。It includes, and pseudo-Boolean functions represents, builds variable sequence π, the ADD of route table items represents。
Pseudo-Boolean functions represents: for routing table is abstracted into pseudo-Boolean expression。
Build variable sequence π: build fixed variable sequence x0<x1<x2<...<xl。
The ADD of routing table represents: represented by the binary constraint symbol ADD of routing table。
(2) routing table update module: for the renewal of the route table items to routing table。It includes the abbreviation of route table items deletion, interpolation and routing table。
Route table items is deleted: delete the route table items that user in routing table needs the route prefix value deleted to comprise。
Route table items adds: for route table items is added to routing table。
Routing table abbreviation: delete redundant node according to symbolic algorithm, reduces number of nodes。
(3) routing message searching module: routing table is scanned for according to the purpose IP address of incoming packet, mates down hop port。
The present invention especially adapts to that route table items quantity is big or the situation of memory resource limitation, especially adapts to the frequency allocation method of the dynamically change of wireless communication network node and frequency constraint。
This specification adopts the mode gone forward one by one to describe, and each stage in each method and system and module are illustrated by step successively in detail。Professional will be further appreciated that, algorithm steps in conjunction with each stage of the embodiment that disclosed in this invention and module, can be realized by programming language, in order to the interchangeability of step and module is clearly described, in the above description according to functional module, the lookup stage generally describes its composition and step。
Description to the specific embodiment of the invention in conjunction with the drawings, other side and the feature of the present invention are apparent to those skilled in the art。
Being above specific embodiments of the invention are described and illustrated, these embodiments should be considered it and be illustrative of, and are not used to limit the invention, and the present invention should according to appended claim interpretation。
Claims (5)
1. the structure of routing table and a lookup method, is characterized in that, comprise the steps:
Step A to, routing table and route table items thereof are converted the algebraic decision diagram of pseudo-Boolean functions；
Step B, the route table items in the routing table of algebraic decision diagram structure obtained for step A is carried out selectively removing；
Step C, the algebraic decision diagram that the route table items added will be needed to convert pseudo-Boolean functions to, and be added in the routing table of algebraic decision diagram structure obtained for step B by the mode of recurrence conjunction；
Step D, the node in the routing table of algebraic decision diagram structure obtained for step C is deleted and merged, it is thus achieved that the routing table of the algebraic decision diagram structure after abbreviation；
Step E, routing table based on the step D algebraic decision diagram structure set up, utilize deep search that the purpose IP address in incoming packet is mated, and searches down hop port。
2. the structure of a kind of routing table according to claim 1 and lookup method, is characterized in that, described step A particularly as follows:
Step A1, each route table items in routing table is used pseudo-Boolean functions f (x0,x1,…,xl, v) represent, wherein x0,x1,x2,...,xlRepresenting prefix, v represents down hop port；
Step A2, the pseudo-Boolean functions of route table items all in routing table is added obtains new pseudo-Boolean functions；
Step A3, according to fixed variable sequence, the variable in the step A2 new pseudo-Boolean functions generated gradually is carried out Shannon expansion, and the form spreading out process figure represents, obtains the algebraic decision diagram of pseudo-Boolean functions。
3. the structure of a kind of routing table according to claim 1 and lookup method, is characterized in that, described step B particularly as follows:
Step B1, according to current prefix value to routing table deep search, obtain the node that prefix is pointed to；
If in step B2 routing table, corresponding prefix points to leaf node and port numbers for acquiescence jumping, then it represents that does not have corresponding route table items in routing table, terminates to return；
If corresponding prefix sensing leaf node and port numbers are that non-default is jumped in step B3 routing table, then this route table items is deleted from routing table；
If corresponding prefix points to intermediate node in step B4 routing table, then according to node and output arc direction, Node price below is deleted, and reclaim internal memory。
4. the structure of a kind of routing table according to claim 1 and lookup method, is characterized in that, described step C particularly as follows:
Step C1, by the prefix needed in the route table items that adds and down hop port, to portray be an algebraic decision diagram；
Step C2, the algebraic decision diagram that the step C1 algebraic decision diagram generated and step B generate is extracted and synthesized a new algebraic decision diagram。
5. the structure of a kind of routing table according to claim 1 and lookup method, is characterized in that, described step E particularly as follows:
Step E1, record root node are as present node；
If step E2 present node is leaf node, jump to step E5；
If step E3 present node is not leaf node, and the value of the index bit that the binary value of purpose IP address is from left to right is that 1 present node points to its right child nodes, returns step E2；
If step E4 present node is not leaf node, and the value of the index bit that the binary value of purpose IP address is from left to right is that 0 present node points to its left child nodes, returns step E2；
Step E5, taking-up leaf node value also return。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610224760.XA CN105704040B (en) | 2016-04-12 | 2016-04-12 | A kind of building of routing table and lookup method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610224760.XA CN105704040B (en) | 2016-04-12 | 2016-04-12 | A kind of building of routing table and lookup method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105704040A true CN105704040A (en) | 2016-06-22 |
| CN105704040B CN105704040B (en) | 2018-12-28 |
Family
ID=56218635
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610224760.XA Expired - Fee Related CN105704040B (en) | 2016-04-12 | 2016-04-12 | A kind of building of routing table and lookup method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105704040B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020073988A1 (en) * | 2018-10-12 | 2020-04-16 | 华为技术有限公司 | Routing table entry generation method and apparatus, and trie tree generation method and apparatus |
| WO2021121116A1 (en) * | 2019-12-20 | 2021-06-24 | 中盈优创资讯科技有限公司 | Routing broadcasting method and apparatus |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100037016A1 (en) * | 2008-08-06 | 2010-02-11 | Fujitsu Limited | Method and system for processing access control lists using an exclusive-or sum-of-products evaluator |
| US8775352B2 (en) * | 2010-03-01 | 2014-07-08 | At&T Intellectual Property I, L.P. | Methods and apparatus to model end-to-end class of service policies in networks |
| CN104618332A (en) * | 2014-12-30 | 2015-05-13 | 桂林电子科技大学 | Secure two-party computation method and system based on symbol boundary value binary decision diagram |
-
2016
- 2016-04-12 CN CN201610224760.XA patent/CN105704040B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100037016A1 (en) * | 2008-08-06 | 2010-02-11 | Fujitsu Limited | Method and system for processing access control lists using an exclusive-or sum-of-products evaluator |
| US8775352B2 (en) * | 2010-03-01 | 2014-07-08 | At&T Intellectual Property I, L.P. | Methods and apparatus to model end-to-end class of service policies in networks |
| CN104618332A (en) * | 2014-12-30 | 2015-05-13 | 桂林电子科技大学 | Secure two-party computation method and system based on symbol boundary value binary decision diagram |
Non-Patent Citations (2)
| Title |
|---|
| TIANLONG GU,ZHOUBO XU: "The symbolic algorithms for maximum flow in networks", 《COMPUTERS&OPERATIONS RESEARCH》 * |
| 徐周波 等: "加权约束满足问题的改进RDS符号代数决策图求解算法", 《模式识别与人工智能》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020073988A1 (en) * | 2018-10-12 | 2020-04-16 | 华为技术有限公司 | Routing table entry generation method and apparatus, and trie tree generation method and apparatus |
| US11627072B2 (en) | 2018-10-12 | 2023-04-11 | Huawei Technologies Co., Ltd. | Routing entry generation method and apparatus and trie generation method and apparatus |
| WO2021121116A1 (en) * | 2019-12-20 | 2021-06-24 | 中盈优创资讯科技有限公司 | Routing broadcasting method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105704040B (en) | 2018-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1344152B1 (en) | Apparatus and method for performing high-speed ip route lookup and managing routing/forwarding tables | |
| US6985483B2 (en) | Methods and systems for fast packet forwarding | |
| JP4268337B2 (en) | Router and method for optimal routing table compression | |
| CN101345707B (en) | Method and apparatus for implementing IPv6 packet classification | |
| US7315547B2 (en) | Packet forwarding device | |
| JP3881663B2 (en) | Packet classification apparatus and method using field level tree | |
| US6691171B1 (en) | Method and system for address lookup in data communication | |
| US10164884B2 (en) | Search apparatus, search configuration method, and search method | |
| Le et al. | Memory-efficient and scalable virtual routers using FPGA | |
| CN110460529B (en) | Data processing method and chip for forwarding information base storage structure of content router | |
| CN102045412A (en) | Method and equipment for carrying out compressed storage on internet protocol version (IPv)6 address prefix | |
| Li et al. | An improved trie-based name lookup scheme for named data networking | |
| Li et al. | A power-saving pre-classifier for TCAM-based IP lookup | |
| CN111177578B (en) | Search method for most influential community around user | |
| CN105704040A (en) | Routing table constructing and lookup method | |
| CN112565072B (en) | Router compression method, router and storage medium | |
| Hsieh et al. | A classified multisuffix trie for IP lookup and update | |
| Li et al. | A memory-efficient parallel routing lookup model with fast updates | |
| Li et al. | MEET-IP: Memory and energy efficient TCAM-based IP lookup | |
| Kőrösi et al. | On the memory requirement of hop-by-hop routing: Tight bounds and optimal address spaces | |
| Kniesburges et al. | Hashed Patricia Trie: Efficient longest prefix matching in peer-to-peer systems | |
| Hsieh et al. | A novel dynamic router-tables design for IP lookup and update | |
| Behdadfar et al. | IP lookup using the novel idea of scalar prefix search with fast table updates | |
| KR100493099B1 (en) | Route lookup and routing/forwarding table management for high-speed internet protocol router | |
| Lin et al. | Improved IP lookup technology for trie-based data structures |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181228 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |