CN115766557A - Routing system, table item generation method of session maintenance table and related device - Google Patents

Routing system, table item generation method of session maintenance table and related device Download PDF

Info

Publication number
CN115766557A
CN115766557A CN202211339274.4A CN202211339274A CN115766557A CN 115766557 A CN115766557 A CN 115766557A CN 202211339274 A CN202211339274 A CN 202211339274A CN 115766557 A CN115766557 A CN 115766557A
Authority
CN
China
Prior art keywords
entry
routing
address
target
calculation
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
Application number
CN202211339274.4A
Other languages
Chinese (zh)
Inventor
贺继国
李加新
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Star Net Ruijie Networks Co Ltd
Original Assignee
Beijing Star Net Ruijie Networks Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Star Net Ruijie Networks Co Ltd filed Critical Beijing Star Net Ruijie Networks Co Ltd
Priority to CN202211339274.4A priority Critical patent/CN115766557A/en
Publication of CN115766557A publication Critical patent/CN115766557A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application discloses a routing system, a method for generating an entry of a session maintenance table and related device electronic equipment, which are used for sharing a task of generating the session maintenance table by an IR. The IR sends a computation routing table to the CPE controller; the CPE controller receives and forwards the data to each CPE corresponding to the IR; each CPE receives the calculation routing table and receives a first data message sent by the UE; determining a target BID from the computation force routing table; generating an address replacement relationship based on the destination address and the target BID; an entry in the session-holding table is generated based on the destination address, the source address, the destination and source ports, the address replacement relationship, and the optimal computational routing entry. The entries of the session maintenance table are generated by setting a plurality of CPEs, so that the pressure of IR generation of the entries of the session maintenance table is shared, and each CPE only needs to generate the corresponding entry in the session maintenance table associated with the UE, thereby ensuring the generation efficiency of the entries of the session maintenance table.

Description

