CN102420761B - Route iteration method - Google Patents
Route iteration method Download PDFInfo
- Publication number
- CN102420761B CN102420761B CN201110398020.5A CN201110398020A CN102420761B CN 102420761 B CN102420761 B CN 102420761B CN 201110398020 A CN201110398020 A CN 201110398020A CN 102420761 B CN102420761 B CN 102420761B
- Authority
- CN
- China
- Prior art keywords
- route entry
- iteration
- chained list
- route
- data record
- 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.)
- Active
Links
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 iteration method.
Background technology
Along with the development of the communication technology, network size constantly expands, and the quantity of routing table constantly expands, if three-layer network appliance is still used original those poor efficiency routing table processing modes, the fail safe of equipment, stability will be subject to very large threat.Therefore must improve by every means those poor efficiency routing table processing modes.A kind of technology adopting is at present exactly the efficient processing mode to iteration route.When adding static routing, next_hop is generally the interface IP address of the neighbours route direct-connected with 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 destination completely, this time, route just became an iteration route, need to carry out iteration.
Suppose six router series connection of A-B-C-D-E-F, on router-A, add so under normal circumstances route: ip route F f-mask B, can certainly add: ip route F f-mask E, the down hop that arrive F is E like this.But in local routing table, must there is the route entry that arrives E: ip route E e-mask D, the down hop that arrives E is D; In local routing table, must there is the route entry that arrives D: ip route D d-mask C, the down hop that arrives D is C; In local routing table, must there is the route entry that arrives C: ip rotue C c-mask B, the down hop that arrives C is B; In local routing table, there is the direct-connected route that arrives B.It is exactly more than the iteration route of a standard.
Implementation before this technology proposes is like this, and iteration route and non-iteration route, be stored in Adelson-Velskii-Landis tree node jointly, when carrying out route iteration, all will in overall routing table, carry out iteration at every turn; Described overall routing table is stored the routing table of each agreement routing iinformation, and data structure adopts Adelson-Velskii-Landis tree to realize, and index is destination address and mask.If realized by this way, for iteration route, can repeatedly enter in Adelson-Velskii-Landis tree corresponding to overall routing table and search (entering number of times consistent with the iteration number of plies), search efficiency is too low.
Summary of the invention
The technical problem to be solved in the present invention is how to improve the iteration efficiency of iteration route.
In order to address the above problem, the invention provides a kind of route iteration method, comprising:
In the first data record, do not exist and when the route entry of iteration has the route entry of identical down hop, in overall routing table, search and treat the route entry place equipment of iteration and the non-iterative route entry between down hop, or in described the first data record, search destination address with described in treat the route entry that in the route entry of iteration, down hop is identical; Using the route entry finding as the routing iinformation for the treatment of the route entry of iteration, be added in described the first data record together with treating the route entry of iteration, described in treat that the route entry of iteration completes iteration; Described the first data record is for preserving the route entry that has completed iteration on the equipment of place.
Further, when the iteration number of plies of the described route entry until iteration is 0, in overall routing table, searches and treat the route entry place equipment of iteration and the non-iteration route entry between its down hop; Be not 0 o'clock, in described the first data record, search destination address with described in treat the route entry that in the route entry of iteration, down hop is identical.
Further, described route iteration method also comprises:
While there is the down hop route entry identical with route entry until iteration in the first data record, using the routing iinformation of this route entry in the first data record as the routing iinformation for the treatment of the route entry of iteration, treat that the route entry of iteration completes iteration; If there is not this route entry for the treatment of iteration in the first data record, this is treated to the route entry of iteration and routing iinformation thereof are added to described the first data record.
Further, described the first data record is the first double-deck chained list, down hop in ground floor chained list node storage route entry, data in second layer chained list node corresponding to ground floor chained list node comprise: there is a route entry of down hop 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 described the first data record, search destination address with described in treat that the step of the route entry that in the route entry of iteration, down hop is identical comprises:
Travel through the second layer chained list under each ground floor chained list node, if destination address and the mask matches of route entry in the down hop of pending route entry and mask and a second layer chained list node, using the route entry of preserving in this second layer chained list node as the route entry finding; If the destination address of route entry and mask are all different from pending route entry in all nodes of second layer chained list, search route entry failure.
Further, described route iteration method also comprises:
If search route entry failure in overall routing table or the first double-deck chained list, in the second data record, add the route entry for the treatment of iteration; Described the second data record is for preserving the route entry for the treatment of iteration on the equipment of place.
Further, described the second data record is the second double-deck chained list, down hop in ground floor chained list node storage route entry, the data of storing in second layer chained list node corresponding to ground floor chained list node comprise: a route entry with down hop 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 iteration method also comprises:
At regular intervals, each route entry in the second double-deck chained list, respectively as the route entry for the treatment of iteration, if complete iteration, is added to this route entry in the first double-deck chained list, from the second double-deck chained list, delete this route entry; If a ground floor chained list node in the second double-deck chained list, without any corresponding second layer chained list node, is deleted this ground floor chained list node.
Further, described route iteration method also comprises:
At regular intervals, each route entry in the first double-deck chained list is deleted successively from the first double-deck chained list, then as the route entry for the treatment of iteration; If iteration failure, treats this that route entry of iteration is added in the second double-deck chained list, delete the routing iinformation of this route entry in the first double-deck chained list; If without any corresponding second layer chained list node, delete this ground floor chained list node under a ground floor chained list node in the first double-deck chained list.
Technical scheme of the present invention stores the route information table of the success of iteration (completing iteration), can after be used during iteration route; Prioritization scheme of the present invention adopts two layers of successful routing iinformation of storage of linked list iteration, rather than is equally stored in Adelson-Velskii-Landis tree with non-iteration route, and the processing of route is separated, and seems more clear; Another prioritization scheme of the present invention is used two double-deck chained lists and periodically updates, if found the route entry with identical down hop in " iteration success route chained list ", just can directly complete iteration; Even if do not find, also can add in " waiting for iteration route chained list ", wait arrive cycle time, system will be carried out iteration by the node in " waiting for iteration route chained list ", after iteration success, node can be added to " iteration success route chained list ", treatment effeciency is higher.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of data structure of the present invention;
Fig. 2 is the schematic flow sheet of example in embodiment mono-.
Embodiment
Below in conjunction with drawings and Examples, technical scheme of the present invention is described in detail.
It should be noted that, if do not conflicted, each feature in the embodiment of the present invention and embodiment can mutually combine, all within protection scope of the present invention.In addition, although there is shown logical order in flow process, in some situation, can carry out shown or described step by the order being different from herein.
First some terms that occur are herein described as follows:
Double-deck chained list: embed another chained list in the node of common chained list, as shown in Figure 1, horizontal chained list is ground floor chained list node Node_0, Node_1 ..., Node_n, wherein take down hop as index value; Be longitudinally second layer chained list node node_0, the node_1 that Node_1 is corresponding ..., node_n, in each second layer node, comprise the pointer that pstRt(points to routing infrastructure body).
Route entry, for the route entry of this route entry place equipment to destination address, comprising down hop, destination address, can also comprise mask; Such as the route entry ip route F f-mask E on router-A, wherein node E is down hop, and node F is destination address.The routing iinformation of a route entry is at least used to indicate in this route entry, how to arrive down hop, can be by another route entry the routing iinformation as a route entry.
The iteration number of plies refers to that two jumping figures between equipment subtract 1, and such as the series connection of tri-routers of A-B-C, between direct-connected device A, B, between Node B, C etc., the iteration number of plies is 0; And the iteration number of plies between device A, C is 1; By that analogy.
Embodiment mono-, and a kind of route iteration method, comprising:
In the first data record, do not exist and when the route entry of iteration has the route entry of identical down hop, in overall routing table, search and treat the route entry place equipment of iteration and the non-iterative route entry between down hop, or in described the first data record, search destination address with described in treat the route entry that in the route entry of iteration, down hop is identical; Using the route entry finding as the routing iinformation for the treatment of the route entry of iteration, be added in described the first data record together with treating the route entry of iteration, described in treat that the route entry of iteration completes iteration; Described the first data record is for preserving the route entry that has completed iteration on the equipment of place.
In the present embodiment, when the iteration number of plies of the described route entry until iteration is 0, in overall routing table, searches and treat the route entry place equipment of iteration and the non-iteration route entry between down hop wherein; Be not 0 o'clock, in described the first data record, search destination address with described in treat the route entry that in the route entry of iteration, down hop is identical.
In the present embodiment, described method can also comprise:
While there is the down hop route entry identical with route entry until iteration in the first data record, using the routing iinformation of this route entry in the first data record as the routing iinformation for the treatment of the route entry of iteration, treat that the route entry of iteration completes iteration; If there is not this route entry for the treatment of iteration in the first data record, this is treated to the route entry of iteration and routing iinformation thereof are added to described the first data record; Such as route entry that in the first data record, down hop is C is ip route F f-mask C, and the route entry for the treatment of iteration is ip route E f-mask C, although both down hops are identical, but still the route entry for the treatment of iteration to be added to the first data record.
In the present embodiment, described method can also comprise:
If search route entry failure in overall routing table or iteration success route chained list, represent iteration failure, in the second data record, add the route entry for the treatment of iteration; Described the second data record is for preserving the route entry for the treatment of iteration on the equipment of place.
In the present embodiment, it is the first double-deck chained list that described the first data record can be, but not limited to, such as can be described as " iteration success route chained list ", down hop in ground floor chained list node storage route entry, data in second layer chained list node corresponding to ground floor chained list node comprise: there is a route entry of down hop in this ground floor chained list node, and the pointer that points to the routing iinformation of this route entry; In other words, using down hop as chain table index; Routing iinformation can be preserved by specific data structure.
In the present embodiment, same ground floor chained list node corresponding one or more second layer chained list node likely in the first double-deck chained list, such as six router series connection of A-B-C-D-E-F, such as down hop in ground floor chained list is in the second layer chained list node that the node of router D is corresponding, the second layer chained list node that can comprise the route entry of storage from router-A to F, the second layer chained list node of the route entry from router B to E, the second layer chained list node of the route entry from router C to F etc., but the down hop in these route entrys is router D, the pointer that also comprises the routing iinformation of the route entry that sensing is preserved in above-mentioned second layer chained list.
In the present embodiment, when described the first data record is the first double-deck chained list, in described the first data record, search destination address with described in treat that the step of the route entry that in the route entry of iteration, down hop is identical specifically can comprise:
Travel through the second layer chained list under each ground floor chained list node, if destination address and the mask matches of route entry in the down hop of pending route entry and mask and a second layer chained list node, using the route entry of preserving in this second layer chained list node as the route entry finding.If the destination address of route entry and mask are all different from pending route entry in all nodes of second layer chained list,, search route entry failure.
In the present embodiment, when described the first data record is the first double-deck chained list, when the described route entry until iteration is added in the first data record, first judge in the ground floor chained list of this first double-deck chained list whether have the identical node of down hop for the treatment of the route entry of iteration with this; If had, add the second layer chained list node corresponding to this node, the route entry for the treatment of iteration in order to preserve this; If no, first in the ground floor chained list of the first double-deck chained list, add for preserving the node that this treats the route entry down hop of iteration, then add the second layer chained list node that this node is corresponding, the route entry for the treatment of iteration in order to preserve this.
In the present embodiment, described the second data record can be the second double-deck chained list, such as can be described as " waiting for iteration route chained list "; Down hop in ground floor chained list node storage route entry, the data of storing in second layer chained list node corresponding to ground floor chained list node comprise: a route entry with down hop in this ground floor chained list node; Namely with the first double-deck chained list is the same, usings down hop as chain table index, and same ground floor chained list node is corresponding one or more second layer chained list node likely.
In the present embodiment, while adding the route entry until iteration in the second data record, first in the ground floor chained list of the second double-deck chained list, search whether have with described in treat the identical node of down hop of the route entry of iteration, if had, directly add second layer chained list node corresponding to node finding, the route entry for the treatment of iteration in order to preserve this; If no, first at the ground floor chained list of this second double-deck chained list, add for treating the node of the route entry down hop of iteration described in preserving, then add the second layer chained list node that this node is corresponding, the route entry for the treatment of iteration in order to preserve this.
The described route iteration method of the present embodiment specifically can as shown in Figure 2, comprise the steps:
S1, in the first data record, search the route entry that down hop is identical with the route entry for the treatment of iteration; Described the first data record is for preserving the routing iinformation that has completed route entry and this route entry of iteration on the equipment of place; If can find, using the routing iinformation of the route entry finding as the routing iinformation for the treatment of the route entry of iteration, the route entry for the treatment of iteration completes iteration, if this treats that the route entry of iteration is not present in described the first data record, adds; Search less than carrying out step S2;
Described in S2, judgement, treat whether the iteration number of plies of the route entry of iteration is 0; If be not 0, carry out step S3; If 0, in overall routing table, search and treat the route entry place equipment of iteration and the non-iterative route entry between its down hop; If can find, using the route entry finding as the described routing iinformation for the treatment of the route entry of iteration, with described in treat to be added to described the first data record together with the route entry of iteration; The route entry for the treatment of iteration completes iteration;
S3, in described the first data record, search destination address with described in treat the route entry that in the route entry of iteration, down hop is identical, if can find, using the route entry finding as the routing iinformation for the treatment of the route entry of iteration, with described in treat to be added to described the first data record together with the route entry of iteration; The route entry for the treatment of iteration completes iteration.
With an object lesson, describe below, such as tetra-router series connection of A-B-C-D, the route entry for the treatment of iteration is the route ip route D f-mask C on router-A; Suppose only to exist in the first data record the routing iinformation data structure of route entry ip route C f-mask B and correspondence thereof:
In step S1, in the first data record, cannot find the route entry that down hop is identical with the route entry for the treatment of iteration, enter step S2;
In step S2, owing to treating that route entry place device A and the iteration number of plies between down hop C of iteration is not 0, therefore enter step S3; (if treating that in the route entry of iteration, down hop is router B, is the non-iterative route entry of searching in overall routing table between router-A and router B)
In step S3, due in the first data record, having found destination address is the route entry ip route C f-mask B of router C, therefore route entry ip route D f-mask C can be added in the 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;
Now just completed the iteration of route entry ip route D f-mask C.
From this example, can find out, owing to having preserved the successful route entry of iteration and routing iinformation thereof, while carrying out so the more relevant iteration of more multi-layered number, just can make full use of existing routing iinformation, and search in overall routing table without going from level to level again.
In the present embodiment, described method can also comprise:
At regular intervals, each route entry in the second double-deck chained list, respectively as the route entry for the treatment of iteration, is carried out to step S1 to S3; One route entry completes after iteration, in the first double-deck chained list, adds this route entry, from the second double-deck chained list, deletes this route entry; If a ground floor chained list node in the second double-deck chained list, without any corresponding second layer chained list node, is also deleted this ground floor chained list node.
Specifically, every how long, can arrange as required.
In the present embodiment, described method can also comprise:
At regular intervals, using each route entry in the first double-deck chained list successively as the route entry for the treatment of iteration, from the first double-deck chained list, delete this and after the route entry of iteration, carry out step S1 to S3, thereby whether the route of having checked iteration changes, may be to iterate to new route, now will change the routing iinformation of route entry, when the route entry of iteration completes iteration and is added back the first double-deck chained list, its routing iinformation and the difference of preserving before; May be iteration failure, now this can be treated to the route entry of iteration is added in the second double-deck chained list, delete the routing iinformation of this route entry in the first double-deck chained list; If without any corresponding second layer chained list node, also delete this ground floor chained list node under a ground floor chained list node in the first double-deck chained list.
Specifically, every how long, can arrange as required.
Certainly; the present invention also can have other various embodiments; in the situation that not deviating from spirit of the present invention and essence thereof; those of ordinary skill in the art are when making according to the present invention various corresponding changes and distortion, but these corresponding changes and distortion all should belong to the protection range of claim of the present invention.
Claims (8)
1. a route iteration method, comprising:
In the first data record, do not exist and when the route entry of iteration has the route entry of identical down hop, in overall routing table, search and treat the route entry place equipment of iteration and the non-iterative route entry between down hop, or in described the first data record, search destination address with described in treat the route entry that in the route entry of iteration, down hop is identical; Using the route entry finding as the routing iinformation for the treatment of the route entry of iteration, be added in described the first data record together with treating the route entry of iteration, described in treat that the route entry of iteration completes iteration; Described the first data record is for preserving the route entry that has completed iteration on the equipment of place;
Described the first data record is the first double-deck chained list, down hop in ground floor chained list node storage route entry, data in second layer chained list node corresponding to ground floor chained list node comprise: there is a route entry of down hop 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.
2. route iteration method as claimed in claim 1, is characterized in that:
When the iteration number of plies of the described route entry until iteration is 0, in overall routing table, searches and treat the route entry place equipment of iteration and the non-iteration route entry between its down hop; Be not 0 o'clock, in described the first data record, search destination address with described in treat the route entry that in the route entry of iteration, down hop is identical.
3. route iteration method as claimed in claim 1, is characterized in that, also comprises:
While there is the down hop route entry identical with route entry until iteration in the first data record, using the routing iinformation of this route entry in the first data record as the routing iinformation for the treatment of the route entry of iteration, treat that the route entry of iteration completes iteration; If there is not this route entry for the treatment of iteration in the first data record, this is treated to the route entry of iteration and routing iinformation thereof are added to described the first data record.
4. route iteration method as claimed in claim 1, is characterized in that, in described the first data record, search destination address with described in treat that the step of the route entry that in the route entry of iteration, down hop is identical comprises:
Travel through the second layer chained list under each ground floor chained list node, if destination address and the mask matches of route entry in the down hop of pending route entry and mask and a second layer chained list node, using the route entry of preserving in this second layer chained list node as the route entry finding; If the destination address of route entry and mask are all different from pending route entry in all nodes of second layer chained list, search route entry failure.
5. route iteration method as claimed in claim 1, is characterized in that, also comprises:
If search route entry failure in overall routing table or the first double-deck chained list, in the second data record, add the route entry for the treatment of iteration; Described the second data record is for preserving the route entry for the treatment of iteration on the equipment of place.
6. route iteration method as claimed in claim 5, is characterized in that:
Described the second data record is the second double-deck chained list, down hop in ground floor chained list node storage route entry, the data of storing in second layer chained list node corresponding to ground floor chained list node comprise: a route entry with down hop in this ground floor chained list node; The corresponding one or more second layer chained list nodes of same ground floor chained list node.
7. route iteration method as claimed in claim 6, is characterized in that, also comprises:
At regular intervals, each route entry in the second double-deck chained list, respectively as the route entry for the treatment of iteration, if complete iteration, is added to this route entry in the first double-deck chained list, from the second double-deck chained list, delete this route entry; If a ground floor chained list node in the second double-deck chained list, without any corresponding second layer chained list node, is deleted this ground floor chained list node.
8. route iteration method as claimed in claim 6, is characterized in that, also comprises:
At regular intervals, each route entry in the first double-deck chained list is deleted successively from the first double-deck chained list, then as the route entry for the treatment of iteration; If iteration failure, treats this that route entry of iteration is added in the second double-deck chained list, delete the routing iinformation of this route entry in the first double-deck chained list; If without any corresponding second layer chained list node, delete this ground floor chained list node under a ground floor chained list node in the first double-deck chained list.
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 CN102420761A (en) | 2012-04-18 |
| CN102420761B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105681119A (en) * | 2014-11-19 | 2016-06-15 | 中兴通讯股份有限公司 | Method and apparatus for detecting routing loop |
| CN106656786B (en) * | 2016-11-18 | 2020-08-18 | 新华三技术有限公司 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102420761A (en) | 2012-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104954270B (en) | The method and apparatus and computer-readable medium used in networked system | |
| CN104580027B (en) | A kind of OpenFlow message forwarding methods and equipment | |
| CN103399902B (en) | Digraph accessibility chained list under a kind of parallel environment generates and querying method | |
| CN101667958B (en) | Method for selecting hash function, and method and device for storing and searching routing table | |
| CN103227778B (en) | Memory pool access method, equipment and system | |
| CN104135715B (en) | The implementation method of location-based service, a device, and system | |
| Zhang et al. | Enhancing network robustness via shielding | |
| US9400767B2 (en) | Subgraph-based distributed graph processing | |
| CN102970725B (en) | Mobile opportunity network routing method based on multi-layer community grouping | |
| CN104412266A (en) | Method and apparatus for multidimensional data storage and file system with a dynamic ordered tree structure | |
| US9672239B1 (en) | Efficient content addressable memory (CAM) architecture | |
| CN102420761B (en) | Route iteration method | |
| CN102207979A (en) | Sensitive word matching method and system | |
| CN105760411A (en) | Hybrid Wildcard Match Table | |
| CN101159966A (en) | Peer-to-peer network topology matching method in mobile environment | |
| Garg et al. | Link prediction techniques for opportunistic networks using machine learning | |
| CN103532861A (en) | Intra-domain dynamic multipath generating method based on generating tree | |
| CN107818113A (en) | File access method for determining position and device | |
| CN104049200B (en) | Lothrus apterus test dispatching method based on link distribution in NoC | |
| CN107943615A (en) | Data processing method and system based on distributed type assemblies | |
| CN106161233A (en) | A kind of message forwarding method and device | |
| WO2013172959A2 (en) | Conveyance planning using dartboard network | |
| CN102426601A (en) | Data deleting method and device | |
| CN103885950B (en) | A kind of method and apparatus for obtaining corresponding relation between initialism and POI | |
| CN108667659B (en) | Method and system for searching loop node in network topological graph |
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 |