CN1447223A - TCAM high speed updating method supporting route compress - Google Patents

TCAM high speed updating method supporting route compress Download PDF

Info

Publication number
CN1447223A
CN1447223A CN 03109123 CN03109123A CN1447223A CN 1447223 A CN1447223 A CN 1447223A CN 03109123 CN03109123 CN 03109123 CN 03109123 A CN03109123 A CN 03109123A CN 1447223 A CN1447223 A CN 1447223A
Authority
CN
China
Prior art keywords
prefix
tcam
route
node
subspace
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
Application number
CN 03109123
Other languages
Chinese (zh)
Other versions
CN1191520C (en
Inventor
梁志勇
徐恪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CN 03109123 priority Critical patent/CN1191520C/en
Publication of CN1447223A publication Critical patent/CN1447223A/en
Application granted granted Critical
Publication of CN1191520C publication Critical patent/CN1191520C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

TCAM high speed renew method supporting route compact characterizes in that it is a new TCAM high speed renewing method combining two steps of prefix renew on the basis of prefix chain constraint of partitioning tree structure route compact and space in TCAM chip into N subspaces, in which, principle of renewing prefix is if the said nexus is redundancy, if so, it won't be renewed, or renewed, a sub-space partition evaluatun function is used to judge if the N sub-space partition influences TCAM renew performance with the advantage of supporting high speed route renew and effective route list compact and good extension to IP v6 protocol.

Description

Support the TCAM high speed update method of route compression
Technical field
Support TCAM (Ternary Content Addressable Memory) the high speed update method of route compression to belong to high speed IP address search field, internet.
Background technology
TCAM (Ternary Content Addressable Memory Ternary Content Addressable Memory) technology is a kind of hardware searching technology that occurs in recent years, and it can realize route querying at a high speed.The TCAM chip internal uses concurrent technique, can obtain the complexity of searching of O (1).The seek rate of obtainable in the market TCAM chip is the fastest to reach 100M time/second.Compare with other route querying technology, the TCAM technical advantage is that seek rate is fast, realizes fairly simple.But also there are following three shortcomings in it: 1, cost height.The TCAM chip is than the SRAM of same memory space, and DRAM is expensive a lot.2, power consumption is big.The TCAM chip internal adopts concurrent technique to carry out the comparison of key word, and inner power consumption is very big.3, routing update complexity.When realizing that with the TCAM technology longest-prefix is searched, route prefix needs to sort in a certain order in the TCAM chip, and this makes routing update operate relative complex.
In the Internet network, topology is dynamic change, and route also is dynamically to change.Router is correct for the forwarding that guarantees to divide into groups, and must change route fast to make reflection, timely new route is joined routing table, and expired route is deleted from routing table.The processing speed of routing update becomes an important evaluation index of Route Lookup Scheme.Inefficient routing update meeting influences the route querying performance of TCAM greatly, increases the delay of route querying.
For three shortcomings of TCAM technology, the researcher has proposed corresponding solution.For shortcoming 1,2, can solve by the method for compression routing table.Routing table after the compression reduces the demand of TCAM storage space, uses the TCAM chip than low capacity just can satisfy memory requirement, and the cost that this has just reduced the TCAM technology uses the TCAM chip of low capacity also to reduce the power consumption and the heat radiation of chip internal simultaneously.Liu proposes the routing table compression algorithm of a kind of TCAM based on Prunning (deleting) and Mask Extension (mask expansion) technology.This algorithm can reach the ratio of compression about 40% to actual routing table in the Internet network.But the renewal process complexity of algorithm, renewal speed is very slow, is difficult to satisfy the speed of routing update in the Internet network.
For shortcoming 3, Shah is based on the route sortord of prefix chain constraint among the TCAM (in the Tries tree construction, path from the root node to the leafy node is called chain, prefix chain constraint is meant that the rule that the route prefix that occurs on the chain should be stored in low more address according to the prefix the closer to leaf stores in TCAM), CAO_OPT routing update algorithm is proposed.Under the worst condition, the renewal complexity of CAO_OPT algorithm is O (D/2) (D is a maximum chain length in the Tries tree), and under the average case, the renewal complexity of CAO_OPT can reach O (AD/2) (AD is the average length of all chains in the Tries tree).When route prefix was fewer in the routing table, the AD value was also smaller, and the CAO_OPT algorithm performance is fine.But along with the increase of route prefix, the Tries tree node distributes more and more intensive, and the AD value also increases thereupon, the corresponding decline of CAO_OPT algorithm performance.Especially to the IPv6 agreement, address size expands to 128Bits from 32Bits, and the route prefix number in the routing table increases greatly, and the performance of CAO_OPT algorithm can descend a lot.
Summary of the invention
The object of the present invention is to provide a kind of TCAM high speed update method of supporting the route compression.
The lookup method that the present invention proposes is characterised in that, it be a kind of all based on the compression of the route of tree construction be based upon the TCAM high speed update methods that lump together before and after these two steps of prefix updates on the prefix chain constraint basis that spatial division in a TCAM (Ternary Content Addressable Memory) chip is the N sub spaces, it contains following steps successively:
(1) in tree construction, find representative to upgrade the node fn of route, upgrade route and be meant increase route or deletion route;
(2) whether the prefix of judging fn needs to be updated among the TCAM:
If need to upgrade, then execution in step (3);
If need not to upgrade, then execution in step (4);
(3) the prefix updates of fn to TCAM;
(4) whether the child node of judging fn needs to be updated among the TCAM:
If need to upgrade, then execution in step (5);
If need not to upgrade, then execution in step (6);
(5) the prefix updates of fn child node to TCAM;
(6) data member of renewal node fn;
Wherein, to TCAM, it contains following steps to described step (3) successively the prefix updates of fn:
3.1 utilize evaluation function Tmin (W is the TCAM spatial division N subspace N), wherein: T min ( W , N ) = Min i = NtoW ( T min ( i - 1 , N - 1 ) + F ( i , W ) )
W represents the IP address size, also is maximum route prefix length;
N represents to divide the number of subspace;
T Min(W, the N) prefix of expression [0, W] length of interval, under the division of N subspace, the minimum value of move operation and write operation summation;
T Min(i-1, the N-1) prefix of expression [0, i-1] length of interval, under the division of N-1 subspace, the minimum value of move operation and write operation summation;
(i W) is illustrated in the interior prefix in interval [i, W] to F, upgrades the number of action required in a sub spaces.
3.2 the length according to prefix finds prefix subspace L corresponding among the TCAM k=[l K-1+ 1, l k];
3.3 at subspace L kIn, according to the constraint of prefix chain, the route prefix on the tree chain is carried out move operation;
3.4 the prefix updates of fn to TCAM;
Described step (2), judge that the principle whether prefix of fn needs to be updated among the TCAM is, whether this route prefix is redundant, be this route prefix if having identical next hop address and outbound port with its father node, that is to say, their forwarding result is the same, and then this route prefix is redundant in routing table, then is not updated to TCAM; Otherwise, just need be updated among the TCAM.
Use proof: it has following characteristics: support routing update at a high speed, support effective routing table compression, the IPv6 agreement is had favorable expansibility.
Description of drawings
Fig. 1. the program flow chart that route is upgraded when increasing prefix.
Fig. 2. the program flow chart that route is upgraded during the deletion prefix.
The program flow chart (prefix length of hcld-＞prefixlen:hcld node prefix) that Fig. 3 .TCAM prefix increases.
Program flow chart (the P of Fig. 4 .TCAM prefix deletion 0: the subspace is the prefix node of close clear area).
The N subspace is divided in Fig. 5 .TCAM.
Fig. 6. increase the prefix synoptic diagram in the subspace.
Fig. 7. deletion prefix synoptic diagram in the subspace.
Embodiment
In order to reduce TCAM chip cost and power consumption, we compress the TCAM routing table.The basic thought of compression is when upgrading route prefix in TCAM, judges at first whether this route prefix is redundant, if redundancy then be not updated to TCAM, this has reduced the use in TCAM space.Judge whether redundancy becomes route compression section main design problems to route prefix.
In the routing table structure based on the Tries tree, if route prefix P1 is the father node of route prefix P2, P1 has next hop address identical with P2 and outbound port simultaneously, and route searching result is P1 and P2 so, and their forwarding result is the same.At this moment, P2 is redundant in routing table, and we can carry out P2 and delete, the route prefix of P2 are not written in the TCAM chip.We carry out the route compression based on such thought.In order to support compression, we need increase a mark prun_flag to the Tries node, if prun_flag be 1 the route prefix of this node of expression representative can delete, need not be updated in the TCAM chip, if prun_flag be 0 the route prefix of this node of expression representative can not delete, should be updated among the TCAM.
Route is compressed in when increasing route and deletion route, all needs to carry out.Fig. 1, Fig. 2 are when increasing route and deletion route, the process flow diagram of route compression process.Among the figure, tcam_add is that TCAM shown in Figure 3 increases the prefix process; Tcam_delete is a TCAM deletion prefix process shown in Figure 4; Parent is the father node pointer of node.
In order to guarantee that the TCAM chip can carry out the longest matched and searched, the route prefix in the TCAM adopts the constraint of prefix chain to organize in proper order.The constraint of prefix chain is based on the Tries tree construction, and we safeguard that the route prefix of the auxiliary TCAM of a Tries tree construction upgrades.
We are the spatial division in the TCAM N sub spaces, are respectively { S 1, S 2, S 3..., S N-1, S N; Between a related prefix area, each subspace, be respectively { L 1=[0, l 1], L 2=[l 1+ 1, l 2] ..., L N-1=[l N-2+ 1, l N-1], L N=[l N-1+ 1, W] }, l wherein 1, l 2.., l N-1Be the integer of [0, W], and satisfy l 1＜l 2＜...＜l N-1These intervals have been divided into continuous N section to route prefix length of interval [0, W].(W is the IP address size, also is maximum route prefix length).If its prefix length of certain prefix belongs to L between the prefix area k, then this prefix is stored in S TCAM planted agent kIn the subspace.Fig. 5 is the synoptic diagram that the subspace is divided in the TCAM.The grey bar frame table shows an address location in the TCAM among the figure.Dotted line is represented the chain relation of prefix in the Tries tree.
Space idle in the subspace is positioned at the low address end, this with free space be placed on high address end compare, can effectively reduce the number of times that moves when upgrading.The closer to the node of leaf, the density of node is big more in the chain, if free space is placed on high address end, when adding near leafy node, their father node needs the frequent move operation that carries out, and this has increased the expense of upgrading greatly.When carrying out prefix updates, at first, in the subspace of correspondence, carry out then this prefix is added and deletion action according to the subspace under the length judgement prefix of prefix.Interpolation and deletion to prefix in the subspace is described further below.● prefix increases in the subspace
Fig. 6 is that prefix increases synoptic diagram in the subspace.In order to finish prefix updates based on chain, we need increase by two variable: tcam_index, hcld at the Tries tree node for each prefix node p.Tcam_indx is the position of p node prefix in the TCAM chip.Hcld is a pointer, and it points in a plurality of prefix child nodes of p node, the minimum child node in memory location in TCAM.P is initiate prefix node among Fig. 6.According among the figure shown in the arrow, at first the prefix of hcld (hcld (p)) is moved to free space, the prefix of hcld (p) moves to hcld (hcld (p)) position then, at last the p node is write hcld (p) position.
Fig. 3 is for carrying out the process flow diagram that prefix increases whole process in TCAM.Step to process flow diagram is explained as follows:
1. establish the prefix node of fn, put current node pn=fn, find the prefix subspace L of node fn correspondence for increasing k
2. if the prefix of pn-＞hcld belongs to L kThe subspace skips to 3; Otherwise skip to 4;
3. pn-＞hcld is joined in the hcld_array array, put pn=pn-＞hcld, to 2;
4. according to method shown in Figure 6, the node prefix in the mobile hcld_array array of order;
Variable i among Fig. 3 is interim counting variable.● prefix deletion in the subspace
The synoptic diagram of prefix deletion in Fig. 7 subspace.In order to carry out the deletion of prefix based on chain, we need increase variable a: parent for each node p in the Tries tree.It is a pointer, points to the prefix father node in the Tries tree of p node, and we also need to write down in the subspace the prefix node of close free space simultaneously.As shown in Figure 4, node p is the node that will delete, and q0 is the node of close free space, parent (q 0) the position be lower than node p, parent (parent (q 0)) the position be higher than p.We delete node p according to the following steps: at first parent (q 0) prefix move to the p site position, then q 0Prefix move to parent (q 0) the position, discharge q at last 0Shared TCAM space.
Fig. 4 is for carrying out the process flow diagram that prefix is deleted whole process in TCAM.Step to process flow diagram is explained as follows:
1. establish the prefix node of fn for deletion, affiliated subspace is L k, p 0Be L kIn the node of close free space, put and work as
Preceding node pn=p 0
2., skip to 3 if the prefix position of pn-＞parent is lower than the fn node; Otherwise skip to 4;
3. pn-＞parent is joined in the parent_array array, put pn=pn-＞parent, skip to 2;
4. according to method shown in Figure 7, the node in the mobile parent_array array of order;
Suppose that maximum chain length is D in the Tries tree, under the best-case, the complexity of update algorithm is (D/N); Under the worst condition, the renewal complexity is D.If we are in the middle of being placed between the free area of subspace, the performance of update algorithm can improve in a nearly step, and best-case is D/2N down, and worst condition is D/2 down.
Division between N sub spaces prefix area directly affects the more new capability of TCAM, and inappropriate division will cause TCAM to upgrade performance decrease.For quantization influence, we divide evaluation function T with the subspace, and (W N) estimates division.(W, N) the given routing table of expression dividing under the N situation, is upgraded the route of prefix length between [0, W] to T, the total number of move operation and write operation in the TCAM chip.(W N) reaches hour, and we think that divide N this moment is optimum as T.
(W, N), we adopt the thought of passing rule in order to calculate T.Suppose to be between the prefix area of N sub spaces in the N sub spaces L N=(i W), [0, W] interval prefix updates, is divided into two parts: [0, i-1] interval and [i, W] interval.[i, W] interval prefix is at subspace L NThe interior renewal, the prefix in [0, i-1] interval is at L 1To L N-1Upgrade in the N-1 sub spaces.Thus we can obtain T (W, N) pass the rule expression formula.
T (W, N)=T (i-1, N-1)+F (i, W) (1) when T (W, N) hour, we can further obtain (2) formula: T min ( W , N ) = Min i = NtoW ( T min ( i - 1 , N - 1 ) + F ( i , W ) ) - - - ( 2 )
In formula (1) and (2), (i W) is illustrated in the interior prefix in interval [i, W], at L to F NUpgrade the number of action required in the subspace.(i-1 N-1) is illustrated in the interior prefix in interval [0, i-1], at L to T 1To L N-1Required operation when (N-1) upgrading in the sub spaces.T Min(W N) is T (W, minimum value N), T Min(i-1 N-1) is T (i-1, minimum value N-1).
For (2) formula, we can promote and obtain more generally expression formula (3): T min ( y , x ) = Min i = xtoy ( T min ( i - 1 , x - 1 ) + F ( i , y ) )
In the formula (3), y belongs to interval [1, W], and x belongs to interval [1, N].T Min(y, x) expression dividing under the x situation, is upgraded the route of prefix length between [0, y] to given routing table, and required minimum moves and the write operation number in the TCAM chip.T Min(i-1 x-1) is illustrated in the interior prefix in interval [0, i-1], at L 1To L X-1Required operation when (x-1) upgrading in the sub spaces.(i y) is illustrated in the interior prefix in interval [i, y], at L to F xUpgrade the number of action required in the subspace.
In the actual computation process, for fear of passing rule, we can calculate initial value T earlier Min(k 1, 1) and (k 1And then utilize (2) formula to calculate T=1 to W), Min(k 2, 2) and (k 2=2 to W), and the like, T calculated at last Min(W, N), computation process needs to calculate ((2*W-N+2) * (N-1)/2+1) individual T value altogether.
(i, W) Zhi calculating the position, also will be considered the order that route prefix inserts except considering route prefix in the Trie tree to F.Such as: on certain bar chain two route prefix are arranged in the Tries tree, if add the prefix near root node earlier, the prefix that adds again away from root node does not then need move operation, only needs write operation, and used operand is 2; If add the prefix away from root node earlier, the prefix that adds near root node then needs move operation 1 time again, and used total operand is 3.Calculate for convenience, (i W) is maximum operand possible in the left child node chain to F.So-called left child node chain is meant the chain of being made up of following node: certain node fn, left child node fn-＞l_child of fn, left child node fn-＞l_child-＞l_child of fn-＞l_child ..., and the like, last in the chain-individual node is the lobus sinister child node of fn.
Calculate T Min(W, N) simultaneously, we also can obtain between the prefix area of N sub spaces.Calculate T Min(W N) and determine the algorithm pseudo code that best K subspace is divided, is expressed as follows: 
N_Partition () initialization T[W+1] [N+1] array; ∥ division evaluation function Tmin (y, x) initialization bound[W+1] [N+1] array; ∥ prefix section boundaries for (i=1; I＜=W; I++) calculate T[i] [1]; For (x=2; X＜=N; X++) ∥ x circulation { for (y=x; Y＜=W; Y++) ∥ y circulation ∥ utilizes recursion formula (3) to calculate T[y] [x] for (i=x; I＜=y; I++) tempT=T[i-1] and [x-1]+F (i, y); ∥ tempT and tempBound are temporary variable tempBound=i; If (tempT＜T[y] [x]) ∥ judges T[y] [x] whether reach minimum bound[y] [x]=tempBound; T[y] [x]=tempT; ∥ obtains the prefix interval division N_Bound[N-1 of N sub spaces]=bound[W] [N]; ∥ N_Bound array is subspace prefix section boundaries for (i=N-2; I＜=1; I--) N_Bound[i]=bound[N_Bound[i+1]] [i+1]; ∥ RT is root node F (i, the j) { fn=RT of the Tries structure of known routing table; Count=0; ∥ all operations counting while (fn!=NULL) { if (prefix length＞=i﹠amp of fn; Amp; ﹠amp; Amp; Interval { ∥ is according to left child node chain calculating operation number child=fn-＞l_child at [i, j] for the prefix that the ∥ of the prefix length of fn＜=j) judges fn;=NULL) { (prefix length of child＜=j) ∥ judges that whether child is at interval [i, j] interior count++ to if; Move operation child=child-＞l_child of ∥;＜!--SIPO＜DP n=" 6 "〉--〉＜dp n=" d6 "/count++; ∥ write-once operation } the next node of fn=fn; ∥ utilizes the next node of fn to travel through whole Tries tree construction } }
Function F (i, the j) route prefix of expression length in interval [i, j], the number of used operation when in TCAM, upgrading.T[W+1 in the T array] [K+1] element is last T Min(W, K) value, N_bound[i] (i=1 is to N-1) be N-1 border of N sub spaces.
After obtaining the division of N sub spaces, in order to guarantee making full use of of space, how many distribution of the subspace size of N can according to distributing of interior volume route prefix number separately.
The route compression section also is based on the Tries structure, the TCAM prefix updates that it can compatible back, and the operation of compression is very simple, can not influence routing update speed.Compression method with us compresses routing table actual among the Internet, can reach average 20% ratio of compression.
Because route compression section and TCAM route prefix more new portion all are based on the Tries tree construction, the Tries structure has favorable expansibility to the IPv6 routing table, so our update algorithm also has favorable expansibility to the renewal of IPv6 routing table.

Claims (2)

1. support the TCAM high speed update method of route compression to contain the step of route compression, it is characterized in that: it be a kind of all based on the compression of the route of tree construction be based upon the TCAM high speed update methods that lump together before and after these two steps of prefix updates on the prefix chain constraint basis that spatial division in a TCAM (Ternary Content Addressable Memory) chip is the N sub spaces, it contains following steps successively:
(1) in tree construction, find representative to upgrade the node fn of route, upgrade route and be meant increase route or deletion route;
(2) whether the prefix of judging fn needs to be updated among the TCAM:
If need to upgrade, then execution in step (3);
If need not to upgrade, then execution in step (4);
(3) the prefix updates of fn to TCAM;
(4) whether the child node of judging fn needs to be updated among the TCAM:
If need to upgrade, then execution in step (5);
If need not to upgrade, then execution in step (6);
(5) the prefix updates of fn child node to TCAM;
(6) data member of renewal node fn;
Wherein, to TCAM, it contains following steps to described step (3) successively the prefix updates of fn:
3.1 utilize evaluation function Tmin (W is the TCAM spatial division N subspace N), wherein: T min ( W , N ) = Min i = NtoW ( T min ( i - 1 , N - 1 ) + F ( i , W ) )
W represents the IP address size, also is maximum route prefix length;
N represents to divide the number of subspace;
T Min(W, the N) prefix of expression [0, W] length of interval, under the division of N subspace, the minimum value of move operation and write operation summation;
T Min(i-i, the N-1) prefix of expression [0, i-1] length of interval, under the division of N-1 subspace, the minimum value of move operation and write operation summation;
(i W) is illustrated in the interior prefix in interval [i, W] to F, upgrades the number of action required in a sub spaces.
3.2 the length according to prefix finds prefix subspace L corresponding among the TCAM k=[l k-1+1, l k];
3.3 at subspace L kIn, according to the constraint of prefix chain, the route prefix on the tree medium chain is carried out move operation;
3.4 the prefix updates of fn to TCAM;
2. the TCAM high speed update method of support route compression according to claim 1, it is characterized in that: described step (2), judge that the principle whether prefix of fn needs to be updated among the TCAM is, whether this route prefix is redundant, be this route prefix if having identical next hop address and outbound port, that is to say that their forwarding result is the same with its father node, then this route prefix is redundant in routing table, then is not updated to TCAM; Otherwise, just need be updated among the TCAM.
CN 03109123 2003-04-04 2003-04-04 TCAM high speed updating method supporting route compress Expired - Fee Related CN1191520C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 03109123 CN1191520C (en) 2003-04-04 2003-04-04 TCAM high speed updating method supporting route compress

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 03109123 CN1191520C (en) 2003-04-04 2003-04-04 TCAM high speed updating method supporting route compress

Publications (2)

Publication Number Publication Date
CN1447223A true CN1447223A (en) 2003-10-08
CN1191520C CN1191520C (en) 2005-03-02

Family

ID=28050242

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 03109123 Expired - Fee Related CN1191520C (en) 2003-04-04 2003-04-04 TCAM high speed updating method supporting route compress

Country Status (1)

Country Link
CN (1) CN1191520C (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007104204A1 (en) * 2006-03-15 2007-09-20 Zte Corporation A method for managing the router table using the ternary content addressable memory
WO2008028412A1 (en) * 2006-08-29 2008-03-13 Huawei Technologies Co., Ltd. A routing method, a routing apparatus and a method for storing routing information
CN100461698C (en) * 2006-05-31 2009-02-11 华为技术有限公司 Method and device for storing converting route
CN102291301A (en) * 2011-08-10 2011-12-21 杭州迪普科技有限公司 Message characteristic matching method and device
US8089961B2 (en) 2007-12-07 2012-01-03 University Of Florida Research Foundation, Inc. Low power ternary content-addressable memory (TCAMs) for very large forwarding tables
CN102375820A (en) * 2010-08-12 2012-03-14 盛科网络（苏州）有限公司 Method for compressing TCAM (ternary content addressable memory) table items
CN101631086B (en) * 2009-08-10 2012-09-26 武汉烽火网络有限责任公司 Routing list partitioning and placing method searched by parallel IP route
CN101651693B (en) * 2009-09-15 2012-10-03 成都市华为赛门铁克科技有限公司 Aged rule maintenance method and equipment
CN107222401A (en) * 2017-05-05 2017-09-29 大连理工大学 A kind of route querying system and method based on TCAM
CN112787938A (en) * 2021-01-14 2021-05-11 北京星网锐捷网络技术有限公司 Routing table item configuration method and device
CN117880227A (en) * 2024-03-12 2024-04-12 苏州仰思坪半导体有限公司 Chip routing system, method and related device
CN117880227B (en) * 2024-03-12 2024-05-31 苏州仰思坪半导体有限公司 Chip routing system, method and related device

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039252B (en) * 2006-03-15 2012-05-23 中兴通讯股份有限公司 Method for managing route table of ternary content addressable memory
WO2007104204A1 (en) * 2006-03-15 2007-09-20 Zte Corporation A method for managing the router table using the ternary content addressable memory
CN100461698C (en) * 2006-05-31 2009-02-11 华为技术有限公司 Method and device for storing converting route
WO2008028412A1 (en) * 2006-08-29 2008-03-13 Huawei Technologies Co., Ltd. A routing method, a routing apparatus and a method for storing routing information
US8089961B2 (en) 2007-12-07 2012-01-03 University Of Florida Research Foundation, Inc. Low power ternary content-addressable memory (TCAMs) for very large forwarding tables
CN101631086B (en) * 2009-08-10 2012-09-26 武汉烽火网络有限责任公司 Routing list partitioning and placing method searched by parallel IP route
CN101651693B (en) * 2009-09-15 2012-10-03 成都市华为赛门铁克科技有限公司 Aged rule maintenance method and equipment
CN102375820A (en) * 2010-08-12 2012-03-14 盛科网络（苏州）有限公司 Method for compressing TCAM (ternary content addressable memory) table items
CN102375820B (en) * 2010-08-12 2013-07-31 盛科网络（苏州）有限公司 Method for compressing TCAM (ternary content addressable memory) table items
CN102291301A (en) * 2011-08-10 2011-12-21 杭州迪普科技有限公司 Message characteristic matching method and device
CN102291301B (en) * 2011-08-10 2015-06-10 杭州迪普科技有限公司 Message characteristic matching method and device
CN107222401A (en) * 2017-05-05 2017-09-29 大连理工大学 A kind of route querying system and method based on TCAM
CN112787938A (en) * 2021-01-14 2021-05-11 北京星网锐捷网络技术有限公司 Routing table item configuration method and device
CN112787938B (en) * 2021-01-14 2022-09-20 北京星网锐捷网络技术有限公司 Routing table item configuration method and device
CN117880227A (en) * 2024-03-12 2024-04-12 苏州仰思坪半导体有限公司 Chip routing system, method and related device
CN117880227B (en) * 2024-03-12 2024-05-31 苏州仰思坪半导体有限公司 Chip routing system, method and related device

Also Published As

Publication number Publication date
CN1191520C (en) 2005-03-02

Similar Documents

Publication Publication Date Title
US8745316B2 (en) System and method of managing indexation of flash memory
US7418505B2 (en) IP address lookup using either a hashing table or multiple hash functions
US7602785B2 (en) Method and system for performing longest prefix matching for network address lookup using bloom filters
US7139867B2 (en) Partially-ordered cams used in ternary hierarchical address searching/sorting
US6697363B1 (en) Method and apparatus for longest matching prefix determination in a communication network
US7415472B2 (en) Comparison tree data structures of particular use in performing lookup operations
CN1191520C (en) TCAM high speed updating method supporting route compress
EP1551141A1 (en) Apparatus and method using hashing for efficiently implementing an IP lookup solution in hardware
US20120023082A1 (en) Longest Prefix Match Using Binary Search Tree
US20090327316A1 (en) Dynamic Tree Bitmap for IP Lookup and Update
CN1859316A (en) Packet transfer apparatus
US20130261965A1 (en) Hub label compression
CN102484610A (en) Routing table construction method and device and routing table lookup method and device
CN1688140A (en) High-speed multi-dimension message classifying algorithm design and realizing based on network processor
JP3570323B2 (en) How to store prefixes for addresses
CN1216473C (en) TCAM high-speed search method and system supporting multiple nexthop
WO2009076854A1 (en) Data cache system and method for realizing high capacity cache
US11570105B2 (en) Dynamic route profile storage in a hardware trie routing table
US7478109B1 (en) Identification of a longest matching prefix based on a search of intervals corresponding to the prefixes
CN1787477A (en) Method for searching IPv6 routing table
CN106066818A (en) A kind of data layout's method improving data de-duplication standby system restorability
CN101277252A (en) Method for traversing multi-branch Trie tree
US7085235B2 (en) Method and apparatus for constructing and searching IP address
CN113098778A (en) Flow table compression method based on spanning tree folding routing in software defined network
CN1859208A (en) Method and system for managing TCAM route list

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20050302