Routing system, table item generation method of session maintenance table and related device
Technical Field
The present application relates to the field of communications technologies, and in particular, to a routing system, a method for generating an entry of a session holding table, and a related device.
Background
With the development of internet technology, more and more users start to use the internet for communication, and in order to ensure that requests from the same client are sent to the same backend server for processing, a session maintenance mechanism is adopted in the related art.
In the related art, an Ingress Router (abbreviated as IR) is usually used to generate the session holding table, and as the traffic volume becomes larger and larger, the number of the session holding tables required to be generated by IR will reach millions and millions, which may cause the pressure of IR to be too large, and further cause the efficiency of generating the session holding table to be reduced.
Disclosure of Invention
The application aims to provide a routing system, a session maintaining table entry generating method and device, electronic equipment and a storage medium, which are used for sharing the task of generating a session maintaining table by an IR (infrared receiver) and improving the generation efficiency of the session maintaining table.
In a first aspect, an embodiment of the present application provides a routing system, where the system includes: at least one IR, a Customer Premises Equipment (CPE) controller, and a CPE corresponding to each IR, wherein:
each said IR to send a computational routing table to said CPE controller; the computation routing table comprises at least one computation routing entry;
the CPE controller is used for receiving the calculation routing table sent by the IR and sending the calculation routing table to the N CPEs based on the preset corresponding relation between the IR and the CPEs;
each CPE is used for receiving a calculation routing table sent by the CPE controller and receiving a first data message sent by User Equipment (UE), wherein the first data message comprises a destination address, a source address, a destination port and a source port; determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID; generating an address replacement relationship based on the destination address and the target BID; generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computational routing entry.
In the embodiment of the present application, by setting a plurality of CPEs to generate entries of the session maintenance table, the pressure of IR generation of entries of the session maintenance table is shared, and each CPE only needs to generate an entry in the session maintenance table associated with the UE corresponding to the CPE, thereby ensuring the generation efficiency of the entries of the session maintenance table.
In some possible embodiments, after the CPE performs receiving the computation routing table sent by the CPE controller and receiving the first data packet sent by the user equipment UE, the CPE is further configured to:
determining whether an address replacement relation corresponding to the destination address is inquired in the session holding table based on the destination address;
if the address replacement relation corresponding to the destination address is not inquired, determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation; replacing the destination address of the first data message by the target BID to obtain a second data message; and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In the embodiment of the present application, when the UE in the CPE has the session holding table, if the UE sends the data packet again, the UE does not need to generate the session holding table again, and can directly perform the replacement of the destination address and the tunnel encapsulation processing according to the session holding table, thereby ensuring the communication efficiency.
In some possible embodiments, after the CPE performs generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computationally intensive routing entry, the CPE further performs the following:
replacing the destination address of the first data message by the target BID to obtain a second data message;
and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, when determining the optimal computation power routing entry from the computation power routing table sent by the CPE controller is performed, the method is specifically configured to:
determining a first calculation force routing entry which is occupied with the least calculation force in the calculation force routing table based on a calculation force optimization principle; determining a second calculation force routing entry with optimal network resources based on a path optimization principle;
performing weighting processing on first target data in the first calculation routing entry, and performing weighting processing on second target data in the second calculation routing entry to obtain an optimal calculation routing entry, wherein the first target data is data corresponding to a calculation power column and data corresponding to a path column of the first calculation routing entry in the calculation routing table; the second target data is data corresponding to the calculated force column and data corresponding to the path column of the second calculated force routing entry in the calculated force routing table; the calculation force column is a column in which data representing the occupied calculation force are located in the calculation force routing table, and the path column is a column in which data representing network resources are located in the calculation force routing table.
In the embodiment of the application, the target BID is determined according to the calculation power optimal principle and the path optimal principle, so that the problem of large ER load caused by sending a plurality of data messages to the same ER can be avoided.
In some possible embodiments, when the CPE performs tunnel encapsulation processing on the second data packet based on the entry to which the target BID belongs, the CPE is specifically configured to:
determining a corresponding packaging end node in the table entry to which the target BID belongs;
and performing tunnel encapsulation processing on the second data message based on the encapsulation ending node.
In a second aspect, the present application further provides a method for generating an entry of a session holding table, which is applied to a CPE in the routing system in the first aspect, where the method includes:
receiving a computational power routing table sent by the CPE controller, and receiving a first data message sent by User Equipment (UE), wherein the first data message comprises a destination address, a source address, a destination port and a source port;
determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
generating an address replacement relationship based on the destination address and the target BID;
an entry in a session holding table is generated based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computational routing entry.
In some possible embodiments, after receiving the computation routing table sent by the CPE controller and receiving the first data packet sent by the user equipment UE, the method further includes:
determining whether an address replacement relation corresponding to the destination address is inquired in the session holding table based on the destination address;
if the address replacement relation corresponding to the destination address is not inquired, determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation; replacing the destination address of the first data message by the target BID to obtain a second data message; and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, after generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computationally intensive routing entry, the method further comprises:
replacing the destination address of the first data message by the target BID to obtain a second data message;
and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, the determining an optimal computationally intensive routing entry from the computationally intensive routing table sent from the CPE controller comprises:
determining a first calculation force routing entry which is occupied with the least calculation force in the calculation force routing table based on a calculation force optimization principle; determining a second calculation force routing entry with optimal network resources based on a path optimization principle;
performing weighting processing on first target data in the first calculation routing entry, and performing weighting processing on second target data in the second calculation routing entry to obtain an optimal calculation routing entry, wherein the first target data is data corresponding to a calculation power column and data corresponding to a path column of the first calculation routing entry in the calculation routing table; the second target data is data corresponding to the calculated force column and data corresponding to the path column of the second calculated force routing entry in the calculated force routing table; the calculation force column is a column in which data representing the occupied calculation force are located in the calculation force routing table, and the path column is a column in which data representing network resources are located in the calculation force routing table.
In some possible embodiments, the tunneling the second data packet based on the entry to which the target BID belongs includes:
determining a corresponding packaging end node in a table entry to which the target BID belongs;
and performing tunnel encapsulation processing on the second data message based on the encapsulation ending node.
In a third aspect, an embodiment of the present application further provides a session maintenance table generating device, which is applied to the method in the second aspect, where the device includes:
a receiving module, configured to receive a computation routing table sent by the CPE controller, and receive a first data packet sent by a user equipment UE, where the first data packet includes a destination address, a source address, a destination port, and a source port;
a BID determination module, configured to determine an optimal computation power routing entry from a computation power routing table sent by the CPE controller, and use a binding address BID of the optimal computation power routing entry as a target BID;
a replacement relationship generation module for generating an address replacement relationship based on the destination address and the target BID;
a session holding table generating module, configured to generate an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computation force routing entry.
In some possible embodiments, after the session maintenance table generating module performs receiving of the computation routing table sent by the CPE controller and receiving of the first data packet sent by the user equipment UE, the session maintenance table generating module is further configured to:
determining whether an address replacement relation corresponding to the destination address is inquired in the session holding table based on the destination address;
if the address replacement relation corresponding to the destination address is not inquired, determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation; replacing the destination address of the first data message by the target BID to obtain a second data message; and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, the session-holding-table generating module, after generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computational-power routing entry, is further configured to:
replacing the destination address of the first data message by the target BID to obtain a second data message;
and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, when the BID determination module determines the optimal computation power routing entry from the computation power routing table sent by the CPE controller, the BID determination module is specifically configured to:
determining a first calculation force routing entry which is occupied with the least calculation force in the calculation force routing table based on a calculation force optimization principle; determining a second computational power routing entry with the optimal network resources based on the path optimization principle;
performing weighting processing on first target data in the first calculation routing entry, and performing weighting processing on second target data in the second calculation routing entry to obtain an optimal calculation routing entry, wherein the first target data is data corresponding to a calculation power column and data corresponding to a path column of the first calculation routing entry in the calculation routing table; the second target data is data corresponding to the calculated force column and data corresponding to the path column of the second calculated force routing entry in the calculated force routing table; the calculation power column is a column in which data representing the occupied calculation power is located in the calculation power routing table, and the path column is a column in which data representing network resources is located in the calculation power routing table.
In some possible embodiments, when the session holding table generating module performs tunnel encapsulation processing on the second data packet based on the entry to which the target BID belongs, the session holding table generating module is specifically configured to:
determining a corresponding packaging end node in a table entry to which the target BID belongs;
and performing tunnel encapsulation processing on the second data message based on the encapsulation ending node.
In a fourth aspect, another embodiment of the present application further provides an electronic device, including at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform any one of the methods provided by the embodiments of the first aspect of the present application.
In a fifth aspect, another embodiment of the present application further provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program, and the computer program is configured to make a computer execute any one of the methods provided in the embodiment of the first aspect of the present application.
Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the application. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required to be used in the embodiments of the present application will be briefly described below, and it is obvious that the drawings described below are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a routing system according to an embodiment of the present application;
fig. 2 is a computational power routing representation intention of a routing system according to an embodiment of the present application;
fig. 3 is a schematic flowchart of generating an entry of a session holding table in a routing system according to an embodiment of the present application;
fig. 4 is a schematic flowchart of determining a target BID in a routing system according to an embodiment of the present disclosure;
fig. 5 is another schematic diagram of a computation force routing table of a routing system according to an embodiment of the present application;
fig. 6 is a session maintenance representation intention of a routing system according to an embodiment of the present application;
fig. 7 is a schematic flowchart of a routing system processing a data message based on a session holding table according to an embodiment of the present application;
fig. 8 is a schematic diagram of an entry generation apparatus for a session holding table according to an embodiment of the present application;
fig. 9 is a schematic view of an electronic device corresponding to a method for generating an entry of a session holding table according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions in the embodiments of the present application will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. 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 application. In the present application, the embodiments and features of the embodiments may be arbitrarily combined with each other without conflict. Also, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.
The terms "first" and "second" in the description and claims of the present application and the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the term "comprises" and any variations thereof, which are intended to cover non-exclusive protection. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. The term "a plurality" in the present application may mean at least two, for example, two, three or more, and the embodiments of the present application are not limited.
In the technical scheme, the data acquisition, transmission, use and the like all meet the requirements of relevant national laws and regulations.
The inventor researches and discovers that as internet technology develops, more and more users begin to use the internet for communication, and in order to ensure that requests from the same client are sent to the same backend server for processing, a session holding mechanism of session holding is adopted in the related art. In the related art, the session maintenance table is usually generated by using IR, and as the traffic volume becomes larger, the number of the session maintenance tables required to be generated by IR will reach millions and millions, which may cause excessive pressure on IR, and further cause the efficiency of generating the session maintenance table to be reduced.
In view of the foregoing, the present application provides a routing system, a session maintenance table generation method, an apparatus, an electronic device, and a storage medium, which are used to solve the foregoing problems. The inventive concept of the present application can be summarized as follows: the IR sends a computation routing table to the CPE controller; the CPE controller receives the calculation force routing table sent by the IR, and sends the calculation force routing table to the CPE corresponding to the IR based on the preset corresponding relation between the IR and the CPE; each CPE receives a calculation routing table sent by a CPE controller and receives a first data message sent by the UE; determining an optimal computation force routing entry from a computation force routing table, and taking a binding address BID of the optimal computation force routing entry as a target BID; generating an address replacement relationship based on the destination address and the target BID; an entry in a session holding table is generated based on a destination address, the source address, the destination port, the source port, an address replacement relationship, and an optimal computational routing entry.
For the sake of understanding, a routing system provided by the embodiments of the present application is described in detail below with reference to the accompanying drawings:
fig. 1 is a schematic structural diagram of a routing system in the embodiment of the present application. The drawing comprises the following steps: the system comprises IR10, a CPE controller 20 and CPE30, wherein the CPE30 comprises CPE 1-CPEN; wherein:
an IR10 for sending a computation routing table to the CPE controller; the calculation routing table comprises a plurality of calculation routing entries;
the CPE controller 20 is used for receiving the calculation force routing table sent by the IR, and sending the calculation force routing table to N CPEs corresponding to the IR based on the preset corresponding relation between the IR and the CPEs;
for each CPE30, the CPE30 is configured to receive a computation routing table sent by a CPE controller, and receive a first data packet sent by a user equipment UE, where the first data packet includes a destination address, a source address, a destination port, and a source port; determining an optimal calculation force routing entry from a calculation force routing table based on a calculation force optimal principle and a path optimal principle, and taking a binding address BID of the optimal calculation force routing entry as a target BID; generating an address replacement relationship based on the destination address and the target BID; an entry in the session-holding table is generated based on the destination address, the source address, the destination and source ports, the address replacement relationship, and the optimal computational routing entry.
Only a single IR10, CPE controller 20, CPE30 is detailed in the description of the present application, but it will be understood by the skilled person that the illustrated IR10, CPE controller 20, CPE30 are intended to represent the operation of the IR10, CPE controller 20, CPE30 to which the solution of the present application relates. And not to imply a limitation on the number, type or location of the IR10, CPE controller 20, CPE30, etc. It should be noted that the underlying concepts of the example embodiments of the present application may not be altered if additional modules are added or removed from the illustrated environments. In addition, it is understood by those skilled in the art that the above-mentioned data transmission and reception also need to be realized through a network.
In addition, the routing system provided by the application is not only suitable for the application scenario shown in fig. 1, but also suitable for any device requiring the generation of the session holding table.
For convenience of understanding, each part of a routing system provided in the embodiments of the present application is described below:
1、IR
in this embodiment of the present application, the IR does not need to perform an operation of generating a session holding table, the IR receives a computation routing table sent by a computation network router controller (CFN router controller, abbreviated as CFN router controller), and then only needs to maintain the computation routing table, as shown in fig. 2, the computation routing table includes a plurality of computation routing entries, and if receiving a modification operation for the computation routing table, the IR modifies the computation routing table according to the modification operation, saves the modified computation routing table as a new-version computation routing table, and sends a computation routing table that needs to ensure that the sent computation routing table is the latest version to the CPE controller. And then the accuracy of the target BID determined subsequently according to the calculation routing table can be ensured.
2. CPE controller
In the embodiment of the present application, the CPE controller is provided in the routing system, and the CPE corresponding to the IR can be accurately determined by the CPE controller. For example: currently, there are IR1, IR2, IR3, and IR4, and CPE001 to CPE300, the CPE corresponding to each IR can be determined according to the preset corresponding relationship between the preset IR and the CPE, and it is assumed that CPE001 to CPE050 correspond to IR1, CPE051 to CPE150 correspond to IR2, CPE151 to CPE200 correspond to IR3, and CPE201 to CPE300 correspond to IR 4.
3、CPE
In the embodiment of the present application, for a plurality of CPEs corresponding to the same IR, the operation flow of each CPE is the same, so the following description is made of the operation flow of one CPE:
in the embodiment of the present application, a flowchart of the CPE generating an entry of the session maintenance table is shown in fig. 3, where:
in step 301: receiving a calculation routing table sent by a CPE controller, and receiving a first data message sent by UE;
wherein, the first data message includes: a destination address, a source address, a destination port and a source port;
in step 302: determining an optimal calculation power routing entry from the calculation power routing table, and taking the BID of the optimal calculation power routing entry as a target BID;
in this embodiment of the present application, in order to reasonably utilize network resources, and therefore, when a session maintenance table is constructed, selecting a target BID is performed based on a calculation-force optimization principle and a path optimization principle, step 302 may be specifically implemented as a step shown in fig. 4, where:
in step 401: determining a first calculation force routing entry which is occupied with the least calculation force in a calculation force routing table based on a calculation force optimal principle; determining a second computational power routing entry with the optimal network resources based on the path optimization principle;
for example: for the computation force routing table shown in fig. 5, according to the computation force column of each computation force routing entry, the computation force routing entry which is occupied with the least computation force may be determined as entry 3, and the computation force routing entry which is the optimal network resource may be determined as computation force 4 according to the path column.
In step 402: weighting first target data in the first calculation force routing entry, and weighting second target data in the second calculation force routing entry to obtain an optimal calculation force routing entry;
the first target data are data corresponding to the calculation power column and data corresponding to the path column of the first calculation power routing entry in the calculation power routing table; the second target data is data corresponding to the calculated force column and data corresponding to the path column of the second calculated force routing entry in the calculated force routing table; the calculation force column is a column in which data representing the occupied calculation force are located in the calculation force routing table, and the path column is a column in which data representing network resources are located in the calculation force routing table.
Continuing with the example of fig. 5, assuming that the calculation force routing table is used, wherein the weight occupied by the calculation force column is 40%, and the weight corresponding to the path column is 60%, the first target data may be determined based on the calculation force routing table as follows: 80,40; the second target data is 40,80. It can then be determined that entry 3 is weighted by: 80 × 40% +40 × 60% =56, entry 4 weighted value: 40 × 40% +80 × 60% =64, whereby the optimal computational power routing entry is found to be entry 4.
In step 403: and taking the BID in the optimal computation power routing entry as a target BID.
Continuing with the example of FIG. 5, BID4 in entry 4 is taken as the target BID.
In step 303: generating an address replacement relationship based on the destination address and the target BID;
in step 304: an entry in a session holding table is generated based on a destination address, the source address, the destination port, the source port, an address replacement relationship, and an optimal computational routing entry.
Continuing with the computational routing table of fig. 5 as an example, the entry in the generated session maintenance table is the second row as shown in fig. 6.
In some possible embodiments, for a data packet sent by the same UE in the same session, the same session holding table entry needs to be used to process the data packet, so after the data packet sent by the UE is received, it needs to be determined whether a session holding table corresponding to the data packet exists in the current CPE, if not, the steps shown in fig. 3 may be implemented to construct the session holding table, and then the destination address of the first data packet is replaced by the target BID to obtain a second data packet; and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target exit router ER, wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
If so, the data message may be processed using the steps shown in FIG. 7, where:
in step 701: if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation;
in step 702: replacing the destination address of the first data message by the target BID to obtain a second data message;
in step 703: and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to the target exit router ER.
And the target ER is the ER corresponding to the table entry to which the target BID belongs.
In this embodiment of the present application, when performing tunnel encapsulation processing on the second data packet, the following steps may be specifically implemented: determining a packaging end node corresponding to the table entry to which the target BID belongs; and performing tunnel encapsulation processing on the second data message based on the encapsulation end node.
For example: taking the session holding table shown in fig. 6 as an example, determining that the corresponding target BID is BID4 for the first data packet, replacing the destination address in the first data packet with BID4 to obtain a replaced third packet, performing tunnel encapsulation processing on the third packet according to an encapsulation end point ER4 in the session holding table, and sending the encapsulated data packet to ER4.
Based on the same inventive concept, after introducing a routing system provided in the embodiment of the present application, a method for generating an entry of a session holding table applied to a CPE of the routing system provided in the embodiment of the present application is described below, where the method includes:
receiving a computational power routing table sent by the CPE controller, and receiving a first data message sent by User Equipment (UE), wherein the first data message comprises a destination address, a source address, a destination port and a source port;
determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
generating an address replacement relationship based on the destination address and the target BID;
generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computational routing entry.
In some possible embodiments, after receiving the computation routing table sent by the CPE controller and receiving the first data packet sent by the user equipment UE, the method further includes:
determining whether an address replacement relation corresponding to the destination address is inquired in the session holding table based on the destination address;
if the address replacement relation corresponding to the destination address is not inquired, determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation; replacing the destination address of the first data message by the target BID to obtain a second data message; and performing tunnel encapsulation processing on the second data message based on the entry to which the target BID belongs, and sending the encapsulated data message to a target Egress Router (ER), wherein the target ER is an ER corresponding to the entry to which the target BID belongs.
In some possible embodiments, after generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computationally intensive routing entry, the method further comprises:
replacing the destination address of the first data message by the target BID to obtain a second data message;
and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, the determining an optimal computational power routing entry in a computational power routing table sent from the CPE controller comprises:
determining a first calculation force routing entry which is occupied with the least calculation force in the calculation force routing table based on a calculation force optimization principle; determining a second computational power routing entry with the optimal network resources based on the path optimization principle;
weighting first target data in the first power calculation routing entry, and weighting second target data in the second power calculation routing entry to obtain an optimal power calculation routing entry, wherein the first target data are data corresponding to a power calculation column and data corresponding to a path column of the first power calculation routing entry in the power calculation routing table; the second target data is data corresponding to the calculated force column and data corresponding to the path column of the second calculated force routing entry in the calculated force routing table; the calculation force column is a column in which data representing the occupied calculation force are located in the calculation force routing table, and the path column is a column in which data representing network resources are located in the calculation force routing table.
In some possible embodiments, the tunneling the second data packet based on the entry to which the target BID belongs includes:
determining a corresponding packaging end node in the table entry to which the target BID belongs;
and performing tunnel encapsulation processing on the second data message based on the encapsulation ending node.
As shown in fig. 8, based on the same inventive concept, an entry generation apparatus 800 of a session holding table is proposed, the apparatus comprising:
a receiving module 8001, configured to receive a computation routing table sent by the CPE controller, and receive a first data packet sent by a user equipment UE, where the first data packet includes a destination address, a source address, a destination port, and a source port;
a BID determination module 8002, configured to determine an optimal computation power routing entry from a computation power routing table sent by the CPE controller, and use a binding address BID of the optimal computation power routing entry as a target BID;
a replacement relationship generation module 8003, configured to generate an address replacement relationship based on the destination address and the target BID;
a session holding table generating module 8004, configured to generate an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computation routing entry.
In some possible embodiments, after the session maintenance table generating module 8004 receives the computation routing table sent by the CPE controller and receives the first data packet sent by the user equipment UE, the session maintenance table generating module is further configured to:
determining whether an address replacement relation corresponding to the destination address is inquired in the session holding table based on the destination address;
if the address replacement relation corresponding to the destination address is not inquired, determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation; replacing the destination address of the first data message by the target BID to obtain a second data message; and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, the session holding table generating module 8004 is further configured to, after generating an entry in the session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computational routing entry:
replacing the destination address of the first data message by the target BID to obtain a second data message;
and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
In some possible embodiments, when the BID determination module 8002 determines the optimal computation power routing entry from the computation power routing table sent by the CPE controller, it is specifically configured to:
determining a first calculation force routing entry which occupies the least calculation force in the calculation force routing table based on a calculation force optimal principle; determining a second calculation force routing entry with optimal network resources based on a path optimization principle;
weighting first target data in the first power calculation routing entry, and weighting second target data in the second power calculation routing entry to obtain an optimal power calculation routing entry, wherein the first target data are data corresponding to a power calculation column and data corresponding to a path column of the first power calculation routing entry in the power calculation routing table; the second target data is data corresponding to the calculated force column and data corresponding to the path column of the second calculated force routing entry in the calculated force routing table; the calculation force column is a column in which data representing the occupied calculation force are located in the calculation force routing table, and the path column is a column in which data representing network resources are located in the calculation force routing table.
In some possible embodiments, when the session holding table generating module 8004 performs tunnel encapsulation processing on the second data packet based on the entry to which the target BID belongs, the session holding table generating module is specifically configured to:
determining a corresponding packaging end node in a table entry to which the target BID belongs;
and performing tunnel encapsulation processing on the second data message based on the encapsulation ending node.
Having described the routing system, the session holding table generation method, and the apparatus according to the exemplary embodiments of the present application, an electronic device according to another exemplary embodiment of the present application will be described next.
As will be appreciated by one skilled in the art, aspects of the present application may be embodied as a system, method or program product. Accordingly, various aspects of the present application may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
In some possible embodiments, an electronic device according to the present application may include at least one processor, and at least one memory. The memory stores program code, which, when executed by the processor, causes the processor to perform the steps of the routing system and the session holding table generating method according to various exemplary embodiments of the present application described above in this specification.
The electronic device 130 according to this embodiment of the present application is described below with reference to fig. 9. The electronic device 130 shown in fig. 9 is only an example, and should not bring any limitation to the functions and the application range of the embodiments of the present application.
As shown in fig. 9, the electronic device 130 is represented in the form of a general electronic device. The components of the electronic device 130 may include, but are not limited to: the at least one processor 131, the at least one memory 132, and a bus 133 that couples various system components including the memory 132 and the processor 131.
Bus 133 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a processor, or a local bus using any of a variety of bus architectures.
The memory 132 may include readable media in the form of volatile memory, such as Random Access Memory (RAM) 1321 and/or cache memory 1322, and may further include Read Only Memory (ROM) 1323.
Memory 132 may also include programs/utilities 1325 having a set (at least one) of program modules 1324, such program modules 1324 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 130 may also communicate with one or more external devices 134 (e.g., keyboard, pointing device, etc.), with one or more devices that enable a user to interact with the electronic device 130, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 130 to communicate with one or more other electronic devices. Such communication may occur via input/output (I/O) interfaces 135. Also, the electronic device 130 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 136. As shown, network adapter 136 communicates with other modules for electronic device 130 over bus 133. It should be understood that although not shown in FIG. 9, other hardware and/or software modules may be used in conjunction with electronic device 130, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
In some possible embodiments, the aspects of a routing system and a session holding table generation method provided by the present application may also be implemented in the form of a program product, which includes program code for causing a computer device to perform the steps of a routing system and a session holding table generation method according to various exemplary embodiments of the present application described above in this specification when the program product is run on the computer device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The program product for routing system and session holding table determination of embodiments of the present application may employ a portable compact disk read only memory (CD-ROM) and include program code, and may be executable on an electronic device. However, the program product of the present application is not so limited, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the consumer electronic device, partly on the consumer electronic device, as a stand-alone software package, partly on the consumer electronic device and partly on a remote electronic device, or entirely on the remote electronic device or server. In the case of remote electronic devices, the remote electronic devices may be connected to the consumer electronic device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external electronic device (e.g., through the internet using an internet service provider).
It should be noted that although in the above detailed description several units or sub-units of the apparatus are mentioned, such a division is merely exemplary and not mandatory. Indeed, the features and functions of two or more units described above may be embodied in one unit, according to embodiments of the application. Conversely, the features and functions of one unit described above may be further divided into embodiments by a plurality of units.
Further, while the operations of the methods of the present application are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims (13)

