CN112039774A - Tunnel and SR combined network flow adjusting and optimizing method - Google Patents
Tunnel and SR combined network flow adjusting and optimizing method Download PDFInfo
- Publication number
- CN112039774A CN112039774A CN202010734425.0A CN202010734425A CN112039774A CN 112039774 A CN112039774 A CN 112039774A CN 202010734425 A CN202010734425 A CN 202010734425A CN 112039774 A CN112039774 A CN 112039774A
- Authority
- CN
- China
- Prior art keywords
- tunnel
- network
- path
- flow
- optimal
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/829—Topology based
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/18—End to end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/19—Flow control; Congestion control at layers above the network layer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/25—Routing or path finding in a switch fabric
Abstract
The invention discloses a network flow optimization method combining a tunnel and an SR, relating to the technical field of network communication and comprising the following steps: constructing an LDP tunnel, and identifying the LDP tunnel by adopting an MPLS label, wherein the MPLS label is a global label mode; generating a tunnel logic topological graph according to the LDP tunnel and the global network topological traffic information; when the message is forwarded, an optimal forwarding path of the scheduling message is planned according to the tunnel logic topological graph, the current flow information of the LDP tunnel and the current estimated flow information, and the message is controlled to be forwarded according to the optimal forwarding path of the scheduling message based on the SR, so that the network flow is adjusted and optimized. The method carries out flow scheduling when the flow is accessed into the network, avoids the flow from generating congestion behavior in the network, and accurately controls path forwarding through a tunnel path scheduling method based on the SR, thereby achieving the purpose of flow scheduling.
Description
Technical Field
The invention relates to the technical field of network communication, in particular to a network flow adjusting and optimizing method combining a tunnel and an SR.
Background
The method comprises the steps that a control plane and a forwarding plane of equipment are separated by a Software Defined Network (SDN), the control plane is centralized on an SDN controller, the control plane has global topology, traffic load information and the like, and the whole network path and traffic are planned in a centralized mode. Since the SDN controller centrally controls and manages the devices in the entire network, when the number of managed devices is increased, the management of the controller becomes complicated, and the reliability is greatly reduced, for example, to adjust an end-to-end traffic requires operating a device in each hop on a path. How to reduce the complexity of controller management and ensure the reliability is a problem which needs to be solved urgently by the current SDN controller.
The gradual maturation of Segment Routing (SR) technology and commercial deployment in recent years have attracted much industry attention. The scheme refers to the idea of defining a network by software, redefines the use and meaning of the MPLS label and the label stack, skillfully unifies the scheduling capability of an end-to-end path and the path planning capability based on an IP model, but is limited by the software and hardware limitations of traditional equipment, and the SR still lacks the capability of accurately indicating the path in the aspects of routing and networking.
In the traditional network, due to the distributed networking architecture, routing is calculated based on regions, global planning cannot be performed, and traffic is forwarded based on the shortest path, so that a plurality of traffic can travel the same path, and the forwarding path cannot be automatically adjusted, so that the congestion probability is greatly increased, the utilization rate of network bandwidth resources is very low, the network bandwidth needs to be increased to solve the congestion problem, but the current bandwidth technology has already reached a bottleneck, and the adjustment of the traffic from the traffic scheduling direction is particularly urgent to improve the utilization rate of the network resources.
Disclosure of Invention
The invention provides a network flow optimization method combining a tunnel and an SR, which can alleviate the problems.
In order to alleviate the above problems, the technical scheme adopted by the invention is as follows:
a network flow optimization method combining a tunnel and an SR (scheduling request), comprising the following steps:
constructing an LDP tunnel, and identifying the LDP tunnel by adopting an MPLS label, wherein the MPLS label is a global label mode;
generating a tunnel logic topological graph according to the LDP tunnel and the global network topological traffic information;
when the message is forwarded, an optimal forwarding path of the scheduling message is planned according to the tunnel logic topological graph, the current flow information of the LDP tunnel and the current estimated flow information, and the message is controlled to be forwarded according to the optimal forwarding path of the scheduling message based on the SR, so that the network flow is adjusted and optimized.
Compared with the prior art, the invention has the beneficial effects that: the defects of the SR technology are overcome through the preplanned MPLS tunnel logic topology technology, the accurate path planning can be carried out on the flow in the network, all equipment on the path does not need to be managed and controlled, the management complexity is reduced, the robustness of the management network is ensured, and the purpose of reducing the whole network bandwidth utilization rate is achieved.
Further, the construction method of the LDP tunnel comprises the following steps:
dividing a global network into an access network area, a convergence network area and a core network area;
marking the devices in each divided region, and calculating a path between the outlet device and the inlet device;
selecting N optimal paths from each region;
and constructing the LDP tunnel according to the optimal path of each area.
The technical effect of the scheme is as follows: the method can ensure that the network flow cannot be uniformly planned on the shortest path, thereby reducing the probability of network flow congestion.
Further, each path is calculated by dijkstra algorithm. Further, the method for generating the tunnel logic topological graph includes: taking the LDP tunnel as a logic network node, judging the relationship between the inlet equipment and the outlet equipment of the logic network node in the physical link topology according to the global network topology flow information, and generating the tunnel logic topology graph according to the relationship between the inlet equipment and the outlet equipment in each logic network node in the physical link topology.
The technical effect of the scheme is as follows: and the management scale of the network is reduced by generating a logical topology through the tunnel.
Furthermore, for a certain logical network node, if there is link information between the ingress device and the egress device in the physical topology, there is link connection information between them, otherwise there is no link connection information.
Further, the method for forwarding the message specifically comprises the following steps:
s1, acquiring current flow information, current estimated flow information and a tunnel logic topological graph of the LDP tunnel;
s2, calculating whether an optimal solution path exists or not based on the current traffic information, the current estimated traffic information and the tunnel logic topological graph of the LDP tunnel, if so, executing a step S4, otherwise, executing a step S3;
s3, selecting the flow with the lowest importance degree of the whole network flow service, deleting the first hop flow table entry, and jumping to the step S2;
s4, taking the optimal solution path as the optimal forwarding path of the scheduling message, encapsulating the message at the entrance PE equipment based on the SR, and pressing the corresponding MPLS label into the optimal forwarding path of the scheduling message;
and S5, forwarding the packaged message according to the optimal forwarding path of the scheduling message.
The technical effect of the scheme is as follows: the importance of the message flow can be identified, and the optimal path is selected for forwarding.
Further, in step S2, it is calculated whether there is an optimal solution path according to the weighted shortest path first algorithm.
Further, in step S5, when the encapsulated packet reaches the exit of the mth hop that is not the last hop in the optimal forwarding path of the scheduling packet, the MPLS label of the mth hop is stripped, and then the encapsulated packet is forwarded according to the remaining paths in the optimal forwarding path of the scheduling packet.
The technical effect of the scheme is as follows: and stripping the M & ltth & gt hop label to enable the M & lt +1 & gt hop label to be set at the top, and forwarding by using the M & lt +1 & gt hop label.
Furthermore, if the encapsulated packet reaches the exit of the last hop of the optimal forwarding path of the scheduling packet, the MPLS label of the last hop is stripped, and then the encapsulated packet is sent to the destination terminal.
The technical effect of the scheme is as follows: and stripping the last hop label to restore the last hop label to the original message, thereby completing the forwarding of the message on the network.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
FIG. 1 is a flow chart of a network traffic tuning method combining tunneling and SR in an embodiment;
FIG. 2 is a flow chart of construction of an LDP tunnel in an embodiment;
FIG. 3 is a logical topology diagram of a tunnel in an embodiment;
fig. 4 is a flow chart of message flow forwarding in the embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1 to 4, the present embodiment provides a method for tuning network traffic in combination of a tunnel and an SR in an SDN architecture, where the method first generates a tunnel logic topology, and then forwards a packet according to the tunnel logic topology based on an SR technology.
Before generating the tunnel logic topology map, the SDN controller first constructs an LDP tunnel, as shown in fig. 2, specifically as follows:
firstly, dividing a global network into an access network area, a convergence network area and a core network area, marking equipment in each area, and calculating a path between outlet equipment and inlet equipment in each area.
If the size of the core network area is too large, the core network area is continuously cut into a plurality of smaller core network areas, and the same operation is carried out on the convergence network area in the same way.
For the access network area, the marked devices are an entrance PE device and an exit device, or an exit PE device and an entrance device, and the calculated path is a path between the entrance PE device and the exit device, or a path between the entrance device and the exit PE device;
for the convergence network area and the core network area, an ingress device and an egress device in the area are marked, and a path between the ingress device and the egress device in the area is calculated.
In this embodiment, each path is calculated by dijkstra algorithm.
For each region, N optimal paths are selected, in this embodiment, N is 2, that is, two optimal paths, i.e., an optimal path and a suboptimal path, are set to be selected.
And finally, constructing the LDP tunnel according to the optimal path and the suboptimal path.
After the construction of the LDP tunnel is completed, the LDP label announcement is not carried out, the LDP tunnel is identified by adopting an MPLS label, wherein the used MPLS label is a global label mode, the SDN controller automatically generates the device configuration of the device on the path according to the calculated path and the allocated MPLS label, sends the configuration to the appointed device, and the device applies the configuration to the corresponding device after receiving the configuration. After the configuration is completed, the flow information acquisition process based on the LDP tunnel can be started.
In this embodiment, as shown in fig. 3, the method for generating the tunnel logic topology includes: taking the LDP tunnel as a logic network node, judging the relationship between the inlet equipment and the outlet equipment of the logic network node in the physical link topology according to the global network topology flow information, and generating a tunnel logic topology graph according to the relationship between the inlet equipment and the outlet equipment in each logic network node in the physical link topology.
For a certain logical network node, if link information exists between the ingress device and the egress device in the physical link topology, link connection information exists between the ingress device and the egress device, otherwise, link connection information does not exist.
According to the embodiment, end-to-end traffic scheduling is performed based on the SR according to a pre-planned tunnel logic topological graph, the traffic scheduling is converted into a problem of traffic selection tunnel forwarding, and due to the fact that the SDN has topology and traffic data of the whole network, the problem of network congestion can be avoided in advance at the edge of the network, and a path which does not cause congestion is planned at the edge of a user access network.
The SDN controller collects and monitors information such as flow and the like of tunnel flow of the whole network; when new traffic is accessed into the network, the SDN controller selects an optimal solution path according to the demand of the new traffic and the utilization rate of the bandwidth of the tunnel of the existing network and according to a shortest path priority algorithm with a weight (the path node is a tunnel, and the whole tunnel is regarded as a logical network node).
Based on the SR technology, the process of forwarding a packet according to the tunnel logic topology is shown in fig. 4, which specifically includes the following steps:
s1, acquiring current flow information, current estimated flow information and a tunnel logic topological graph of the LDP tunnel;
s2, calculating whether an optimal solution path exists or not based on the current traffic information, the current estimated traffic information and the tunnel logic topological graph of the LDP tunnel, if so, executing a step S4, otherwise, executing a step S3;
s3, the SDN controller selects the flow with the lowest importance degree of the whole network flow service, deletes the first hop flow guide table entry of the flow, and jumps to the step S2;
s4, taking the optimal solution path as the optimal forwarding path of the scheduling message, encapsulating the message at the entrance PE equipment based on the SR, and pressing the corresponding MPLS label into the optimal forwarding path of the scheduling message;
and S5, forwarding the packaged message according to the optimal forwarding path of the scheduling message.
In step S2 of the present embodiment, whether or not there is an optimal solution path is calculated according to the weighted shortest path first algorithm.
In step S3 of this embodiment, the first hop drainage table entry is deleted to solve the problem that the spare bandwidth meets the requirement, and if the spare bandwidth does not meet the requirement, the first hop drainage table entry is continuously removed.
In this embodiment, the packet is encapsulated at the ingress PE device, and the calculated path node information is pushed to the head of the optimal forwarding path of the scheduling packet, with the first hop being at the outermost layer.
In step S5 of this embodiment, when the encapsulated packet reaches the exit of the mth hop that is not the last hop in the optimal forwarding path of the scheduling packet, the MPLS label of the mth hop is stripped, and then the encapsulated packet is forwarded according to the remaining paths in the optimal forwarding path of the scheduling packet. And if the packaged message reaches the exit of the last hop of the optimal forwarding path of the scheduling message, stripping the MPLS label of the last hop, and then sending the packaged message to the destination terminal.
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes will occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (9)
1. A network flow optimization method combining a tunnel and an SR is characterized by comprising the following steps:
constructing an LDP tunnel, and identifying the LDP tunnel by adopting an MPLS label, wherein the MPLS label is a global label mode;
generating a tunnel logic topological graph according to the LDP tunnel and the global network topological traffic information;
when the message is forwarded, an optimal forwarding path of the scheduling message is planned according to the tunnel logic topological graph, the current flow information of the LDP tunnel and the current estimated flow information, and the message is controlled to be forwarded according to the optimal forwarding path of the scheduling message based on the SR, so that the network flow is adjusted and optimized.
2. The method for tuning network traffic by combining tunnel and SR according to claim 1, wherein the method for constructing the LDP tunnel comprises:
dividing a global network into an access network area, a convergence network area and a core network area;
marking the devices in each divided region, and calculating a path between the outlet device and the inlet device;
selecting N optimal paths from each region;
and constructing the LDP tunnel according to the optimal path of each area.
3. The method for tuning network traffic according to claim 2, wherein each path is calculated by dijkstra's algorithm.
4. The method for tuning network traffic combining tunneling and SR according to claim 1, wherein the method for generating the tunnel logical topology specifically includes: taking the LDP tunnel as a logic network node, judging the relationship between the inlet equipment and the outlet equipment of the logic network node in the physical link topology according to the global network topology flow information, and generating the tunnel logic topology graph according to the relationship between the inlet equipment and the outlet equipment in each logic network node in the physical link topology.
5. The method of claim 4, wherein for a logical network node, if there is link information in the physical link topology between the ingress device and the egress device, there is link connection information between them, otherwise there is no link connection information.
6. The method for tuning network traffic combining tunneling and SR according to claim 1, wherein the method for forwarding the packet specifically includes the following steps:
s1, acquiring current flow information, current estimated flow information and a tunnel logic topological graph of the LDP tunnel;
s2, calculating whether an optimal solution path exists or not based on the current traffic information, the current estimated traffic information and the tunnel logic topological graph of the LDP tunnel, if so, executing a step S4, otherwise, executing a step S3;
s3, selecting the flow with the lowest importance degree of the whole network flow service, deleting the first hop flow table entry, and jumping to the step S2;
s4, taking the optimal solution path as the optimal forwarding path of the scheduling message, encapsulating the message at the entrance PE equipment based on the SR, and pressing the corresponding MPLS label into the optimal forwarding path of the scheduling message;
and S5, forwarding the packaged message according to the optimal forwarding path of the scheduling message.
7. The method for tuning network traffic according to claim 6, wherein in step S2, it is calculated whether there is an optimal solution path according to a weighted shortest path first algorithm.
8. The method for tuning network traffic according to claim 6, wherein in step S5, when the encapsulated packet reaches an exit of an M-th hop that is not a last hop in the optimal forwarding path of the scheduling packet, the MPLS label of the M-th hop is stripped, and then the encapsulated packet is forwarded according to the remaining paths in the optimal forwarding path of the scheduling packet.
9. The method for tuning network traffic according to claim 8, wherein if the encapsulated packet reaches the exit of the last hop of the optimal forwarding path of the scheduling packet, the MPLS label of the last hop is stripped, and then the encapsulated packet is sent to the destination terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010734425.0A CN112039774B (en) | 2020-07-27 | 2020-07-27 | Tunnel and SR combined network flow adjusting and optimizing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010734425.0A CN112039774B (en) | 2020-07-27 | 2020-07-27 | Tunnel and SR combined network flow adjusting and optimizing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112039774A true CN112039774A (en) | 2020-12-04 |
| CN112039774B CN112039774B (en) | 2022-01-07 |
Family
ID=73583294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010734425.0A Active CN112039774B (en) | 2020-07-27 | 2020-07-27 | Tunnel and SR combined network flow adjusting and optimizing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112039774B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140169370A1 (en) * | 2012-10-05 | 2014-06-19 | Cisco Technology, Inc. | Segment Routing Techniques |
| CN107483338A (en) * | 2016-06-08 | 2017-12-15 | 华为技术有限公司 | A kind of method, apparatus and system for determining cross-domain label switched path tunnel |
| CN107911316A (en) * | 2017-12-29 | 2018-04-13 | 江苏省未来网络创新研究院 | A kind of traffic scheduling method and system based on MPLS in SDN technologies |
| CN108075980A (en) * | 2016-11-17 | 2018-05-25 | 中兴通讯股份有限公司 | A kind of control method of forward-path, device and control device |
| CN109495385A (en) * | 2018-12-04 | 2019-03-19 | 安徽皖兴通信息技术有限公司 | A kind of network flow dispatching method for realizing discontinuous Segment routing domain |
| CN109995655A (en) * | 2018-01-03 | 2019-07-09 | 中兴通讯股份有限公司 | A kind of method and device for realizing seamless optimal cross-domain path |
-
2020
- 2020-07-27 CN CN202010734425.0A patent/CN112039774B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140169370A1 (en) * | 2012-10-05 | 2014-06-19 | Cisco Technology, Inc. | Segment Routing Techniques |
| CN107483338A (en) * | 2016-06-08 | 2017-12-15 | 华为技术有限公司 | A kind of method, apparatus and system for determining cross-domain label switched path tunnel |
| CN108075980A (en) * | 2016-11-17 | 2018-05-25 | 中兴通讯股份有限公司 | A kind of control method of forward-path, device and control device |
| CN107911316A (en) * | 2017-12-29 | 2018-04-13 | 江苏省未来网络创新研究院 | A kind of traffic scheduling method and system based on MPLS in SDN technologies |
| CN109995655A (en) * | 2018-01-03 | 2019-07-09 | 中兴通讯股份有限公司 | A kind of method and device for realizing seamless optimal cross-domain path |
| CN109495385A (en) * | 2018-12-04 | 2019-03-19 | 安徽皖兴通信息技术有限公司 | A kind of network flow dispatching method for realizing discontinuous Segment routing domain |
Non-Patent Citations (2)
| Title |
|---|
| RABAH GUEDREZ等: "《A new method for encoding MPLS segment routing TE paths》", 《IEEE》 * |
| 高晓敏等: "《SR软件路由器的设计与实现》", 《电信科学》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112039774B (en) | 2022-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7505413B2 (en) | Methods and systems to perform traffic engineering in a metric-routed network | |
| US8218445B2 (en) | Smart ethernet edge networking system | |
| US10129043B2 (en) | Apparatus and method for network flow scheduling | |
| US9191280B2 (en) | System, device, and method for a voiding bandwidth fragmentation on a communication link by classifying bandwidth pools | |
| CN109714275B (en) | SDN controller for access service transmission and control method thereof | |
| EP2915307B1 (en) | Communications network using a tunnel to connect two network nodes | |
| CN108234312B (en) | Flow scheduling method, PCE (path computation element) and SDN (software defined network) system | |
| US7958209B2 (en) | Methods and systems to generate and implement a changeover sequence to reconfigure a connection-oriented network | |
| CN104994033A (en) | Method for guaranteeing QoS (quality of service) of SDN (software defined network) by means of dynamic resource management | |
| CN108989210B (en) | Strategy-based tunnel selection method and software defined network controller | |
| CN107888490B (en) | Message forwarding method, routing delay calculation and scheduling device and system | |
| CN101841487A (en) | Configuration method for aggregating link service flow and packet switching device | |
| EP1579227B1 (en) | Methods and systems to perform traffic engineering in a metric-routed network | |
| CN111130853B (en) | Future route prediction method of software defined vehicle network based on time information | |
| CN108234314B (en) | Service scheduling method and device | |
| CN109246013B (en) | Routing method in FC-AE-1553 switching type network | |
| CN111555982B (en) | Method and system for intelligently routing message based on IPv6 extension header | |
| CN108418755A (en) | Data flow transmission method and device | |
| CN104753823A (en) | Service quality reservation establishing method and node | |
| CN106161053A (en) | A kind of SDN controller QoS manages system and method | |
| CN113923125A (en) | Tolerance analysis method and device for multi-service flow converged communication in industrial heterogeneous network | |
| CN111917645A (en) | SDN-based path optimization method and system for mobile network | |
| CN109889444A (en) | A kind of methods, devices and systems of planning path | |
| CN113542120B (en) | Path selection method and device and computer readable storage medium | |
| CN108234355B (en) | Network resource reservation method, PCE (personal computer equipment) and SDN (software defined network) system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |