CN111614560A - Distributed dynamic routing method - Google Patents
Distributed dynamic routing method Download PDFInfo
- Publication number
- CN111614560A CN111614560A CN202010449834.6A CN202010449834A CN111614560A CN 111614560 A CN111614560 A CN 111614560A CN 202010449834 A CN202010449834 A CN 202010449834A CN 111614560 A CN111614560 A CN 111614560A
- Authority
- CN
- China
- Prior art keywords
- network
- edge device
- data packet
- packet
- network interface
- 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.)
- Pending
Links
Images
Classifications
-
- 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/44—Distributed routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- 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/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a distributed dynamic routing method, which relates to the technical field of telecommunication; a distributed dynamic routing method comprises the following steps: one or more packet-switched internal telecommunication networks connect one or more edge devices, each edge device being connected to one or more packet-switched external telecommunication networks, a source edge device of an internal telecommunication network receiving data packets of the external telecommunication network, the data packets comprising network routing information, the source edge device determining an address and a network interface of a target edge device, generating a transport packet addressed to the determined target edge device, the transport packet comprising the received data packet and the determined address of the next hop and the determined network interface of the target edge device, the generated transport packet being transported from the source edge device to the determined target edge device via one or more internal telecommunication networks of the data link hierarchy, the data packet being further sent via the network interface of the target edge device.
Description
Technical Field
The invention discloses a method, relates to the technical field of telecommunication, and particularly relates to a distributed dynamic routing method.
Background
CIDR (classless inter-domain routing) addressing is common in the prior art. A set of destination address prefixes of the routing table are grouped to form a group based on the network topology. This allows one to reduce the number of entries in the routing table. However, this may result in some destination addresses corresponding to several different destination address prefixes of the routing table. In this case the most suitable one, i.e. the longest one, has to be selected from the different destination address prefixes of the routing table. For example, the alternatives are 202.10.15/20 and 202.10.15/24, then 202.10.15/24 is chosen because it is longer.
However, conventional routing solutions are inefficient in that, in IP networks, routing decisions are made at the L3 level, i.e., at the network layer level, which easily results in the detection of a failure, and the location and recovery from the failure must also be made at the L3 level, which is much slower than those made at the L2 level, i.e., at the data link layer level. Furthermore, if there are a large number of routing nodes, the router will be very complex.
In addition to the above-mentioned conventional routing, so-called flow routing has to classify different flows and has to maintain state data of each flow in each router, making the router very complex. Furthermore, even in flow routing, the detection localization and recovery of the failure must be performed at the L3 level, again quite slowly.
Furthermore, known MPLS routing (multi-protocol label switching) requires that a portion of the entire network be based on MPLS usage and that the state of each path must be maintained in each router, making routers very complex. In the case of MPLS routing, TE routing (traffic engineering, TE) and fault tolerance are very complex, and if the network is large and has many quality levels, the number of paths is greatly increased, which is not favorable for network stability and speed-up.
Disclosure of Invention
The invention provides a distributed dynamic routing method aiming at the problems in the prior art, and the specific scheme provided by the invention is as follows:
a distributed dynamic routing method comprises the following steps: one or more packet-switched internal telecommunication networks connecting one or more edge devices, each edge device being connected to one or more packet-switched external telecommunication networks,
a source edge device of the internal telecommunications network receiving a data packet of the external telecommunications network, the data packet including network routing information, the source edge device determining an address and a network interface of a destination edge device, generating a transport packet addressed to the determined destination edge device, the transport packet including the received data packet and the determined address of the next hop and the determined network interface of the destination edge device,
the generated transport packets are transported from the source edge device to the determined target edge device via one or more internal telecommunication networks of the data link layer hierarchy,
the data packet is further sent via the network interface of the destination edge device.
In the distributed dynamic routing method, when a data packet is further sent through a network interface of a target edge device, whether a next hop address is a single address or a network address is judged, if the next hop address is the single address, the data packet is sent to the next hop address, and if the next hop address is the network address, the data packet is sent to a destination address included in the network address.
In the distributed dynamic routing method, network routing information is maintained in one or more edge devices, and the network routing information includes destination address prefixes and corresponding next-hop addresses, network switching information of the next-hop addresses, and addresses and network interfaces of corresponding target edge devices.
In the distributed dynamic routing method, when new or changed network routing information is received from an external telecommunication network at an edge device, network routing and/or exchange information maintained by the edge device is updated, an update message is formed according to the received network routing information and associated exchange information, and the update message is sent to one or more other edge devices.
In the distributed dynamic routing method, one or more other edge devices receiving the update message update the network routing information and/or the exchange information of the edge devices, and send the updated network routing information and/or the exchange information to one or more external networks connected with the edge devices.
In the distributed dynamic routing method, internal telecommunication networks are connected through a gateway, transmission packets and updating data packets are transmitted among the internal telecommunication networks through the gateway, and the gateway keeps routing and switches information among the internal telecommunication networks respectively.
In a distributed dynamic routing method described, when an update data packet for a gateway is received from a first internal telecommunications network, routing and switching information for the first internal telecommunications network maintained by the gateway is updated, if necessary, the received update data packet is modified by replacing the network interface of the destination edge device included in the switching information with the network interface of the gateway, the modified update data packet is sent to one or more edge devices of a second internal telecommunications network, and the network routing information or switching information maintained by the edge devices receiving the modified update data packet is updated.
In the distributed dynamic routing method, a transmission packet is sent from a source edge device of the second internal telecommunication network, the source edge device receives the modified update data packet to a target edge device of the first internal telecommunication network, wherein a network interface of the target edge device of the transmission packet is replaced by a network interface of a gateway, the transmission packet is sent to the network interface of the gateway, the network interface of the target edge device of the received data packet is determined through exchange information maintained by the gateway, and the network interface of the gateway contained in the transmission packet is replaced by the determined network interface of the target edge device.
In the distributed dynamic routing method, when a data packet of a multicast type is received from an external telecommunication network to a source edge device, the data packet is sent to a multicast network interface of a target edge device.
The present invention also provides a computer readable medium having stored thereon computer instructions which, when executed by a processor, cause the processor to perform a method of distributed dynamic routing according to any of claims 1 to 9.
The invention has the advantages that:
compared with the prior art, the invention provides a distributed dynamic routing method, which can realize effective distributed dynamic routing without other control equipment or virtual machines, for data packets entering an internal telecommunication network, when the data packets reach a source edge device, the data packets are routed to a target edge device, and the data packets are directly sent to the target edge device through the internal telecommunication network of the L2 level, and a new routing decision is made at the L3 level unlike the existing routing;
furthermore, the routing method of the present invention operates with good fault tolerance, detecting faults, locating them and recovering from them when packets are transmitted on the path of the source edge device to the destination edge device at level L2 can be performed at level L2 on the millisecond level, much faster than existing routes performing these processes at level L3.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
fig. 2 is a schematic topology diagram of a packet switched internal telecommunication network, an external telecommunication network and an edge device according to the invention.
Detailed Description
The term "internal telecommunication network" in the present invention refers to a telecommunication network implementing the routing according to the present invention.
The term "external telecommunication network" refers to a telecommunication network that does not implement the routing of the present invention.
The term "edge device" refers to a node of a network, which is arranged at the periphery of the network, in addition to its own network, also connected to a node of some other network.
The term "source edge device" refers to such an edge device that receives data packets from an external telecommunication network. Thus, any edge device of the internal telecommunication network can be used as a source edge device.
The term "destination edge device" refers to the edge device to which the generated transport packet is addressed. Thus, any edge device of the internal telecommunication network can be used as the target edge device.
The present invention is further described below in conjunction with the following figures and specific examples so that those skilled in the art may better understand the present invention and practice it, but the examples are not intended to limit the present invention.
The invention provides a distributed dynamic routing method, which comprises the following steps: one or more packet-switched internal telecommunication networks connecting one or more edge devices, each edge device being connected to one or more packet-switched external telecommunication networks,
a source edge device of the internal telecommunications network receiving a data packet of the external telecommunications network, the data packet including network routing information, the source edge device determining an address and a network interface of a destination edge device, generating a transport packet addressed to the determined destination edge device, the transport packet including the received data packet and the determined address of the next hop and the determined network interface of the destination edge device,
the generated transport packets are transported from the source edge device to the determined target edge device via one or more internal telecommunication networks of the data link layer hierarchy,
the data packet is further sent via the network interface of the destination edge device.
By means of the method of the invention, without the aid of other control devices or virtual machines, an efficient distributed dynamic routing can be achieved, for data packets entering the internal telecommunication network, when the data packets reach the source edge device, the data packets are routed to the target edge device, and the data packets are sent directly to the target edge device via the internal telecommunication network at level L2, unlike existing routing where new routing decisions are made at level L3.
In an embodiment of the present invention, a process for further sending a data packet via a network interface of a target edge device is further described: upon further transmission of the data packet from the network interface of the destination edge device, it is determined whether the next hop address is a single address or a network address. If it is a single address, the packet is sent to the next hop address. In case it is a network address, the data packet is sent to the destination address included therein. With the above process, the data packet is distributed to an appropriate location.
In another embodiment of the method of the present invention, further comprising maintaining network routing information in one or more edge devices, the network routing information including destination address prefixes and corresponding next-hop addresses, as well as network switching information for the next-hop addresses, and addresses and network interfaces for corresponding destination edge devices,
when the edge device receives new or changed network routing information from the external telecommunication network, updating the network routing and/or exchange information maintained by the edge device, forming an update message according to the received network routing information and the associated exchange information, and sending the update message to one or more other edge devices;
and one or more other edge devices receiving the updating message updates the network routing information and/or the exchange information of the edge devices, and sends the updated network routing information and/or the exchange information to one or more connected external networks.
By utilizing the embodiment, the method can realize the updating of the whole data packet of the edge device in the internal telecommunication network, simultaneously updates the data packet updating of the external network connected with the edge device, and can forward the data packet according to the updating packet in real time.
In another embodiment of the method of the invention, the connection between the internal telecommunication networks is described, i.e. the connection is via a gateway, and the transmission packets and the update data packets are sent between the internal telecommunication networks via the gateway, and the gateway keeps the route, switches the information between the internal telecommunication networks respectively,
the method specifically comprises the following steps: when an update data packet of a gateway is received from a first internal telecommunication network, updating, if necessary, routing and switching information of the first internal telecommunication network maintained by the gateway, modifying the received update data packet by replacing the network interface of the target edge device included in the switching information with the network interface of the gateway, sending the modified update data packet to one or more edge devices of a second internal telecommunication network, updating the network routing information or switching information maintained by the edge device receiving the modified update data packet;
and transmitting a transport packet from a source edge device of the second internal telecommunications network, the source edge device receiving the modified update data packet to a destination edge device of the first internal telecommunications network, wherein a network interface of a destination edge device of the transport packet is replaced with a network interface of the gateway, transmitting the transport packet to the network interface of the gateway, determining a network interface of a destination edge device of the received data packet from switching information maintained by the gateway, replacing the network interface of the gateway included in the transport packet with the determined network interface of the destination edge device,
and when a data packet of the multicast type is received from the external telecommunication network to the source edge device, it is sent to the multicast network interface of the target edge device.
The first internal telecommunication network and the second internal telecommunication network described above illustrate only the differences in the structure of the two internal networks and are not to be taken as a condition for limiting the internal telecommunication networks.
With the above described embodiment, the distribution of routes and forwarding of packets between the two internal telecommunication networks is achieved, which can be referred to the structure of the two internal telecommunication networks in fig. 2, packet switched internal telecommunication networks SV1 and SV2, packet switched external telecommunication networks UV1, UV2, UV3, UV4 and UV 5. The edge devices RL1, RL2, RL3, RL4 and RL5 are used to receive data packets from external telecommunications networks. Edge devices RL1, RL2 and RL3 have been arranged with internal telecommunications network SV1 and edge devices RL4 and RL5 have been arranged with internal telecommunications network SV 2.
The internal telecommunication networks SV1, SV2 and the external telecommunication networks UV1, UV2, UV3UV4 and UV5 are IP networks. Each edge device may be connected to the external telecommunication network in some way known per se, for example via a BGP interface (border gateway protocol), via an OSPF interface (open shortest path first) or via an ISIS interface (intermediate system to intermediate system).
Further, as shown in fig. 1 and 2, each of the edge devices RL1, RL2, RL3, RL4 and RL5 includes a routing table RT1, RT2, RT3, RT4 and RT5, respectively, for determining a next hop address corresponding to a destination address prefix of a received packet. Furthermore, the routing tables RT1, RT2, RT3, RT4, RT5 have arranged to maintain routing information for the network, including destination address prefixes and their corresponding next-hop addresses. The routing table may be implemented using some applicable description known per se, or e.g. a longest match operation.
Edge devices are many nodes that implement routing functions, i.e., routers, and data packets travel from one router to another while traveling from a source node to a destination node. Each router maintains a routing table that includes a set of destination address prefixes and their corresponding next-hop addresses. When a packet arrives at a router, the router reads the destination address of the packet's destination node. If the read destination address is not in the same network as the router, the router retrieves the next hop address corresponding to the network of destination addresses from its routing table. In this way, a data packet travels from one router to another until it reaches a router that is located in the same network as the destination node, which typically sends the data packet directly to the destination address, the data packet traversing several different routers on the way through a single network.
In addition to the method of the present invention, the present invention also provides a computer readable medium having stored thereon computer instructions which, when executed by a processor, cause the processor to perform the method of distributed dynamic routing. Specifically, a system or an apparatus equipped with a storage medium on which software program codes that realize the functions of any of the above-described embodiments are stored may be provided, and a computer (or a CPU or MPU) of the system or the apparatus is caused to read out and execute the program codes stored in the storage medium.
In this case, the program code itself read from the storage medium can realize the functions of any of the above-described embodiments, and thus the program code and the storage medium storing the program code constitute a part of the present invention.
Examples of the storage medium for supplying the program code include a floppy disk, a hard disk, a magneto-optical disk, an optical disk (e.g., CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD + RW), a magnetic tape, a nonvolatile memory card, and a ROM. Alternatively, the program code may be downloaded from a server computer via a communications network.
Further, it should be clear that the functions of any one of the above-described embodiments may be implemented not only by executing the program code read out by the computer, but also by causing an operating system or the like operating on the computer to perform a part or all of the actual operations based on instructions of the program code.
Further, it is to be understood that the program code read out from the storage medium is written to a memory provided in an expansion board inserted into the computer or to a memory provided in an expansion unit connected to the computer, and then causes a CPU or the like mounted on the expansion board or the expansion unit to perform part or all of the actual operations based on instructions of the program code, thereby realizing the functions of any of the above-described embodiments.
The above-mentioned embodiments are merely preferred embodiments for fully illustrating the present invention, and the scope of the present invention is not limited thereto. The equivalent substitution or change made by the technical personnel in the technical field on the basis of the invention is all within the protection scope of the invention. The protection scope of the invention is subject to the claims.
Claims (10)
1. A distributed dynamic routing method, characterized by one or more packet-switched internal telecommunication networks connected to one or more edge devices, each edge device being connected to one or more packet-switched external telecommunication networks,
a source edge device of the internal telecommunications network receiving a data packet of the external telecommunications network, the data packet including network routing information, the source edge device determining an address and a network interface of a destination edge device, generating a transport packet addressed to the determined destination edge device, the transport packet including the received data packet and the determined address of the next hop and the determined network interface of the destination edge device,
the generated transport packets are transported from the source edge device to the determined target edge device via one or more internal telecommunication networks of the data link layer hierarchy,
the data packet is further sent via the network interface of the destination edge device.
2. A distributed dynamic routing method as claimed in claim 1 wherein when the data packet is further sent via the network interface of the destination edge device, it is determined whether the next hop address is a single address or a network address, and if so, the data packet is sent to the next hop address, and if so, the data packet is sent to the destination address included in the network address.
3. A distributed dynamic routing method according to claim 1 or 2, wherein network routing information is maintained in one or more edge devices, said network routing information including destination address prefixes and corresponding next-hop addresses, and network switching information for the next-hop addresses, and addresses and network interfaces of the respective destination edge devices.
4. A distributed dynamic routing method as claimed in claim 3 wherein when new or changed network routing information is received at the edge device from the external telecommunications network, the network routing and/or switching information maintained by the edge device is updated, and an update message is formed based on the received network routing information and associated switching information and sent to one or more other edge devices.
5. A distributed dynamic routing method as claimed in claim 4 wherein one or more other edge devices receiving the update message updates their own network routing information and/or switching information and sends the updated network routing information and/or switching information to one or more external networks to which it is connected.
6. A distributed dynamic routing method as claimed in any one of claims 1, 4 or 5 in which the internal telecommunications networks are connected by gateways, transmission packets and update data packets are sent between the gateway internal telecommunications networks and the gateways maintain routes to switch information between the internal telecommunications networks respectively.
7. A distributed dynamic routing method according to claim 6, characterized in that when an update data packet of the gateway is received from the first internal telecommunication network, the routing and switching information of the first internal telecommunication network maintained by the gateway is updated, if necessary, the received update data packet is modified by replacing the network interface of the destination edge device included in the switching information with the network interface of the gateway, the modified update data packet is sent to one or more edge devices of the second internal telecommunication network, the network routing information or switching information maintained by the edge device receiving the modified update data packet is updated.
8. A distributed dynamic routing method according to claim 7, wherein a transport packet is sent from a source edge device of said second internal telecommunications network, said source edge device receiving said modified update data packet to a destination edge device of said first internal telecommunications network, wherein a network interface of a destination edge device of a transport packet is replaced with a network interface of a gateway, a transport packet is sent to said network interface of a gateway, a network interface of a destination edge device of a received packet is determined from switching information maintained by the gateway, and a network interface of a gateway included in a transport packet is replaced with the determined network interface of the destination edge device.
9. A distributed dynamic routing method according to any of claims 1-2 or 4-5 or 6-8, characterized in that when a data packet of multicast type is received from the external telecommunication network to the source edge device, it is sent to the multicast network interface of the destination edge device.
10. Computer readable medium, characterized in that said computer readable medium has stored thereon computer instructions which, when executed by a processor, cause said processor to execute a method for distributed dynamic routing according to any of claims 1 to 9.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010449834.6A CN111614560A (en) | 2020-05-25 | 2020-05-25 | Distributed dynamic routing method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010449834.6A CN111614560A (en) | 2020-05-25 | 2020-05-25 | Distributed dynamic routing method |
Publications (1)
Publication Number | Publication Date |
---|---|
CN111614560A true CN111614560A (en) | 2020-09-01 |
Family
ID=72204964
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010449834.6A Pending CN111614560A (en) | 2020-05-25 | 2020-05-25 | Distributed dynamic routing method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111614560A (en) |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050185645A1 (en) * | 2004-02-24 | 2005-08-25 | Valtion Teknillinen Tutkimuskeskus | Distributed dynamic routing |
CN1855872A (en) * | 2005-04-28 | 2006-11-01 | 华为技术有限公司 | Communication method and system between mixed network VPN stations across different autonomous systems |
CN102098202A (en) * | 2009-12-11 | 2011-06-15 | 华为技术有限公司 | Virtual private topology control method, device and system |
CN105306333A (en) * | 2014-06-30 | 2016-02-03 | 瞻博网络公司 | Service chaining across multiple networks |
CN106487675A (en) * | 2015-08-31 | 2017-03-08 | 丛林网络公司 | For the outlet protection in EVPN with BUM flow during link failure |
CN107786439A (en) * | 2016-08-26 | 2018-03-09 | 中国电信股份有限公司 | Cross-domain routing method, controller, system and method for routing and intradomain router |
-
2020
- 2020-05-25 CN CN202010449834.6A patent/CN111614560A/en active Pending
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050185645A1 (en) * | 2004-02-24 | 2005-08-25 | Valtion Teknillinen Tutkimuskeskus | Distributed dynamic routing |
CN1855872A (en) * | 2005-04-28 | 2006-11-01 | 华为技术有限公司 | Communication method and system between mixed network VPN stations across different autonomous systems |
CN102098202A (en) * | 2009-12-11 | 2011-06-15 | 华为技术有限公司 | Virtual private topology control method, device and system |
CN105306333A (en) * | 2014-06-30 | 2016-02-03 | 瞻博网络公司 | Service chaining across multiple networks |
CN106487675A (en) * | 2015-08-31 | 2017-03-08 | 丛林网络公司 | For the outlet protection in EVPN with BUM flow during link failure |
CN107786439A (en) * | 2016-08-26 | 2018-03-09 | 中国电信股份有限公司 | Cross-domain routing method, controller, system and method for routing and intradomain router |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4703213B2 (en) | Packet routing method and system | |
US9825886B2 (en) | Routing protocols for accommodating nodes with redundant routing facilities | |
US9998368B2 (en) | Zone routing system | |
US9350646B2 (en) | MPLS traffic engineering for point-to-multipoint label switched paths | |
US7957306B2 (en) | Providing reachability information in a routing domain of an external destination address in a data communications network | |
US7983153B2 (en) | Fast reroute (FRR) protection at the edge of a RFC 2547 network | |
US7855953B2 (en) | Method and apparatus for managing forwarding of data in an autonomous system | |
US7864669B2 (en) | Method of constructing a backup path in an autonomous system | |
US7697416B2 (en) | Constructing a repair path in the event of non-availability of a routing domain | |
US7580359B2 (en) | Method and system for maximizing network capacity utilization in multiprotocol label switched networks by moving label switched paths | |
US20080225864A1 (en) | Communication network routing apparatus and techniques using logical communication links | |
US20060153200A1 (en) | Automatic prioritization of BGP next-hop in IGP | |
EP2254284A1 (en) | Method and device for route installation and distribution | |
US20120124238A1 (en) | Prioritization of routing information updates | |
CN113228572A (en) | Interior Gateway Protocol (IGP) for Segment Routing (SR) proxy Segment Identification (SID) | |
EP1905196A2 (en) | Method and apparatus for updating label-switched paths | |
US11546252B2 (en) | Fast flooding topology protection | |
JPWO2005057864A1 (en) | Network path switching system | |
CN113826362A (en) | Transport endpoint segmentation for inter-domain segment routing | |
CN111614560A (en) | Distributed dynamic routing method | |
US20220255838A1 (en) | A Method and a Device for Routing Traffic Along an IGP Shortcut Path | |
JP3878140B2 (en) | Communication node, routing information advertising method, routing information advertising program, and recording medium |
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 | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200901 |