CN102420761A - Route iteration method - Google Patents
Route iteration method Download PDFInfo
- Publication number
- CN102420761A CN102420761A CN2011103980205A CN201110398020A CN102420761A CN 102420761 A CN102420761 A CN 102420761A CN 2011103980205 A CN2011103980205 A CN 2011103980205A CN 201110398020 A CN201110398020 A CN 201110398020A CN 102420761 A CN102420761 A CN 102420761A
- Authority
- CN
- China
- Prior art keywords
- route entry
- iteration
- chained list
- route
- treating
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a route iteration method which comprises the following steps: when a first data record does not have a route entry which has same next hop with a route entry to be iterated, searching a device where the route entry to be iterated is and a route entry which is not iterated at next hop in a global routing table, or searching a route entry whose destination address is same with the next hop of the route entry to be iterated in the first data record; taking the searched route entry as route information of the route entry to be iterated, and adding the route information into the first data record with the route entry to be iterated to complete iteration of the route entry to be iterated, wherein, the first data record is used for saving a route entry which is iterated in the device. According to the invention, iteration efficiency of an iteration route is raised.
Description
Technical field
The present invention relates to network field, be specifically related to a kind of route alternative manner.
Background technology
Along with development of Communication Technique, network size constantly enlarges, and the quantity of routing table constantly enlarges, if three-layer network appliance still uses original those poor efficiency routing table processing modes, the fail safe of equipment, stability will receive very big threat.Therefore must improve those poor efficiency routing table processing modes by every means.A kind of technology that adopts at present is exactly the efficient processing mode to the iteration route.When adding static routing, next_hop generally is and the interface IP address of the direct-connected neighbours' route of local router, does not need iteration this time; Certainly also can be write as the interface IP address of the arbitrary router on the path that arrives the destination fully, this time, route just became an iteration route, need carry out iteration.
Suppose six router series connection of A-B-C-D-E-F, under normal condition on the router-A, add route like this: ip route F f-mask B, can certainly add like this: ip route F f-mask E, next jumping that arrive F is E.But the route entry that arrives E must be arranged in local routing table: ip route E e-mask D, next jumping that arrives E is D; The route entry that arrives D must be arranged in local routing table: ip route D d-mask C, next jumping that arrives D is C; The route entry that arrives C must be arranged in local routing table: ip rotue C c-mask B, next jumping that arrives C is B; The direct-connected route that arrives B is arranged in local routing table.It more than is exactly the iteration route of a standard.
Implementation before present technique proposes is like this, and iteration route and non-iteration route, common storage when carrying out the route iteration, all will be carried out iteration at every turn in overall routing table in the Adelson-Velskii-Landis tree node; The routing table of said overall each agreement routing iinformation of routing table storage, data structure adopts Adelson-Velskii-Landis tree to realize that index is destination address and mask.If realize by this way, for the iteration route, can repeatedly get into and search (it is consistent with the iteration number of plies to get into number of times) in the corresponding Adelson-Velskii-Landis tree of overall routing table, search efficiency is too low.
Summary of the invention
The technical problem that the present invention will solve is how to improve the iteration efficient of iteration route.
In order to address the above problem, the invention provides a kind of route alternative manner, comprising:
When not existing in first data record when having the route entry of identical next jumping with the route entry of treating iteration; In overall routing table, search the route entry place equipment of treating iteration and the non-iterative route entry of next hopscotch, or in said first data record, search the identical route entry of next jumping in destination address and the said route entry of treating iteration; As the routing iinformation of the route entry of treating iteration with treat that the route entry of iteration adds in into said first data record together, the said route entry of iteration of treating is accomplished iteration with the route entry that finds; Said first data record is used to preserve the route entry of having accomplished iteration on the equipment of place.
Further, when the said iteration number of plies of treating the route entry of iteration is 0, in overall routing table, search the route entry place equipment of treating iteration and the non-iteration route entry of its next hopscotch; Be not 0 o'clock, search in said first data record that next jumps identical route entry in destination address and the said route entry of treating iteration.
Further, described route alternative manner also comprises:
When having next jumping route entry identical in first data record,, treat the route entry completion iteration of iteration with the routing iinformation of this route entry in first data record routing iinformation as the route entry of treating iteration with the route entry of treating iteration; If there is not this route entry of treating iteration in first data record, then this is treated that the route entry of iteration and routing iinformation thereof add into said first data record.
Further; Said first data record is the first double-deck chained list; Next jumping in the ground floor chained list node storage route entry; Data in the second layer chained list node of a ground floor chained list node correspondence comprise: have a route entry of next jumping in this ground floor chained list node, and the pointer that points to the routing iinformation of this route entry; The corresponding one or more second layer chained list nodes of same ground floor chained list node.
Further, in said first data record, search in destination address and the said route entry of treating iteration next step of jumping identical route entry and comprise:
Travel through the second layer chained list under each ground floor chained list node; If the destination address and the mask matches of route entry in next jumping of pending route entry and mask and the second layer chained list node, then with the route entry of preserving in this second layer chained list node as the route entry that finds; If the destination address of route entry and mask all are different from pending route entry in all nodes of second layer chained list, then search the route entry failure.
Further, described route alternative manner also comprises:
If in the overall routing table or the first double-deck chained list, search the route entry failure, then in second data record, add the route entry of treating iteration; Said second data record is used to preserve the route entry of treating iteration on the equipment of place.
Further; Said second data record is the second double-deck chained list; In the ground floor chained list node storage route entry next jumped, and the data of storing in the second layer chained list node of a ground floor chained list node correspondence comprise: a route entry with next jumping in this ground floor chained list node; The corresponding one or more second layer chained list nodes of same ground floor chained list node.
Further, described route alternative manner also comprises:
At regular intervals, each route entry in the second double-deck chained list respectively as the route entry of treating iteration, if accomplish iteration, is then added this route entry, this route entry of deletion from the second double-deck chained list in the first double-deck chained list; If a ground floor chained list node in the second double-deck chained list has no corresponding second layer chained list node, then delete this ground floor chained list node.
Further, described route alternative manner also comprises:
At regular intervals, each route entry in the first double-deck chained list is deleted from the first double-deck chained list successively, then as the route entry of treating iteration; If iteration failure then treats that with this route entry of iteration adds in the second double-deck chained list, delete the routing iinformation of this route entry in the first double-deck chained list; If have no corresponding second layer chained list node under the ground floor chained list node in the first double-deck chained list, then delete this ground floor chained list node.
Technical scheme of the present invention stores the route information table of the success of iteration (promptly accomplishing iteration), can after be used during the iteration route; Prioritization scheme of the present invention adopts two layers of routing iinformation that the storage of linked list iteration is successful, rather than equally is stored in the Adelson-Velskii-Landis tree with non-iteration route, makes the processing branch of route come, and seems more clear; Another prioritization scheme of the present invention uses two double-deck chained lists and periodically updates, if in " iteration success route chained list ", found the route entry with identical next jumping, just can directly accomplish iteration; Even do not find; Also can add in " waiting for iteration route chained list ", wait the time in cycle to arrive, system will carry out iteration with the node in " waiting for iteration route chained list "; Can node be added " iteration success route chained list " after the iteration success, treatment effeciency is higher.
Description of drawings
Fig. 1 is the sketch map of data structure of the present invention;
Fig. 2 is the schematic flow sheet of example among the embodiment one.
Embodiment
To combine accompanying drawing and embodiment that technical scheme of the present invention is explained in more detail below.
Need to prove that if do not conflict, each characteristic among the embodiment of the invention and the embodiment can mutually combine, all within protection scope of the present invention.In addition, though logical order has been shown, under some situation, can carry out step shown or that describe in flow chart by the order that is different from here.
At first some terms that occur among this paper are explained as follows:
Double-deck chained list: in the node of common chained list, embed another chained list, as shown in Figure 1, horizontal chained list is ground floor chained list node Node_0, Node_1 ..., Node_n, be index value wherein with next jumping; Vertically be Node_1 corresponding second layer chained list node node_0, node_1 ..., node_n, comprise the pstRt pointer of body (point to routing infrastructure) in each second layer node.
Route entry for the route entry of this route entry place equipment to destination address, comprising next jumping, destination address, can also comprise mask; Such as the route entry ip route F f-mask E on router-A, wherein node E is next jumping, and node F is a destination address.The routing iinformation of a route entry is used in reference to be shown in how to arrive next jumping in this route entry at least, can use the routing iinformation of another route entry as a route entry.
The iteration number of plies is meant that two jumping figures between the equipment subtract 1, and such as the series connection of three routers of A-B-C, between then direct-connected device A, the B, between the Node B, C etc., the iteration number of plies is 0; And the iteration number of plies between the device A, C is 1; By that analogy.
Embodiment one, and a kind of route alternative manner comprises:
When not existing in first data record when having the route entry of identical next jumping with the route entry of treating iteration; In overall routing table, search the route entry place equipment of treating iteration and the non-iterative route entry of next hopscotch, or in said first data record, search the identical route entry of next jumping in destination address and the said route entry of treating iteration; As the routing iinformation of the route entry of treating iteration with treat that the route entry of iteration adds in into said first data record together, the said route entry of iteration of treating is accomplished iteration with the route entry that finds; Said first data record is used to preserve the route entry of having accomplished iteration on the equipment of place.
In the present embodiment, when the said iteration number of plies of treating the route entry of iteration is 0, in overall routing table, search the route entry place equipment of treating iteration and the non-iteration route entry of next hopscotch wherein; Be not 0 o'clock, search in said first data record that next jumps identical route entry in destination address and the said route entry of treating iteration.
In the present embodiment, said method can also comprise:
When having next jumping route entry identical in first data record,, treat the route entry completion iteration of iteration with the routing iinformation of this route entry in first data record routing iinformation as the route entry of treating iteration with the route entry of treating iteration; If there is not this route entry of treating iteration in first data record, then this is treated that the route entry of iteration and routing iinformation thereof add into said first data record; Is ip route F f-mask C such as next jumping in first data record for the route entry of C; And the route entry of treating iteration is ip route E f-mask C; Though both next jumpings are identical, but still will route entry that treat iteration be added into first data record.
In the present embodiment, said method can also comprise:
If in overall routing table or iteration success route chained list, search the route entry failure, the route entry of treating iteration is then added in the failure of expression iteration in second data record; Said second data record is used to preserve the route entry of treating iteration on the equipment of place.
In the present embodiment; Said first data record can but be not limited to the first double-deck chained list; Such as can be described as " iteration success route chained list "; In the ground floor chained list node storage route entry next jumped, and the data in the second layer chained list node of a ground floor chained list node correspondence comprise: have a route entry of next jumping in this ground floor chained list node, and the pointer that points to the routing iinformation of this route entry; In other words, jump as the chain table index with next; Routing iinformation can be preserved with specific data structure.
In the present embodiment; The possible corresponding one or more second layer chained list nodes of same ground floor chained list node in the first double-deck chained list; Such as six router series connection of A-B-C-D-E-F; Such as next is jumped in the corresponding second layer chained list node of the node of router D in the ground floor chained list, can comprise the second layer chained list node of the route entry of storage from the router-A to F, the second layer chained list node of route entry, the second layer chained list node of route entry etc. from router C to F from router B to E; But next jumping in these route entrys is router D, also comprises the pointer of the routing iinformation of the route entry that sensing is preserved in the above-mentioned second layer chained list.
In the present embodiment, when said first data record is the first double-deck chained list, in said first data record, searches in destination address and the said route entry of treating iteration next step of jumping identical route entry and specifically can comprise:
Travel through the second layer chained list under each ground floor chained list node; If the destination address and the mask matches of route entry in next jumping of pending route entry and mask and the second layer chained list node, then with the route entry of preserving in this second layer chained list node as the route entry that finds.If the destination address of route entry and mask all are different from pending route entry in all nodes of second layer chained list,, then search the route entry failure.
In the present embodiment; When said first data record is the first double-deck chained list; When adding to the said route entry of treating iteration in first data record, judge earlier in the ground floor chained list of this first double-deck chained list whether have the identical node of next jumping of treating the route entry of iteration with this; If have then add second layer chained list node, in order to preserve the route entry that this treats iteration corresponding to this node; If no, then elder generation's interpolation in the ground floor chained list of the first double-deck chained list is used to preserve the node that this treats next jumping of route entry of iteration, adds the corresponding second layer chained list node of this node then, in order to preserve the route entry that this treats iteration.
In the present embodiment, said second data record can be the second double-deck chained list, such as can be described as " waiting for iteration route chained list "; In the ground floor chained list node storage route entry next jumped, and the data of storing in the second layer chained list node of a ground floor chained list node correspondence comprise: a route entry with next jumping in this ground floor chained list node; Just the same with the first double-deck chained list, to jump as the chain table index with next, same ground floor chained list node might corresponding one or more second layer chained list nodes.
In the present embodiment; In second data record, add when treating the route entry of iteration; Whether in the ground floor chained list of the second double-deck chained list, search earlier has and the said identical node of next jumping of treating the route entry of iteration; If have, then directly add the corresponding second layer chained list node of node that is found, in order to preserve the route entry that this treats iteration; If no, then elder generation is used to preserve the said node of treating next jumping of route entry of iteration in the ground floor chained list interpolation of this second double-deck chained list, adds the corresponding second layer chained list node of this node then, in order to preserve the route entry that this treats iteration.
The said route alternative manner of present embodiment specifically can be as shown in Figure 2, comprises the steps:
S1, in first data record, search next jumping route entry identical with the route entry of treating iteration; Said first data record is used to preserve the route entry of having accomplished iteration on the equipment of place, the routing iinformation that reaches this route entry; If can find; Then with the routing iinformation of the route entry that finds routing iinformation as the route entry of treating iteration; Treat the route entry completion iteration of iteration, if this treats that the route entry of iteration is not present in said first data record, then adds; Search less than then carrying out step S2;
S2, judge and saidly treat whether the iteration number of plies of the route entry of iteration is 0; If be not 0 then carry out step S3; If be 0, then in overall routing table, search the non-iterative route entry that the route entry of treating iteration belongs to equipment and its next hopscotch; If can find then the route entry that finds is added into said first data record together as the said routing iinformation and the said route entry of iteration of treating of the route entry of iteration treated; Treat the route entry completion iteration of iteration;
S3, in said first data record; Search that next jumps identical route entry in destination address and the said route entry of treating iteration; If can find then the route entry that finds is added into said first data record together as the routing iinformation and the said route entry of iteration of treating of the route entry of treating iteration; Treat the route entry completion iteration of iteration.
Describe with an object lesson below, such as four router series connection of A-B-C-D, the route entry of treating iteration is the route ip route D f-mask C on the router-A; Suppose only to exist in first data record route entry ip route C f-mask B and corresponding routing iinformation data structure thereof:
Among the step S1, in first data record, can't find next jumping route entry identical, get into step S2 with the route entry of treating iteration;
Among the step S2,, therefore get into step S3 owing to treat that the route entry place device A of iteration and the iteration number of plies that next is jumped between the C are not 0; (if treating that next jumping is router B in the route entry of iteration, then is the non-iterative route entry of in overall routing table, searching between router-A and the router B)
Among the step S3; Because in first data record; Having found destination address is the route entry ip route C f-mask B of router C; Therefore can route entry ip route D f-mask C be added in first data record, and the routing iinformation of route entry ip route C f-mask B is added together, as the routing iinformation of this route entry ip route D f-mask C;
Just accomplished the iteration of route entry ip route D f-mask C this moment.
Can find out from this example, owing to preserved successful route entry and the routing iinformation thereof of iteration, when carrying out the relevant iteration of multilayer number more so again, just can make full use of existing routing iinformation, and need not to go from level to level again to search in the overall routing table.
In the present embodiment, said method can also comprise:
At regular intervals, each route entry in the second double-deck chained list respectively as the route entry of treating iteration, is carried out step S1 to S3; After one route entry is accomplished iteration, in the first double-deck chained list, add this route entry, this route entry of deletion from the second double-deck chained list; If a ground floor chained list node in the second double-deck chained list has no corresponding second layer chained list node, then also delete this ground floor chained list node.
Concrete at a distance from how long, can be provided with as required.
In the present embodiment, said method can also comprise:
At regular intervals; With each route entry in the first double-deck chained list successively as the route entry of treating iteration, from the first double-deck chained list deletion this treat to carry out step S1 to S3 after route entry of iteration, thereby check whether the route of accomplishing iteration changes; Possibly be to iterate to new route; Will change the routing iinformation of route entry this moment, and when the route entry of treating iteration was accomplished iteration and is added back the first double-deck chained list, its routing iinformation is different with preservation before; Possibly be iteration failure, can treat that the route entry of iteration adds in the second double-deck chained list this moment with this, deletes the routing iinformation of this route entry in the first double-deck chained list; If have no corresponding second layer chained list node under the ground floor chained list node in the first double-deck chained list, then also delete this ground floor chained list node.
Concrete at a distance from how long, can be provided with as required.
Certainly; The present invention also can have other various embodiments; Under the situation that does not deviate from spirit of the present invention and essence thereof; Those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of claim of the present invention.
Claims (9)
1. route alternative manner comprises:
When not existing in first data record when having the route entry of identical next jumping with the route entry of treating iteration; In overall routing table, search the route entry place equipment of treating iteration and the non-iterative route entry of next hopscotch, or in said first data record, search the identical route entry of next jumping in destination address and the said route entry of treating iteration; As the routing iinformation of the route entry of treating iteration with treat that the route entry of iteration adds in into said first data record together, the said route entry of iteration of treating is accomplished iteration with the route entry that finds; Said first data record is used to preserve the route entry of having accomplished iteration on the equipment of place.
2. route alternative manner as claimed in claim 1 is characterized in that:
When the said iteration number of plies of treating the route entry of iteration is 0, in overall routing table, search the route entry place equipment of treating iteration and the non-iteration route entry of its next hopscotch; Be not 0 o'clock, search in said first data record that next jumps identical route entry in destination address and the said route entry of treating iteration.
3. route alternative manner as claimed in claim 1 is characterized in that, also comprises:
When having next jumping route entry identical in first data record,, treat the route entry completion iteration of iteration with the routing iinformation of this route entry in first data record routing iinformation as the route entry of treating iteration with the route entry of treating iteration; If there is not this route entry of treating iteration in first data record, then this is treated that the route entry of iteration and routing iinformation thereof add into said first data record.
4. route alternative manner as claimed in claim 1 is characterized in that:
Said first data record is the first double-deck chained list; Next jumping in the ground floor chained list node storage route entry; Data in the second layer chained list node of a ground floor chained list node correspondence comprise: have a route entry of next jumping in this ground floor chained list node, and the pointer that points to the routing iinformation of this route entry; The corresponding one or more second layer chained list nodes of same ground floor chained list node.
5. route alternative manner as claimed in claim 4 is characterized in that, in said first data record, searches in destination address and the said route entry of treating iteration next step of jumping identical route entry and comprises:
Travel through the second layer chained list under each ground floor chained list node; If the destination address and the mask matches of route entry in next jumping of pending route entry and mask and the second layer chained list node, then with the route entry of preserving in this second layer chained list node as the route entry that finds; If the destination address of route entry and mask all are different from pending route entry in all nodes of second layer chained list, then search the route entry failure.
6. route alternative manner as claimed in claim 4 is characterized in that, also comprises:
If in the overall routing table or the first double-deck chained list, search the route entry failure, then in second data record, add the route entry of treating iteration; Said second data record is used to preserve the route entry of treating iteration on the equipment of place.
7. route alternative manner as claimed in claim 6 is characterized in that:
Said second data record is the second double-deck chained list; In the ground floor chained list node storage route entry next jumped, and the data of storing in the second layer chained list node of a ground floor chained list node correspondence comprise: a route entry with next jumping in this ground floor chained list node; The corresponding one or more second layer chained list nodes of same ground floor chained list node.
8. route alternative manner as claimed in claim 7 is characterized in that, also comprises:
At regular intervals, each route entry in the second double-deck chained list respectively as the route entry of treating iteration, if accomplish iteration, is then added this route entry, this route entry of deletion from the second double-deck chained list in the first double-deck chained list; If a ground floor chained list node in the second double-deck chained list has no corresponding second layer chained list node, then delete this ground floor chained list node.
9. route alternative manner as claimed in claim 7 is characterized in that, also comprises:
At regular intervals, each route entry in the first double-deck chained list is deleted from the first double-deck chained list successively, then as the route entry of treating iteration; If iteration failure then treats that with this route entry of iteration adds in the second double-deck chained list, delete the routing iinformation of this route entry in the first double-deck chained list; If have no corresponding second layer chained list node under the ground floor chained list node in the first double-deck chained list, then delete this ground floor chained list node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110398020.5A CN102420761B (en) | 2011-12-05 | 2011-12-05 | Route iteration method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110398020.5A CN102420761B (en) | 2011-12-05 | 2011-12-05 | Route iteration method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102420761A true CN102420761A (en) | 2012-04-18 |
| CN102420761B CN102420761B (en) | 2014-08-13 |
Family
ID=45945001
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110398020.5A Active CN102420761B (en) | 2011-12-05 | 2011-12-05 | Route iteration method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102420761B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105681119A (en) * | 2014-11-19 | 2016-06-15 | 中兴通讯股份有限公司 | Method and apparatus for detecting routing loop |
| CN106656786A (en) * | 2016-11-18 | 2017-05-10 | 新华三技术有限公司 | Flow protection method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1604558A (en) * | 2003-09-30 | 2005-04-06 | 华为技术有限公司 | Route iteration system and method thereof |
| CN101076029A (en) * | 2007-07-12 | 2007-11-21 | 中兴通讯股份有限公司 | Method for updating boundary gate protocol recursion router |
| EP1609279B1 (en) * | 2003-04-01 | 2009-10-28 | Cisco Technology, Inc. | Method for recursive bgp route updates in mpls networks |
| CN101674251A (en) * | 2009-10-10 | 2010-03-17 | 福建星网锐捷网络有限公司 | Method for upgrade processing for recursive router, device and router therefor |
-
2011
- 2011-12-05 CN CN201110398020.5A patent/CN102420761B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1609279B1 (en) * | 2003-04-01 | 2009-10-28 | Cisco Technology, Inc. | Method for recursive bgp route updates in mpls networks |
| CN1604558A (en) * | 2003-09-30 | 2005-04-06 | 华为技术有限公司 | Route iteration system and method thereof |
| CN101076029A (en) * | 2007-07-12 | 2007-11-21 | 中兴通讯股份有限公司 | Method for updating boundary gate protocol recursion router |
| CN101674251A (en) * | 2009-10-10 | 2010-03-17 | 福建星网锐捷网络有限公司 | Method for upgrade processing for recursive router, device and router therefor |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105681119A (en) * | 2014-11-19 | 2016-06-15 | 中兴通讯股份有限公司 | Method and apparatus for detecting routing loop |
| CN106656786A (en) * | 2016-11-18 | 2017-05-10 | 新华三技术有限公司 | Flow protection method and device |
| CN106656786B (en) * | 2016-11-18 | 2020-08-18 | 新华三技术有限公司 | Flow protection method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102420761B (en) | 2014-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104954270B (en) | The method and apparatus and computer-readable medium used in networked system | |
| CN104009920B (en) | The processing method of data source movement, the method for E-Packeting and its device | |
| CN104580027B (en) | A kind of OpenFlow message forwarding methods and equipment | |
| CN101667958B (en) | Method for selecting hash function, and method and device for storing and searching routing table | |
| CN104412266A (en) | Method and apparatus for multidimensional data storage and file system with a dynamic ordered tree structure | |
| CN105224692A (en) | Support the system and method for the SDN multilevel flow table parallel search of polycaryon processor | |
| CN103051543B (en) | A kind of process of route prefix, search, increase and delet method | |
| CN103399902A (en) | Generation and search method for reachability chain list of directed graph in parallel environment | |
| US9240959B2 (en) | Method for packet classification and device therefor | |
| CN101616466A (en) | A kind of ad hoc network zone routing method | |
| CN106294421A (en) | A kind of data write, read method and device | |
| CN104679949A (en) | Method for creating Paramics road network based on XML (Extensive Markup Language) road network data | |
| US9672239B1 (en) | Efficient content addressable memory (CAM) architecture | |
| CN108964746A (en) | The more topology search shortest route methods of time-varying satellite network | |
| CN101277252A (en) | Method for traversing multi-branch Trie tree | |
| WO2014047863A1 (en) | Generating a shape graph for a routing table | |
| CN106789859A (en) | message matching method and device | |
| CN102420761B (en) | Route iteration method | |
| CN103577564A (en) | Method and device for reducing HASH collision through software shift | |
| CN103532861A (en) | Intra-domain dynamic multipath generating method based on generating tree | |
| CN106484694A (en) | Full-text search method based on distributed data base and system | |
| CN106131134A (en) | A kind of message content merges De-weight method and system | |
| CN107818113A (en) | File access method for determining position and device | |
| CN102426601A (en) | Data deleting method and device | |
| CN103885950B (en) | A kind of method and apparatus for obtaining corresponding relation between initialism and POI |
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 |