1. A routing system, comprising at least one ingress router, IR, a customer premises equipment, CPE, controller, CPE corresponding to each IR, wherein:
each said IR to send a computational routing table to said CPE controller; the calculation routing table comprises at least one calculation routing entry;
the CPE controller is used for receiving the calculation power routing tables sent by the IR and respectively sending the received calculation power routing tables to the corresponding CPE based on the preset corresponding relation between the IR and the CPE;
each CPE is used for receiving a calculation routing table sent by the CPE controller and receiving a first data message sent by User Equipment (UE), wherein the first data message comprises a destination address, a source address, a destination port and a source port; determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID; generating an address replacement relationship based on the destination address and the target BID; generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computational routing entry.
2. The system of claim 1, wherein after the CPE performs receiving the computation-force routing table sent by the CPE controller and receiving the first data packet sent by the UE, the CPE is further configured to:
determining whether an address replacement relation corresponding to the destination address is inquired in the session holding table based on the destination address;
if the address replacement relation corresponding to the destination address is not inquired, determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation; replacing the destination address of the first data message by the target BID to obtain a second data message; and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
3. The system of claim 1, wherein the CPE, after performing generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address substitution relationship, and the optimal computational routing entry, is further configured to:
replacing the destination address of the first data message by the target BID to obtain a second data message;
and performing tunnel encapsulation processing on the second data message based on the entry to which the target BID belongs, and sending the encapsulated data message to a target Egress Router (ER), wherein the target ER is an ER corresponding to the entry to which the target BID belongs.
4. The system according to any of claims 1 to 3, wherein the CPE is configured to, when determining the optimal computationally intensive routing entry from the computationally intensive routing table sent from the CPE controller:
determining a first calculation force routing entry which is occupied with the least calculation force in the calculation force routing table based on a calculation force optimization principle; determining a second computational power routing entry with the optimal network resources based on the path optimization principle;
weighting first target data in the first power calculation routing entry, and weighting second target data in the second power calculation routing entry to obtain an optimal power calculation routing entry, wherein the first target data are data corresponding to a power calculation column and data corresponding to a path column of the first power calculation routing entry in the power calculation routing table; the second target data is data corresponding to the calculated power column and data corresponding to the path column of the second calculated power routing entry in the calculated power routing table; the calculation power column is a column in which data representing the occupied calculation power is located in the calculation power routing table, and the path column is a column in which data representing network resources is located in the calculation power routing table.
5. The system according to any one of claims 2 to 3, wherein when the CPE performs tunnel encapsulation processing on the second data packet based on the entry to which the target BID belongs, the CPE is specifically configured to:
determining a corresponding packaging end node in the table entry to which the target BID belongs;
and performing tunnel encapsulation processing on the second data message based on the encapsulation ending node.
6. A method for generating entries of a session holding table, applied to a CPE in a routing system according to any one of claims 1 to 5, the method comprising:
receiving a computational routing table sent by the CPE controller, and receiving a first data message sent by User Equipment (UE), wherein the first data message comprises a destination address, a source address, a destination port and a source port;
determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
generating an address replacement relationship based on the destination address and the target BID;
generating an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computational routing entry.
7. The method of claim 6, wherein after receiving the computation force routing table sent by the CPE controller and receiving the first data packet sent by the user equipment UE, the method further comprises:
determining whether an address replacement relation corresponding to the destination address is inquired in the session holding table based on the destination address;
if the address replacement relation corresponding to the destination address is not inquired, determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking a binding address BID of the optimal computational power routing entry as a target BID;
if the address replacement relation corresponding to the destination address is inquired, inquiring a target BID corresponding to the destination address in the first data message in the session holding table according to the address replacement relation; replacing the destination address of the first data message by the target BID to obtain a second data message; and performing tunnel encapsulation processing on the second data message based on the entry to which the target BID belongs, and sending the encapsulated data message to a target Egress Router (ER), wherein the target ER is an ER corresponding to the entry to which the target BID belongs.
8. The method of claim 6, wherein after generating an entry in a session-holding table based on the destination address, the source address, the destination port, the source port, the address substitution relationship, and the optimal computationally-efficient routing entry, the method further comprises:
replacing the destination address of the first data message by the target BID to obtain a second data message;
and performing tunnel encapsulation processing on the second data message based on the table entry to which the target BID belongs, and sending the encapsulated data message to a target Exit Router (ER), wherein the target ER is the ER corresponding to the table entry to which the target BID belongs.
9. The method according to any of claims 6 to 8, wherein determining an optimal computationally intensive routing entry in the computationally intensive routing table sent from the CPE controller comprises:
determining a first calculation force routing entry which occupies the least calculation force in the calculation force routing table based on a calculation force optimal principle; determining a second calculation force routing entry with optimal network resources based on a path optimization principle;
weighting first target data in the first power calculation routing entry, and weighting second target data in the second power calculation routing entry to obtain an optimal power calculation routing entry, wherein the first target data are data corresponding to a power calculation column and data corresponding to a path column of the first power calculation routing entry in the power calculation routing table; the second target data is data corresponding to the calculated power column and data corresponding to the path column of the second calculated power routing entry in the calculated power routing table; the calculation force column is a column in which data representing the occupied calculation force are located in the calculation force routing table, and the path column is a column in which data representing network resources are located in the calculation force routing table.
10. The method according to any of claims 7 to 8, wherein said tunneling the second data packet based on the entry to which the target BID belongs comprises:
determining a corresponding packaging end node in a table entry to which the target BID belongs;
and performing tunnel encapsulation processing on the second data message based on the encapsulation ending node.
11. An entry generation apparatus of a session holding table, applied to the method according to claim 6, the apparatus comprising:
a receiving module, configured to receive a computation routing table sent by the CPE controller, and receive a first data packet sent by a user equipment UE, where the first data packet includes a destination address, a source address, a destination port, and a source port;
the BID determining module is used for determining an optimal computational power routing entry from a computational power routing table sent by the CPE controller, and taking the binding address BID of the optimal computational power routing entry as a target BID;
a replacement relationship generation module for generating an address replacement relationship based on the destination address and the target BID;
a session holding table generating module, configured to generate an entry in a session holding table based on the destination address, the source address, the destination port, the source port, the address replacement relationship, and the optimal computation force routing entry.
12. An electronic device comprising at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to implement the method of any one of claims 6 to 10.
13. A computer storage medium, characterized in that it stores a computer program for enabling a computer to perform the method according to any one of claims 6 to 10.
CN202211339274.4A 2022-10-28 2022-10-28 Routing system, table item generation method of session maintenance table and related device Pending CN115766557A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211339274.4A CN115766557A (en) 2022-10-28 2022-10-28 Routing system, table item generation method of session maintenance table and related device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211339274.4A CN115766557A (en) 2022-10-28 2022-10-28 Routing system, table item generation method of session maintenance table and related device

