CN101562556A - Method, device and system for reducing network coding cost - Google Patents
Method, device and system for reducing network coding cost Download PDFInfo
- Publication number
- CN101562556A CN101562556A CNA2008100890351A CN200810089035A CN101562556A CN 101562556 A CN101562556 A CN 101562556A CN A2008100890351 A CNA2008100890351 A CN A2008100890351A CN 200810089035 A CN200810089035 A CN 200810089035A CN 101562556 A CN101562556 A CN 101562556A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- bandwidth
- cluster
- information
- 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
Abstract
The invention relates to a method for reducing network coding cost, belonging to the technical field of communication. The method comprises the following steps: establishing path clusters from an information source node to each information sink node in a distribution way; acquiring the path cluster bandwidth of each path cluster; determining the multicasting maximum flow bandwidth of the information source node according to the path cluster bandwidth; trimming the path clusters with the path cluster bandwidth more than the multicasting maximum flow bandwidth; and determining nodes of a multicasting transport topology and nodes which participate network coding. The invention also provides a device and a system for reducing the network coding cost. The embodiment of the invention decreases nodes containing codes by trimming an established transport route, thereby reducing the network coding cost.
Description
Technical field
The present invention relates to communication technical field, relate in particular to a kind of method, Apparatus and system that reduces network coding cost.
Background technology
The network code of Ti Chuing (network coding) is the important breakthrough in the message transmission theoretical research in recent years, its core concept is to allow network node information transmitted to be handled and operated (as the computing in the finite field etc.) in multicast transmission, thereby makes multicast transmission reach its theoretical capacity.Network code has conserve transmission bandwidth, and balance network load promotes advantages such as network throughput, therefore has important theory and is worth and application prospects.
R.Alshwede etc. are example with famous " butterfly network ", the operation principle of having set forth network code first with and for the effect that promotes network throughput.Network topology shown in Fig. 1 (a), each link capacity are 1 unit (if link capacity is not 1, then available parallel link replaces), and S is an information source node, and Y and Z are information destination node.According to " max-flow min-cut " theorem, the theoretical maximum transmission capacity of this multicast is 2 units, and promptly stay of two nights Y and Z can receive the information of 2 units that information source S sends simultaneously in theory.
Fig. 1 (b) represents routing multicast, finds out easily, and this multicast can not realize that transmission capacity is 2 multicast.The routing multicast of network code is used in Fig. 1 (c) expression, link WX transmits coded message b1+b2 (symbol "+" expression XOR), then stay of two nights Y receives b1 and b1+b2, just can obtain b2 by decoded operation b1+ (b1+b2) then, therefore Y then can receive b1 and b2, and in like manner stay of two nights Z also can receive b1 and b2.As seen, the utilization network code can be realized the multicast max-flow, promotes network throughput.
If network node carries out linear operation to information transmitted, then be called linear network encoding (LinearNetwork Coding), otherwise be called the nonlinear network coding.At enough big finite field F
qIn, the utilization linear network encoding can make multicast transmission reach its theoretical capacity.Current, the research of network code mainly is limited to linear network encoding with application.Among Fig. 1 (c), node W is exactly a kind of simple linear network encoding to the information b1 and the xor operation that carries out of b2 of input.
Linear network encoding is generalized to ordinary circumstance, and (V represents the set of network node for V, E) expression, and E represents the set on transmission link (limit) with directed graph G=to establish multicast network.Figure G is the capacity network, be that each link capacity is 1 unit (if link capacity is not 1 unit, then can set up the parallel link that many capacity are 1 unit between two nodes), information source node is represented with s, the set of information destination node is T, and arbitrary stay of two nights is expressed as t
i∈ T.If the theoretical maximum transmission capacity of multicast is h, then information source s sends information available symbols vector representation: b=[b
1, b
2..., b
h], the symbolic vector that each information destination node receives is β=[β
1, β
2..., β
h].Owing to used linear network encoding, so the information of the information of link transmission, information that node receives and node output is the linear combination of each element among the information source output vector b, so β is arranged
i=c
I1b
1+ c
I2b
1+ ... c
Ihb
1, i ∈ [1, h], write as matrix form and be:
Therefore, receive β=[β when information destination node
1, β
2..., β
h] after, parse corresponding coefficient matrix C, if the Matrix C full rank, then with regard to one surely by inverse operation b
T=C
-1β translates the symbolic vector b that information source sends.Element c among the coefficient matrix C
IjBe at finite field F
qIn choose.If adopt distributed random network code [3,4,5].The finite field size is q=2
16The time (coefficient c
IjThe scope of choosing is [0,2
16]), each information destination node can be to surpass 99.7% probability decoding success.
The original intention that network code proposes is for making multicast transmission reach theoretic maximum transfer capacity, thereby can obtain than the better network throughput of routing multicast.Along with going deep into of research, the advantage of network code others also embodies, as balance network load, lifting bandwidth availability ratio etc.If network code is combined with other application, then can promote the correlated performance of this application system.
Though network code can improve network performance, bring revolutionary variation for existing network, but in the network code system, node needs extra information cache operation and coding computing, therefore compare with traditional routing multicast, network code has higher cost, and this has hindered its application in real network.
Reduce the cost of network code, to promoting its large-scale application important and practical meanings is arranged, its target is to guarantee to reach under the prerequisite of multicast theoretical capacity the required computing cost of reduction encoding operation.
Prior art one related to the present invention realizes that the scheme that reduces network coding cost is: random network code
Random network code (random network coding) is the distributed realization of linear network encoding, and present node carries out linear combination to the information of different input links, but the coefficient of linear combination picked at random in finite field.For example, network node is in finite field [0,2
16] interior picked at random linear combination coefficient, the node input information is carried out linear combination, the information destination node that receives coded message then translates raw information by finding the solution matrix equation.In finite field [0,2
16] in, information destination node can be to surpass 99.7% probability decoding success.Random network code is the distributed realization of network code, need not to know in advance the topology information of whole network, is particularly useful for topological structure dynamic change or large-scale network.For the network that has network node and link failure, can improve the robustness of multicast transmission, therefore have important theory and be worth and using value.
In realizing process of the present invention, the inventor finds that there is following shortcoming in prior art one:
Random network code has just reduced the complexity of individual node participation coding computing, when the scale of network code node increases, still has the high problem of coding cost.
Summary of the invention
The embodiment of the invention provides a kind of method, Apparatus and system that reduces network coding cost, effectively reduces network coding cost, has solved the high problem of prior art network coding cost.
The embodiment of the invention is achieved through the following technical solutions:
The embodiment of the invention provides a kind of method that reduces network coding cost, comprising:
Set up the path cluster of information source node by distributed way to each information destination node;
Obtain the path cluster bandwidth of each path cluster, determine the multicast maximum stream flow bandwidth of described information source node according to described path cluster bandwidth;
The path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth, determine the node of multicast transmission topology and participation network code.
The embodiment of the invention provides a kind of device that reduces network coding cost, comprising:
Acquiring unit is used to obtain the path cluster bandwidth of information source node to the path cluster of each information destination node;
Determining unit, the path cluster bandwidth that is used for obtaining according to described acquiring unit are determined the multicast maximum stream flow bandwidth of described information source node;
Judging unit is used to judge that information source node arrives the multicast maximum stream flow bandwidth whether the path cluster bandwidth of the path cluster of each information destination node is determined greater than described determining unit, if then notify the beta pruning unit greater than multicast maximum stream flow bandwidth;
The beta pruning unit is used for the notice according to described judging unit, and the path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth, determines the node of multicast transmission topology and participation network code.
The embodiment of the invention provides a kind of system that reduces network coding cost, comprising: information source node, intermediate node, information destination node and reduce the device of network coding cost, and each node is set up transmission path bunch with distributed way;
The device of described reduction network coding cost is used to obtain the path cluster bandwidth of each path cluster, determines the multicast maximum stream flow bandwidth of described information source node according to described path cluster bandwidth; The path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth, determine the node of multicast transmission topology and participation network code;
Described information source node is used for transmitting data by the path of definite transmission topology to described information destination node;
Described intermediate node is used for setting up information source node to the transmission path of each information destination node bunch with distributed way, and at the Ingress node place of the overlay path of different path cluster the equal small-large flow data of different path cluster ports inputs is carried out network code.
The technical scheme that provides by the invention described above embodiment as can be seen, to comprise coding nodes less by the transmission route of setting up being carried out cut operator, making for the embodiment of the invention, thereby reduce the cost of network code.
Description of drawings
Fig. 1 is single cell two stay of two nights butterfly network diagram of prior art;
Fig. 2 is the crucial link schematic diagram of embodiment of the invention definition;
Fig. 3 is the operational flowchart that reduces the network coding cost method in the embodiment of the invention;
Fig. 4 is the flow chart that connects between node among Fig. 3 embodiment of the present invention;
Fig. 5 a is that the embodiment of the invention reduces network coding cost method application scenarios schematic diagram;
Fig. 5 b for beta pruning among Fig. 5 a embodiment of the present invention after the scene schematic diagram;
Fig. 6 is the system construction drawing that reduces network coding cost in the embodiment of the invention;
Fig. 7 is the apparatus structure schematic diagram that reduces network coding cost in the embodiment of the invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
Below theorem and the definition that uses in the embodiment of the invention described introduction.
Theorem 1: (all link bandwidths are unit capacity in the network for the unit capacity network, if link capacity is not 1 unit, can by many capacity the parallel link replacement of 1 unit then), if the maximum stream flow bandwidth between two nodes is a N unit, then can between this two node, set up the N bar and not have the link paths EDP (Edge-disjoint Paths, edge disjoint path) of coincidence; Wherein, do not have the link paths of coincidence, refer to not have each other the path of common link.
According to this theorem, if information source node s and information destination node t
iMaximum stream flow bandwidth between the ∈ T is h
iIndividual unit then can be at s and t
iSet up h between ∈ T
iBar " does not have and overlaps link " path cluster that the path constitutes, and remembers that this path cluster is f (t
i).
Definition 1: crucial link, path cluster f (t
i) and f (t
j) in the link that overlaps be called crucial link (KeyLinks), wherein, t
j∈ T.
As shown in Figure 2, information destination node t
1Corresponding path cluster f (t
1) comprise that three paths (wherein comprise link e
1), information destination node t
2Corresponding path cluster f (t
2) comprise that three paths (wherein comprise link e
1, e
2), path cluster f (t
1) and path cluster f (t
2) existence coincidence link e
1, so e
1It is crucial link.In like manner, e
2Be path cluster f (t
2), path cluster f (t
3) and path cluster f (t
4) the coincidence link, so e
2It also is crucial link.According to this definition 1, crucial link is the common link that overlaps in the different path cluster, therefore by this key link transfer encoding information, makes each information destination node realize the maximum stream flow bandwidth.Can there be several intermediate nodes in dotted line in the middle of representing among Fig. 2.
Definition 2: bandwidth
Path bandwidth: the minimum value of all link bandwidths is as the path bandwidth in this path on the paths;
The path cluster bandwidth: all path bandwidth sums of each paths are the path cluster bandwidth of this path cluster in path cluster;
Multicast maximum stream flow bandwidth: the minimum value in the path cluster bandwidth of all path cluster of information source node correspondence is a multicast maximum stream flow bandwidth.
Definition 3: key factor, be used for identifying the registration of link, if link e is the coincidence link of n path cluster, the minimal path bandwidth of the n paths that overlaps is k, then the key factor of link e is k*n, (k=1 in the unit capacity network), and the key factor of note link e is Δ (e), be that described key factor refers to the overlapping flow bandwidth size (in unit capacity network, be the path cluster group number of this key link ownership) of crucial link corresponding to a plurality of path cluster.
Fig. 2 is the unit capacity network, wherein link e
1Be path cluster f (t
1) and f (t
2) the coincidence link, e then
1Key factor be 2, i.e. Δ (e
1)=2.In like manner as can be known, Δ (e
2)=3.For non-coincidence link, there is not key factor at overlapping link in key factor.Because crucial link is the coincidence link of information source node to the path cluster of different information destination node, just many more by the path number of clusters of this link so the key factor of link is big more, this link is just high more to the contribution that network code promotes efficiency of transmission.As seen, the chaining key way is few more, and its key factor is big more, and then the network code transmission plan is just excellent more, and the cost of network code is just more little.
Definition 4: the key factor in path, be used for identifying the registration in path, the key factor in path is meant the minimum value in the key factor of the link that comprises on this path.The key factor of note path p is Δ (p);
, have a plurality of links and all have key factor to the path of information destination node an information source node, the minimum value in each link key factor is exactly the key factor in this path.
The embodiment of the invention provides a kind of method of the distributed reduction network coding cost based on crucial link.At first determine the transmission route of network code multicast, in this route, carry out network code on the end node of crucial link then, can make under the prerequisite of the theoretical capacity of realizing multicast, can reduce the interstitial content that participates in network code, thereby reduce total cost of network code.
Node in the described network of the embodiment of the invention can be the equipment that personal computer, server computer, network PC, router, switch, minicom, mainframe computer etc. have I/O and computing function;
The method of the described reduction network coding cost of the embodiment of the invention is to realize that by making up suitable transmission route described suitable transmission route comprises less network code node.The method implementation of described reduction network coding cost mainly comprises following step as shown in Figure 3:
Step 30, network node is set up the path cluster of information source node to each information destination node by distributed method;
This step 30 comprises: step 300, information destination node t
i∈ T obtains adjacent node information, one by one with can reach and not at information destination node t
iAdjacent node on the path that ∈ T and information source node s have set up connects; Step 301 is with described information destination node t
iThe method that the adjacent node that ∈ T connects uses and information destination node is same connects with the adjacent node of oneself; Step 302, subsequent node use method same in the step 301 and the adjacent node of oneself to connect, up to connecting with information source node s.
Wherein, with node t
i∈ T is an information destination node, is information source node with node s, arbitrary node one by one with can reach and not at information destination node t
iThe method that adjacent node on the path that ∈ T and information source node s have set up connects comprises following substep as shown in Figure 4:
Step 400: this arbitrary node sends information acquisition request to its adjacent node, obtains adjacent node information according to the feedback of each adjacent node, comprises the path cluster information, adjacent node address of adjacent node number, each adjacent node ownership etc.;
Step 401: this arbitrary node is according to the feedback information of the adjacent node that receives and the information table of preservation, judge whether to connect with each adjacent node, wherein preserve this arbitrary node and each adjacent node connection state record in the information table, and each adjacent node information that whether can reach; If adjacent node not at described information source node s to information destination node t
iOn the path that ∈ T has set up, and be not labeled as unreachablely, then execution in step 402 is set up and being connected of this neighbor node, otherwise execution in step 403 is not set up and being connected of this neighbor node;
Step 402: if adjacent node not at described information source node s to information destination node t
iOn the path that ∈ T has set up, and be not labeled as unreachable, then this arbitrary node (can use the method for shortest path to realize according to certain rule, Ford-Fulkerson, Floyd or Dijkstra etc. or response time the shortest method etc. for example) select an adjacent node to send connection request, after connection is set up successfully, the path that this arbitrary nodes records has been set up, execution in step 404 afterwards;
Step 403: if adjacent node at described information source node s to information destination node t
iOn the path that ∈ T has set up, or this adjacent node is labeled as unreachablely, then abandons and being connected of this adjacent node, and execution in step 404 afterwards;
Step 404: judge whether to finish the path and set up;
Step 405: if all adjacent node all at information source node s to information destination node t
iOn the path cluster of ∈ T, or all be labeled as unreachablely, then finish to set up the operation in the path of this information destination node; Otherwise, continue step 401.
Wherein, the arbitrary node of step 400 to the step 405 can be information destination node t
i∈ T or information destination node t
iIntermediate node on ∈ T and the information source node s path, each node execution in step 400 respectively up to connecting with information source node s, so just can be set up information destination node t to step 405
i∈ T is at least one transmission path of information source node s; After step 405, for intermediate node, can not set up satisfactory link if intermediate node is adjacent between the node, then this intermediate node to its node feedback information that has connected, the connection that notice cancellation has been set up.Information destination node t
i∈ T constitutes a path cluster f (t to all paths of information source node s
i), path cluster f (t
i) in all path bandwidth sums (path to unit bandwidth promptly is equivalent to the number of path that comprises in this path cluster), be the path cluster bandwidth h of this path cluster
i, be designated as h
i=| f (t
i) |.Operation in a manner mentioned above, each information destination node can be set up a path cluster with corresponding information source node.After setting up path cluster, each network node is preserved the information of path cluster that this node belongs to.
Step 31 is determined the multicast maximum stream flow bandwidth of this information source node s;
At first, determine that information source node s is to each information destination node t
iThe path cluster bandwidth of the path cluster of ∈ T can be obtained the path cluster bandwidth information h of each path cluster by searching all adjacent nodes of information source node s
i=| f (t
i) |; Then, the path cluster bandwidth of each information destination node path cluster relatively, with the minimum value of path cluster bandwidth as multicast maximum stream flow bandwidth h, i.e. h=min|f (t
i) |, t
i∈ T; Can certainly adopt arbitrary value less than the path cluster bandwidth minimum as multicast maximum stream flow bandwidth, when adopting the path cluster bandwidth minimum as multicast maximum stream flow bandwidth, can reduce the difference of multicast maximum stream flow bandwidth and each path cluster bandwidth, thereby the number of path that needs beta pruning after reducing, and then the operation of minimizing beta pruning, raise the efficiency.
Step 32, the path cluster that the path cluster bandwidth is surpassed multicast maximum stream flow bandwidth is carried out cut operator; The path cluster that described path cluster bandwidth surpasses multicast maximum stream flow bandwidth is institute and comprises the path cluster of path total flow bandwidth greater than definite multicast maximum stream flow bandwidth.This cut operator can comprise the steps:
Step 320: the key factor that obtains each path in the path cluster (being the path cluster that flow bandwidth surpasses the multicast max-flow) that needs beta pruning; Can send the operation requests of the key factor that obtains the path to its adjacent node by information source node, described adjacent node successively downstream adjacent node send the request of obtaining key factor information, up to information destination node;
Information source node can directly receive the key factor information of each node feedback, minimum value in the key factor of determining to be received is the key factor in this path, or each node obtains the key factor of downstream node and this node key factor relatively successively, get minimum value again recurrence upload the letter in reply source node.
In other embodiments, can directly not obtain key factor by information source node s from adjacent node, but obtain registration information from adjacent node is related content the EDP table, can comprise, path cluster sign, path sequence number, next-hop node address in the EDP table of adjacent node, perhaps path cluster sign, path sequence number, a last hop node address.The key factor that directly obtains adjacent node can reduce information transmitted amount between node, lightens the load, and reduces error rate.
Step 321: path that need to determine deletion according to pre-conditioned and key factor;
Described pre-conditioned can for: choose from the ascending order of key factor and to treat the beta pruning path, as criterion, need the flow bandwidth sum in the path of deletion to be equal to or greater than the part that the path cluster bandwidth surpasses multicast maximum stream flow bandwidth with flow bandwidth.There is not the path of key factor not participate in beta pruning.
Step 322: the node in path cluster on the path of above-mentioned definite needs deletion sends deletion message, and adjusts the key factor in the respective paths bunch;
The adjacent node of information source node on the path of the needs deletion of determining sends deletion message; Described adjacent node is deleted the record of this path correspondence, and upgrades key factor, and issues this message successively and give the downstream adjacent node up to information destination node.On information source node and information destination node, also to delete respective record.
If the device that reduces network coding cost is not on information source node, for example in intermediate node or information destination node, then can be mutual by the device and the information source node that reduce network coding cost, the control information source node is carried out aforesaid operations, to obtain key factor and to send operations such as deleting PATH.
For example, establish information destination node t
iPath cluster f (the t of ∈ T correspondence
i) the path cluster bandwidth | f (t
i) |＞h, t
i∈ T promptly surpasses the multicast max-flow, then needs (the t to this path cluster f
i) carry out beta pruning, remember that the path that comprises in this path cluster is p
I1, p
I2... p
Imi, wherein mi represents path cluster f (t
i) in comprise the mi paths; Then beta pruning process comprises:
At first, obtain path cluster f (t
i) middle path p
I1Key factor; Information source node s is to its adjacent node s
NearP is obtained in transmission
I1In the operation requests of key factor of each link, s
NearFeed back to the key factor information of this node of information source node, simultaneously s
NearTransmission is obtained key factor information to the downstream adjacent node, and the downstream adjacent node returns key factor to s
Near, and then be back to s, and in the same way, up to obtaining path p
I1Going up the key factor of all links, get minimum value, then is p
I1Key factor Δ (the p in path
I1); This process of obtaining key factor can realize by the information table of preserving on the node;
Secondly, obtain path cluster f (t according to above-mentioned steps
i) go up the key factor in other path, remember path cluster f (t
i) in the key factor in all paths be Δ (p
I1), Δ (p
I2) ... Δ (p
Imi);
Once more, according to the ascending order of key factor, from Δ (p
I1), Δ (p
I2) ... Δ (p
Imi) in choose and treat beta pruning path (not comprising the path that does not have key factor), with flow bandwidth as criterion, need to determine the path of deletion, need the flow bandwidth sum in the path of deletion to be equal to or greater than the part that the path cluster bandwidth surpasses multicast maximum stream flow bandwidth; Can certainly picked at random treat the beta pruning path, as long as satisfy the bandwidth sum of choosing for the treatment of the beta pruning path surpasses multicast maximum stream flow bandwidth more than or equal to the path cluster bandwidth part, when ascending selective sequential, can make the key factor in remaining path bigger, encoding operation can be concentrated like this, reduce the redundant operation of coding number of times and coding;
For the unit capacity network, ascending by key factor, delete respective path successively, difference until path cluster bandwidth and multicast maximum stream flow bandwidth satisfies predetermined threshold, if there are some the paths that key factor is identical, then can adopt the mode of selecting at random to delete for the identical path of described key factor, wherein said predetermined threshold is the maximum difference of predefined permission path cluster bandwidth and multicast maximum stream flow bandwidth; For non-unit capacity network, delete (if there are some the paths that key factor is identical in the path of at first choosing the key factor minimum, then can adopt the mode of selecting at random to delete) for the identical path of described key factor, behind the above-mentioned path of having selected to need to delete, the adjacent node of information source node s on this path sends deletion message, adjacent node is deleted the entry of the path correspondence of this selection, and adjust key factor in the respective paths bunch, and should deletion information sending to the adjacent node in downstream, the adjacent node up to the downstream is information destination node t
i∈ T; Then this path cluster bandwidth is deducted the path bandwidth of this deletion, relatively whether the difference between current path bunch bandwidth and the multicast maximum stream flow bandwidth satisfies predetermined threshold again, if do not satisfy, then continue to select key factor time little path deletion, carry out beta pruning according to above-mentioned same method, satisfy predetermined threshold up to the difference of path cluster flow bandwidth and multicast max-flow.Also can choose earlier and treat the beta pruning path, make the beta pruning path bandwidth sum of choosing of respectively treating be greater than or equal to the minimal difference of Actual path bunch bandwidth and described permission path cluster bandwidth, behind the selected institute beta pruning path that remains, the path of beta pruning that disposable deletion remains.
Repeat above-mentioned steps, up to all | f (t
i) |＞h, t
iThe path cluster of ∈ T is finished beta pruning.
Step 33: the topology of information source node after according to beta pruning sends multi-case data, and data are carried out the network code operation when needing to carry out the node of network code;
Information source node sends multi-case data by the topology after the above-mentioned beta pruning, the overlay path place of different path cluster after the beta pruning, equal small-large flow data to the corresponding different path cluster port inputs of Ingress node, the operation of execution network code, as adopt random network code, be to realize random network code, node need carry out buffer memory to the information from different input links, and the packet of obtaining fixed size from buffer memory is encoded.
To comprise required coding nodes less by the transmission route of setting up being carried out cut operator, making for the invention described above embodiment, thereby reduce the cost of network code; And because in the method for tectonic network coding multicast route, cut operator is preferentially carried out in the less path of key factor, thereby guaranteed that link has higher efficiency of transmission, make that the chaining key way is less, therefore the number of times of actual needs execution network code is also just few more, so cost is also more little.In addition, the embodiment of the invention is set up the path by distributed way, has higher fitness, can adapt to the dynamic mapping of network topology, has guaranteed to reduce under the theoretical capacity situation that realizes multicast the cost of network code.
Below in conjunction with accompanying drawing 5, with a specific embodiment method that reduces network coding cost is described, link bandwidth is unit bandwidth in the present embodiment; The method of present embodiment comprises the steps:
51, network node is searched the transmission path that can realize the multicast max-flow by distributed method, sets up path cluster;
Information destination node t
i∈ T sends near node it and obtains the information association requests, obtains feedback, knows the adjacent node number, path cluster information that is belonged to and adjacent node address; Select wherein not add as yet path cluster f (t
i) not at information source node s that has set up and t
iOn the path of ∈ T and unmarked be inaccessible node t
Near, to this adjacent node t
NearTransmission comprises the connection request that should belong to path number, and foundation is connected with this adjacent node; The path number that the information destination node record has been set up, this adjacent node t
NearThe adjacent node that uses the same method with own is connected, up to being connected of foundation and information source node.
Wherein, the operation that connects can be to write corresponding list item in the EDP of each adjacent node (comprising information source node) table; The EDP table sees Table 1, is used to store the information of the route of setting up, and writes down the next hop address or a last jumping address of this list item correspondence; Can overlap link paths setting up between information source node and the information destination node not have according to this information; For non-unit capacity link, also need increase the list item of record link bandwidth information.
Table 1, the EDP table of node v
In the last table 1, Table[v] .ID is the path cluster list item numbering of its ownership of nodes records; Table[v] .PID is the sign of node place path cluster, if this node is positioned at path cluster f (t
i) the path on, Table[v is then arranged] .PID=t
iIf node v is positioned at path cluster f (t simultaneously
i) and f (t
j) in, Table[v is then arranged] .PID=t
iAnd Table[v] .PID=t
jTable[v] .POrder is the sequence number in path in the path cluster at node place, default value is 0; Table[v] .next is the address of the next-hop node in path, when the address of the next-hop node of different path cluster path correspondence was identical, the link between node v and this next-hop node was the crucial link of different path cluster.According to Table[v] .PID and Table[v] .POrder just can discern which path which path cluster this node belongs to, and for example, the node v in the table 1 belongs to path cluster f (t respectively
1) in path 1 and path cluster f (t
3) in path 2, and because the next-hop node address of two path correspondences that belong to different path cluster is identical, so node v is crucial link to the link between the next-hop node (node of Address1 correspondence), if the unit capacity network then its key factor be 2.Certainly, Table[v in the table 1] .next also can be the address of a last hop node, when a last hop node address of two path correspondences that belong to different path cluster is identical, node v and the link that is somebody's turn to do between the last hop node are crucial link, and can determine the key factor of this key link according to the number of times that overlaps.
With the information destination node t1 shown in Fig. 5 a is example, and its method that is established to the path cluster of information source node s is: at first information destination node t1 connects its adjacent node 1, and adjacent node 1 sends connection request to the adjacent node of oneself again.In Fig. 5 a, the adjacent node of adjacent node 1 is node s.Described adjacent node 1 is connected with node s (being information source node), has set up path { t1,1, s} like this.When information destination node t1 seeks other path, still according to the same manner, because the Already in previous information source node s that sets up of node 1 is to the path of information destination node t1, so information destination node t1 connected node 1 again, so connected node 9, final the 2nd paths of setting up is { t1,9,4,5,2, s}; When intermediate node is set up link failure, then rollback notifies the node that has connected to remove the current path information of record in the EDP table step by step, until sending the information destination node of setting up path request, information destination node is labeled as the adjacent node on this path unreachable;
Each node is all carried out in the manner described above repeatedly, and promptly " information destination node-adjacent node-...-adjacent node ...-information source node ",, then set up a complete path if the adjacent node that traverses is an information source node.In the same way just can be in information source node to setting up whole paths between the information destination node, these paths constitute path cluster.For example, for information destination node t1, the path cluster that whole paths constitutes is f (t
1)={ { S, 1, t1}, { S, 2,5,4,9, t1}}.
For other information destination node, also construct path cluster in the same way.For Fig. 5 a, constitute path cluster and be: f (t
1)={ { S, 1, t1}, { S, 2,5,4,9, t1}}, f (t
2)={ { S, 4,9, t2}, { S, 6,8,10, t2}} and f (t
3)={ { S, 8,10, t3}, { S, 7, t3}}, { S, 3, t3}}.
52, determine multicast maximum stream flow bandwidth
Definition according to multicast maximum stream flow bandwidth, for the unit capacity network, then multicast maximum stream flow bandwidth be in each path cluster comprise a minimum available flow bandwidth of path cluster of number of paths, for non-unit capacity network, then need each paths bandwidth of path cluster is added up.With the unit capacity network is example, after setting up transmission path according to distributed way, searches the EDP table of information source node s, find to comprise record two of t1, so information destination node t1 respective path bunch bandwidth is 2.In like manner the path cluster bandwidth of t2 correspondence is 2, and the path cluster bandwidth of t3 correspondence is 3, can determine that then multicast maximum stream flow bandwidth is the minimum value 2 in the path cluster bandwidth of each information destination node t1, t2, t3 correspondence.
53, surpass the path cluster execution cut operator of multicast maximum stream flow bandwidth for the path cluster bandwidth,, be path cluster and comprise the path cluster of the number in path greater than multicast maximum stream flow bandwidth for the unit capacity network;
Because the path cluster of information destination node t3 correspondence contains 3 paths, the maximum stream flow bandwidth greater than multicast then needs to carry out cut operator.The path cluster that contains among the information destination node t3 is P
31={ S, 8,10, t3}, P
32={ S, 7, t3}}, P
33={ S, 3, t3}.The specific implementation of cut operator can be carried out in the following manner:
Obtain path P
31, P
32, P
33Each self-corresponding registration information, the registration information here can be key factor.With P
31Be example, information source node s sends the request of obtaining key factor to the adjacent node 8 of oneself.The EDP table of node 8 inquiries oneself, because 2 records are arranged, key factor is 2.Node 8 sends the request of obtaining key factor to the adjacent node 10 of oneself again, and the like, can obtain whole key factors, path P
32And path P
33There is not key factor, path P
31Key factor be 2.In other embodiments, can directly not obtain key factor by information source node s, but obtain related content the EDP table, then according to the related content that gets access to from adjacent node from adjacent node, information source node is known the registration of link, and the registration in definite path; Wherein, the registration information here is the related content in the EDP table, can comprise path cluster sign, path sequence number, next-hop node address in the EDP table of adjacent node, perhaps path cluster sign, path sequence number, a last hop node address.The key factor that directly obtains adjacent node can reduce information transmitted amount between node, lightens the load, and reduces error rate.
The key factor of all path correspondences on the path cluster of information destination node t3 correspondence sorted from small to large (do not comprise the path P that does not have key factor
32And path P
33), because have only path P
31Have key factor, therefore ordering is Δ
1(t
3)=2.
Information source node s is to path P
31In adjacent node 8 send the deletion message.Node 8 sends this deletion message to the adjacent node 10 of oneself again, successively up to sending to information destination node t3, P
31Go up each knot removal t3 entry.Final result is shown in Fig. 5 b.
Repeat this step 53, can need the path of beta pruning to carry out beta pruning all.
54, execute above-mentioned steps after, promptly determined the multicast transmission topology, just can carry out network code transmission.At the overlay path place of different path cluster, promptly in-degree is carried out random network code and is got final product more than or equal on 2 the node.
As can be seen, the in-degree of node 4 is 2, so this node need be carried out network code from Fig. 5 b.For explaining conveniently, the network size that this example is used is less.In the large scale network of reality, can significantly reduce the number of required coding nodes by said method.
The embodiment of the invention also provides a kind of system that reduces network coding cost, as shown in Figure 6, this system comprises information source node 61, intermediate node 62, information destination node 63 and reduces the device 64 of network coding cost that each node can have the equipment of I/O and computing function in actual applications for personal computer, server computer, network PC, router, switch, minicom or mainframe computer etc.
The device 64 of described reduction network coding cost is used to obtain the path cluster bandwidth of each path cluster, determines the multicast maximum stream flow bandwidth of described information source node according to described path cluster bandwidth; The path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth, determine the node of multicast transmission topology and participation network code; This device can be arranged on the arbitrary node and (comprise information source node 61, intermediate node 62, information destination node 63), can also be as the self-contained unit that is not present on any node in the transmission link, at this moment can with any node interaction message in the transmission link.For finishing this function, as shown in Figure 7, the device 64 of described reduction network coding cost is provided with:
Acquiring unit 70 is used to obtain the path cluster bandwidth of information source node to the path cluster of each information destination node;
Determining unit 71 is used for determining according to the path cluster bandwidth that described acquiring unit 70 obtains the multicast maximum stream flow bandwidth of described information source node;
Judging unit 72 is used to judge that information source node arrives the multicast maximum stream flow bandwidth whether the path cluster bandwidth of the path cluster of each information destination node is determined greater than described determining unit 71, if then notify beta pruning unit 73 greater than multicast maximum stream flow bandwidth;
Optionally, described determining unit 71 comprises:
Comparing unit 710 is used for the path cluster bandwidth that more described acquiring unit 70 obtains, and determines that information source node is a multicast maximum stream flow bandwidth to the minimum value in the path cluster bandwidth of each information destination node.
Optionally, described beta pruning unit 73 comprises:
Beta pruning determining unit 730 is used for the notice according to described judging unit 72, obtains the registration information of path cluster bandwidth greater than each path in the path cluster of multicast maximum stream flow bandwidth via described acquiring unit 70; Determine to treat the beta pruning path by the ascending order of registration, wherein, the path bandwidth sum of determining for the treatment of the beta pruning path is equal to or greater than the part that the path cluster bandwidth surpasses multicast maximum stream flow bandwidth;
Beta pruning performance element 731 is used for sending deletion message to described definite node on the beta pruning path for the treatment of, and adjusting the registration information of respective paths in the beta pruning path according to described beta pruning determining unit 730 definite treating.
Described information source node 61 is the node of the multicast data stream that starts, and is used for transmitting data by the path of definite transmission topology to described information destination node 63; Described intermediate node 62, be used for setting up information source node 61 to the transmission path of 63 at each stay of two nights joint bunch, and the equal small-large flow data of different path cluster ports inputs carried out network code at the Ingress node place of the overlay path of different path cluster with distributed way; Described information destination node 63 is the node that receives multicast data stream; Described each node (comprising information source node 61, intermediate node 62, information destination node 63) is set up transmission path bunch with distributed way, and wherein said intermediate node 62 can comprise one or more node.
Native system can reduce the interstitial content that participates in network code under the prerequisite of the theoretical capacity that guarantees multicast, thereby reduces the cost of network code.And this method should be distributed realization, is easy to dispose and use.
In sum, to comprise required coding nodes less by the transmission route of setting up being carried out cut operator, making for the embodiment of the invention, thereby reduce the cost of network code.And this method adopts distributed way when setting up the path, is easy to dispose in actual applications.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.
Claims (10)
1, a kind of method that reduces network coding cost is characterized in that, comprising:
Set up the path cluster of information source node by distributed way to each information destination node;
Obtain the path cluster bandwidth of each path cluster, determine the multicast maximum stream flow bandwidth of described information source node according to described path cluster bandwidth;
The path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth, determine the node of multicast transmission topology and participation network code.
2, the method for claim 1 is characterized in that, describedly determines that according to described path cluster bandwidth the multicast maximum stream flow bandwidth of described information source node comprises:
Compare each path cluster bandwidth;
Determine that the minimum value in each path cluster bandwidth is a multicast maximum stream flow bandwidth.
3, method as claimed in claim 1 or 2 is characterized in that, describedly the path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth comprises:
Obtain the registration information of path cluster bandwidth greater than each path in the path cluster of multicast maximum stream flow bandwidth;
Determine to treat the beta pruning path by the ascending order of registration, wherein, the path bandwidth sum of determining for the treatment of the beta pruning path is equal to or greater than the part that the path cluster bandwidth surpasses multicast maximum stream flow bandwidth;
Send deletion message to described definite node on the beta pruning path for the treatment of, and adjust the registration information of respective paths.
4, method as claimed in claim 3 is characterized in that, the described path cluster bandwidth of obtaining comprises greater than the registration information in each path in the path cluster of multicast maximum stream flow bandwidth:
Node on the path sends the request of obtaining registration information; The registration information of the link of each node feedback on the information source node RX path, the minimum value of the registration of definite link that is received is the key factor in this path; Perhaps
Each node on the path obtains the key factor of downstream node successively, and up to information destination node, each node with the key factor of the key factor that obtains and this node is relatively got the minimum value recurrence and returned upstream node.
5, as claim 3 or 4 described methods, it is characterized in that, describedly definite treat that the node on the beta pruning path sends deletion message, and the registration information of adjusting respective paths comprises to described:
To determining that the node on the path that needs to delete sends deletion message;
The record of this path correspondence of described knot removal, and upgrade registration information, and issue this message successively and give the downstream adjacent node up to information destination node.
6, the method for claim 1 is characterized in that, the node of described definite participation network code comprises:
The Ingress node of determining the overlay path place of different path cluster after the beta pruning is used for the equal small-large flow data of different path cluster ports inputs are carried out network code for participating in the node of network code.
7, a kind of device that reduces network coding cost is characterized in that, comprising:
Acquiring unit is used to obtain the path cluster bandwidth of information source node to the path cluster of each information destination node;
Determining unit, the path cluster bandwidth that is used for obtaining according to described acquiring unit are determined the multicast maximum stream flow bandwidth of described information source node;
Judging unit is used to judge that information source node arrives the multicast maximum stream flow bandwidth whether the path cluster bandwidth of the path cluster of each information destination node is determined greater than described determining unit, if then notify the beta pruning unit greater than multicast maximum stream flow bandwidth;
The beta pruning unit is used for the notice according to described judging unit, and the path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth, determines the node of multicast transmission topology and participation network code.
8, device as claimed in claim 7 is characterized in that, described determining unit comprises:
Comparing unit is used for the path cluster bandwidth that more described acquiring unit obtains, and determines that information source node is a multicast maximum stream flow bandwidth to the minimum value in the path cluster bandwidth of each information destination node.
As claim 7 or 8 described devices, it is characterized in that 9, described beta pruning unit comprises:
The beta pruning determining unit is used for the notice according to described judging unit, obtains the registration information of path cluster bandwidth greater than each path in the path cluster of multicast maximum stream flow bandwidth via described acquiring unit; Determine to treat the beta pruning path by the ascending order of registration, wherein, the path bandwidth sum of determining for the treatment of the beta pruning path is equal to or greater than the part that the path cluster bandwidth surpasses multicast maximum stream flow bandwidth;
The beta pruning performance element is used for sending deletion message to described definite node on the beta pruning path for the treatment of, and adjusting the registration information of respective paths in the beta pruning path according to treating of determining of described beta pruning determining unit.
10, a kind of system that reduces network coding cost is characterized in that, comprising: information source node, intermediate node, information destination node and reduce the device of network coding cost, and each node is set up transmission path bunch with distributed way;
The device of described reduction network coding cost is used to obtain the path cluster bandwidth of each path cluster, determines the multicast maximum stream flow bandwidth of described information source node according to described path cluster bandwidth; The path cluster bandwidth is carried out beta pruning greater than the path cluster of multicast maximum stream flow bandwidth, determine the node of multicast transmission topology and participation network code;
Described information source node is used for transmitting data by the path of definite transmission topology to described information destination node;
Described intermediate node is used for setting up information source node to the transmission path of each information destination node bunch with distributed way, and at the Ingress node place of the overlay path of different path cluster the equal small-large flow data of different path cluster ports inputs is carried out network code.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100890351A CN101562556B (en) | 2008-04-15 | 2008-04-15 | Method, device and system for reducing network coding cost |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100890351A CN101562556B (en) | 2008-04-15 | 2008-04-15 | Method, device and system for reducing network coding cost |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101562556A true CN101562556A (en) | 2009-10-21 |
| CN101562556B CN101562556B (en) | 2011-08-03 |
Family
ID=41221186
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100890351A Active CN101562556B (en) | 2008-04-15 | 2008-04-15 | Method, device and system for reducing network coding cost |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101562556B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
| CN101917334A (en) * | 2010-08-03 | 2010-12-15 | 浙江大学 | Transmission network generation method by network coding of part of nodes |
| CN102123006A (en) * | 2011-01-24 | 2011-07-13 | 华中科技大学 | Network transmission method employing network coding |
| CN101764675B (en) * | 2009-12-23 | 2013-06-19 | 北京邮电大学 | Coding resource adaptive scheduling algorithm in distributed network |
| CN103346965A (en) * | 2013-06-24 | 2013-10-09 | 重庆邮电大学 | Light multicast route method based on coding subgraph optimized coding cost |
| WO2015021615A1 (en) * | 2013-08-14 | 2015-02-19 | 华为技术有限公司 | Routing traffic adjustment method, device and controller |
| CN105337702A (en) * | 2015-10-10 | 2016-02-17 | 华中科技大学 | Network transmission method adopting spatial network coding based on Delaunay triangulation |
| CN109614397A (en) * | 2018-10-30 | 2019-04-12 | 阿里巴巴集团控股有限公司 | The method and apparatus of the sequence node of relational network are obtained based on distributed system |
| CN111769907A (en) * | 2020-07-08 | 2020-10-13 | 清华大学 | Data transmission method and device for ad hoc network communication |
| CN114070777A (en) * | 2020-07-29 | 2022-02-18 | 中国电信股份有限公司 | Multicast tree construction method, multicast data transmission method, controller and storage medium |
| CN114726772A (en) * | 2022-03-02 | 2022-07-08 | 山西大学 | Efficient route protection method based on optimized network topology structure |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101146049A (en) * | 2007-10-31 | 2008-03-19 | 北京航空航天大学 | Radio Ad hoc data transmission method based on network coding |
-
2008
- 2008-04-15 CN CN2008100890351A patent/CN101562556B/en active Active
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101764675B (en) * | 2009-12-23 | 2013-06-19 | 北京邮电大学 | Coding resource adaptive scheduling algorithm in distributed network |
| CN101883330B (en) * | 2010-07-02 | 2012-07-11 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
| CN101917334A (en) * | 2010-08-03 | 2010-12-15 | 浙江大学 | Transmission network generation method by network coding of part of nodes |
| CN101917334B (en) * | 2010-08-03 | 2012-05-23 | 浙江大学 | Transmission network generation method by network coding of part of nodes |
| CN102123006A (en) * | 2011-01-24 | 2011-07-13 | 华中科技大学 | Network transmission method employing network coding |
| CN102123006B (en) * | 2011-01-24 | 2013-09-04 | 华中科技大学 | Network transmission method employing network coding |
| CN103346965B (en) * | 2013-06-24 | 2016-02-10 | 重庆邮电大学 | Based on the light multicast route method of coding subgraph Optimized Coding Based cost |
| CN103346965A (en) * | 2013-06-24 | 2013-10-09 | 重庆邮电大学 | Light multicast route method based on coding subgraph optimized coding cost |
| WO2015021615A1 (en) * | 2013-08-14 | 2015-02-19 | 华为技术有限公司 | Routing traffic adjustment method, device and controller |
| CN105337702A (en) * | 2015-10-10 | 2016-02-17 | 华中科技大学 | Network transmission method adopting spatial network coding based on Delaunay triangulation |
| CN105337702B (en) * | 2015-10-10 | 2018-04-10 | 华中科技大学 | A kind of network transfer method using the spatial network coding based on Delaunay Triangulation |
| CN109614397A (en) * | 2018-10-30 | 2019-04-12 | 阿里巴巴集团控股有限公司 | The method and apparatus of the sequence node of relational network are obtained based on distributed system |
| CN109614397B (en) * | 2018-10-30 | 2023-06-20 | 创新先进技术有限公司 | Method and device for acquiring node sequence of relational network based on distributed system |
| CN111769907A (en) * | 2020-07-08 | 2020-10-13 | 清华大学 | Data transmission method and device for ad hoc network communication |
| CN111769907B (en) * | 2020-07-08 | 2021-07-27 | 清华大学 | Data transmission method and device for ad hoc network communication |
| CN114070777A (en) * | 2020-07-29 | 2022-02-18 | 中国电信股份有限公司 | Multicast tree construction method, multicast data transmission method, controller and storage medium |
| CN114070777B (en) * | 2020-07-29 | 2023-07-04 | 中国电信股份有限公司 | Multicast tree construction method, multicast data transmission method, controller and storage medium |
| CN114726772A (en) * | 2022-03-02 | 2022-07-08 | 山西大学 | Efficient route protection method based on optimized network topology structure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101562556B (en) | 2011-08-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101562556B (en) | Method, device and system for reducing network coding cost | |
| Li et al. | Coding for distributed fog computing | |
| CN102282810B (en) | Load balancing | |
| CN103703455A (en) | Reverse path forwarding lookup with link bundles | |
| US20100165989A1 (en) | Binary trees for multicast traffic | |
| CN102510404A (en) | Nondestructive continuous extensible interconnection structure for data center | |
| CN105450741B (en) | Provisioning server selection and repair data transmission method in distributed memory system | |
| CN107111481A (en) | Distribution actively mixes storage system | |
| US11018896B2 (en) | Information processing apparatus and information processing method | |
| CN110278202A (en) | A kind of file uploading system | |
| CN103986661B (en) | A kind of multicast route method for supporting network code | |
| CN110190926B (en) | Erasure code updating method and system based on network computing | |
| CN101764675B (en) | Coding resource adaptive scheduling algorithm in distributed network | |
| Rescigno | Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security | |
| Ding et al. | A MapReduce‐supported network structure for data centers | |
| JP5522003B2 (en) | Network relay system and network relay system automatic setting method | |
| CN102325009A (en) | Forward error correction-based method for reliably transmitting network coding multicast data stream | |
| CN109952809A (en) | The network architecture that quaternary full mesh is driven with dimension | |
| CN103532758B (en) | Be applicable to the configuration processing method of transmission of future generation, data equipment fusion | |
| WO2015165383A1 (en) | Centrally optimized variable length coding for source routed multicast | |
| Wu et al. | A practical network coding and routing scheme based on maximum flow combination | |
| CN111385200B (en) | Control method and device for data block repair | |
| Park et al. | A novel hybrid P2P and cloud storage system for retrievability and privacy enhancement | |
| CN104539715A (en) | Network multi-content request response method | |
| Xiong et al. | MTM: A reliable multiple trees multicast for data center network |
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 |