Publications (1)

Publication Number Publication Date
CN115766557A true CN115766557A (en) 2023-03-07

Family

ID=85354225

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211339274.4A Pending CN115766557A (en) 2022-10-28 2022-10-28 Routing system, table item generation method of session maintenance table and related device

Country Status (1)

Country Link
CN (1) CN115766557A (en)

Similar Documents

Publication Publication Date Title
CN110708393B (en) Method, device and system for transmitting data
CN111131037B (en) Data transmission method, device, medium and electronic equipment based on virtual gateway
US11847091B2 (en) Data transmission method and device for network on chip and electronic apparatus
CN114244906B (en) Data traffic distribution method, device, equipment and medium
CN113691589B (en) Message transmission method, device and system
CN113261249A (en) Data transmission method, related equipment and computer storage medium
CN111242776A (en) Accounting method and device based on block chain, storage medium and electronic equipment
CN113452778A (en) Session keeping method, device, equipment, system and storage medium
CN112243028A (en) Content distribution network data transmission method and device
CN114785851B (en) Resource call processing method and device, storage medium and electronic equipment
WO2015131380A1 (en) Data processing method and device
CN115766557A (en) Routing system, table item generation method of session maintenance table and related device
CN111988221B (en) Data transmission method, data transmission device, storage medium and electronic equipment
CN116418726A (en) Source route encoding method, data packet routing method, device, equipment and medium
CN115665026A (en) Cluster networking method and device
CN114979128A (en) Cross-region communication method and device and electronic equipment
CN113765972A (en) Data request response method, device, system, server and storage medium
CN114650271B (en) Global load DNS neighbor site learning method and device
CN115250254B (en) Netflow message distribution processing method and device
CN110764932A (en) Data processing method, system, medium and computing device
CN110389785B (en) Big data processing system and method, electronic equipment and storage medium
CN115277549B (en) Detection message generation method and device, storage medium and electronic equipment
CN113973086B (en) Data transmission method, device and storage medium
CN115277558B (en) Message sending method and device, computer storage medium and electronic equipment
CN113114565B (en) Data message forwarding method and device, storage medium and electronic equipment

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