CN114157598A - Message forwarding method, system, electronic equipment and storage medium - Google Patents
Message forwarding method, system, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114157598A CN114157598A CN202111521859.3A CN202111521859A CN114157598A CN 114157598 A CN114157598 A CN 114157598A CN 202111521859 A CN202111521859 A CN 202111521859A CN 114157598 A CN114157598 A CN 114157598A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- forwarding
- target
- subordinate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- 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/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/31—Flow control; Congestion control by tagging of packets, e.g. using discard eligibility [DE] bits
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application discloses a message forwarding method, a message forwarding system, electronic equipment and a storage medium. According to the technical scheme provided by the embodiment of the application, the first message sent by the superior node is received, and the first message is encapsulated by using a set protocol which is used for communicating with each subordinate node; forwarding the first message to a corresponding target subordinate node according to a routing field contained in the first message; and receiving a second message which is back-packaged by the target lower node according to the first message, decapsulating the second message by using a set protocol, forwarding the second message to the upper node, and executing the flow scheduling service of the target lower node according to the second message. By adopting the technical means, the distribution node receives the back packet of the subordinate node by setting the protocol so as to confirm the current message forwarding state and the running state of the target subordinate node, and the reliability and the stability of message forwarding can be improved. By executing the flow scheduling service, the flow scheduling effect of the system can be optimized, and the reliability and the stability of the forwarding of the system message are further improved.
Description
Technical Field
The embodiment of the application relates to the technical field of message distribution, in particular to a message forwarding method, a message forwarding system, electronic equipment and a storage medium.
Background
Currently, in a message distribution scenario, a message distribution node forwards a message of an upper node to a corresponding lower node for processing. In the process of forwarding the message, the distribution node cannot return the packet to the upper node, and the lower node cannot return the packet to the distribution node. The subordinate node can judge the source of the message according to the source field carried in the message, and then directly return the packet to the superior node, thereby completing one-time message processing.
However, when the above-described mode is used to distribute a message, the distribution node cannot confirm whether the message is delivered to the lower node or not, and cannot sense whether the lower node is abnormal, which results in low reliability of message delivery. When the lower node is overloaded or fails, the distribution node still forwards the message to the overloaded or failed node, so that the message is lost or delayed, and the service operation of the system is influenced.
Disclosure of Invention
The embodiment of the application provides a message forwarding method, a message forwarding system, an electronic device and a storage medium, which can improve the reliability of message forwarding and solve the technical problem of poor reliability of the existing message forwarding mode.
In a first aspect, an embodiment of the present application provides a message forwarding method, including:
receiving a first message sent by a superior node, and encapsulating the first message by using a set protocol, wherein the set protocol is used for communicating with each subordinate node so as to indicate the corresponding subordinate node to carry out repackaging on the first message;
forwarding the first message to a corresponding target subordinate node according to a routing field contained in the first message;
and receiving a second message which is back-packaged by the target lower node according to the first message, decapsulating the second message by using a set protocol, forwarding the second message to the upper node, and executing the flow scheduling service of the target lower node according to the second message.
In a second aspect, an embodiment of the present application provides a message forwarding system, including:
the encapsulation module is used for receiving a first message sent by a superior node, encapsulating the first message by using a set protocol, wherein the set protocol is used for communicating with each subordinate node so as to indicate the corresponding subordinate node to carry out repackaging on the first message;
the forwarding module is used for forwarding the first message to the corresponding target subordinate node according to the routing field contained in the first message;
and the receiving module is used for receiving a second message which is back-packaged by the target lower node according to the first message, decapsulating the second message by using a set protocol, forwarding the second message to the upper node, and executing the flow scheduling service of the target lower node according to the second message.
In a third aspect, an embodiment of the present application provides an electronic device, including:
a memory and one or more processors;
the memory for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the message forwarding method of the first aspect.
In a fourth aspect, embodiments of the present application provide a storage medium containing computer-executable instructions for performing the message forwarding method according to the first aspect when executed by a computer processor.
According to the method, the first message sent by the superior node is received, the first message is packaged by using the set protocol, and the set protocol is used for communicating with each subordinate node; forwarding the first message to a corresponding target subordinate node according to a routing field contained in the first message; and receiving a second message which is back-packaged by the target lower node according to the first message, decapsulating the second message by using a set protocol, forwarding the second message to the upper node, and executing the flow scheduling service of the target lower node according to the second message. By adopting the technical means, the distribution node receives the back packet of the subordinate node by setting the protocol so as to confirm the current message forwarding state and the running state of the target subordinate node, and the reliability and the stability of message forwarding can be improved. By executing the flow scheduling service, the flow scheduling effect of the system can be optimized, and the reliability and the stability of the forwarding of the system message are further improved.
Drawings
Fig. 1 is a flowchart of a message forwarding method according to an embodiment of the present application;
fig. 2 is a first message forwarding flowchart in an embodiment of the present application;
FIG. 3 is a schematic diagram of message forwarding based on a routing field according to an embodiment of the present application;
FIG. 4 is a diagram illustrating message forwarding and packet return according to an embodiment of the present application;
FIG. 5 is a schematic diagram illustrating message distribution corresponding to different user ID end numbers according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a message forwarding system according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device 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, specific embodiments of the present application will be described in detail with reference to the accompanying drawings. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be further noted that, for the convenience of description, only some but not all of the relevant portions of the present application are shown in the drawings. Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the operations (or steps) as a sequential process, many of the operations can be performed in parallel, concurrently or simultaneously. In addition, the order of the operations may be re-arranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, and the like.
The application provides a message forwarding method, which aims to indicate a corresponding subordinate node to carry out message repackaging by using a set protocol encapsulation message when a distribution node forwards a message of a superior node to a subordinate node. Therefore, the distribution node can acquire the running state and the message forwarding state of the subordinate node, and more accurate and stable message forwarding and flow scheduling are realized. Compared with the traditional message forwarding mode, after the message is forwarded to the subordinate node by the distribution node, the subordinate node can directly wrap the message back to the superior node, and the distribution node cannot confirm whether the message is sent to the subordinate node or not and cannot sense whether the subordinate node is abnormal or not. When the message forwarding state and the operation state of the lower node are unclear, it is difficult for the distribution node to perform accurate traffic scheduling. When the lower node is overloaded or fails, the distribution node still forwards the message to the overloaded or failed node, so that the message is lost or delayed, and the service operation of the system is influenced. Based on this, a message forwarding method according to the embodiment of the present application is provided to solve the technical problem that the reliability of the existing message forwarding mode is poor.
Example (b):
fig. 1 shows a flowchart of a message forwarding method provided in an embodiment of the present application, where the message forwarding method provided in this embodiment may be executed by a message forwarding device, and the message forwarding device may be implemented in a software and/or hardware manner, and the message forwarding device may be formed by two or more physical entities or may be formed by one physical entity. In general, the message forwarding device may be a network routing device, a message distribution server, or the like processing device that serves as a message distribution node.
The following description will be given taking the distribution node as an example of a main body that performs the message forwarding method. Referring to fig. 1, the message forwarding method specifically includes:
s110, receiving a first message sent by a superior node, and encapsulating the first message by using a set protocol, wherein the set protocol is used for communicating with each subordinate node so as to indicate the corresponding subordinate node to carry out back-packing on the first message.
When the message is forwarded, the message sent by the superior node is defined as the first message by receiving the message sent by the superior node in real time, and the message is processed and then forwarded to the corresponding subordinate node.
In processing the first message, the first message is encapsulated using a pre-set protocol. And adding a layer of encapsulation on the basis of the first message to change the first message into a protocol packet with a specific format and setting a specific file name of the protocol packet. The set protocol is used for the distribution node to communicate with each lower node, based on the communication protocol, the distribution node distributes messages to each lower node, and each lower node sends a packet message back to the distribution node based on the communication protocol so as to inform the distribution node of the receiving state of the first message and the current running state of the distribution node.
It is understood that each lower node may pre-configure the communication protocol, so as to decapsulate the received first message and obtain the message content of the first message for service processing. And after receiving the first message, performing a packet back on the first message, wherein the packet back message is encapsulated by using the communication protocol, and then is sent to the distribution node to inform the distribution node of the receiving state of the first message.
Different from a traditional asynchronous message forwarding mode, the embodiment of the application adopts a synchronous message forwarding mode, and after the distribution node forwards the first message based on the communication protocol, the distribution node can instruct the subordinate node to reply the receiving state of the first message and the running state of the subordinate node in time. After receiving the first message, the lower node may decapsulate the first message according to the specific file name of the first message using a predetermined communication protocol. And the first message is wrapped back to inform the distribution node of the current receiving state of the first message.
It should be noted that, when forwarding a message, a distribution node only needs to encapsulate a first message sent by a higher node, and does not need to analyze the content of the message or know the specific format of the message. Therefore, the message format conversion process in the message forwarding process is avoided, the workload of message forwarding is reduced, and the message forwarding efficiency is improved.
S120, forwarding the first message to the corresponding target lower node according to the routing field contained in the first message.
Further, based on the encapsulated first message, when the distribution node forwards the first message to the subordinate node, the distribution node may determine, according to a routing field included in the first message, a target subordinate node that receives the first message. Before that, the distribution node configures corresponding routing fields for each subordinate node in advance, constructs a mapping relation between the routing fields and the subordinate nodes, synchronizes the mapping relation to the superior node and the subordinate nodes, and each node can determine a processing node of the first message based on the mapping relation.
Specifically, referring to fig. 2, a forwarding process of a first message in the embodiment of the present application includes:
s1201, determining a routing field contained in the first message;
s1202, forwarding the first message to a corresponding target subordinate node according to the field range where the routing field is located, wherein the corresponding field range is configured in advance by the target subordinate node so as to indicate that the target subordinate node is responsible for processing the first message in the field range.
By pre-configuring the routing fields, the first message in each format can be processed by the corresponding lower node by specifying the routing fields (such as user ID, video ID, etc.). Taking the user ID as an example, each subordinate node is responsible for the first message processing of a corresponding number of user IDs. When a subsequent superior node processes a first message generated by a certain user ID, the user ID is added in the first message as a routing field. The distribution node can inquire the subordinate node which is responsible for the first message corresponding to the user ID according to the user ID, and the subordinate node is used as a target subordinate node. For example, referring to fig. 3, after the upper node issues message 1, the distribution node forwards message 1 to the computer room 1 responsible for message processing of user ID "123" for the first message processing according to user ID "123" contained in message 1, so as to complete message forwarding of the distribution node.
It will be appreciated that the routing fields are ordered according to field values, with each subordinate node being responsible for a field range formed by a corresponding number of field values. After receiving the first message, the distribution node analyzes the field value of the routing field, determines the field range of the field value, determines the subordinate node which is responsible for processing the first message of the field range as a target subordinate node, and then sends the first message to the target subordinate node.
Correspondingly, after receiving the first message, the target subordinate node may also determine whether the first message has a wrong forwarding condition by comparing the routing field included in the first message with the field range of the target subordinate node responsible for processing, and place the determination result in the packet returning message.
By routing a first message to a specific subordinate node according to a field value of a routing field in the first message, it is possible to route to the same subordinate node if the field values of the routing fields are the same for different messages. Therefore, the delay of data cross-node synchronization can be avoided, and the data consistency is ensured. Meanwhile, by modifying the message distribution node, the message distribution node forwards the first message according to the routing field, so that reasonable and accurate distribution and disaster tolerance of the flow can be realized, and the reliability of message forwarding is improved.
Optionally, based on the mapping relationship constructed in advance, when the superior node issues the first message, the superior node may also perform the subordinate node that processes the first message according to the current need of the superior node. And determining the routing field responsible for the lower node, and further adding the corresponding routing field in the first message. And the first message is sent to the distribution node. The distribution node may forward the first message to a desired subordinate node of the superordinate node for processing according to the routing field included in the first message.
After sending the first message, the distribution node corresponds to one end of the target subordinate node, if the first message is received, the packet returning logic of the first message is executed, and the corresponding packet returning message is returned to the distribution node. Defining the echo message as a second message, and the distribution node monitors the second message in a set monitoring period to execute a corresponding traffic scheduling service according to the second message.
Optionally, if the distribution node does not receive the reply packet message within the set listening period, it is determined that the current second message is received overtime. And under the condition that the second message reception is determined to be overtime, executing the traffic scheduling service of the target lower node or retransmitting the first message. The second message reception time-out indicates that the previously sent first message may be addressed to the target subordinate node, or that the target subordinate node has failed. The distributing node may then ensure that the target message node can receive the first message by retransmitting the first message to the target subordinate node. And if the second messages of the return packet are not received in the first messages forwarded for the set times, determining that the target subordinate node has a fault and needing to perform traffic scheduling service of the target subordinate node. Similarly, the distribution node may directly perform the traffic scheduling service of the target lower node when the first reception of the second message is overtime.
In the process of traffic scheduling under the condition of receiving and checking the second message, the distribution node needs to appoint the subordinate node again to reprocess the first message which is failed to be sent currently. And, for the destination subordinate node of the failure, the routing field range is processed according to the responsibility of the destination subordinate node, the routing field range is configured to other subordinate nodes, and other subordinate nodes are responsible for the first message corresponding to the routing field range. Therefore, the stability and reliability of system service processing are guaranteed, and the distribution processing effect of the system is optimized.
S130, receiving a second message of the target lower node according to the first message, decapsulating the second message by using a set protocol, forwarding the second message to the upper node, and executing the traffic scheduling service of the target lower node according to the second message.
Specifically, referring to fig. 4, after the message distribution node sends the first message to the target lower node, if the second message wrapped back by the target lower node is received within the set monitoring period, the second message needs to be decapsulated because the second message is encapsulated by using the set protocol. And finally, the second message is wrapped back to the superior node to inform the superior node of the receiving state of the first message, so that a primary message forwarding process of the distribution node is completed.
Illustratively, when the system generates a new message, the superordinate node will forward the received message to the distributing node. When receiving the message from the superior node, the distribution node adds a layer of encapsulation to the message, so that the message becomes a protocol packet with a specific format and uses a specific name, such as marshall. And then forwarding the protocol packet to the target lower node, and waiting for the return packet of the target lower node. After receiving the protocol packet, the target subordinate node decapsulates the protocol packet to obtain the original message. After the service logic processing is completed, a corresponding back packet message is generated, and then the back packet message is encapsulated into a protocol packet and is sent to the distribution node. After receiving the protocol packet of the return packet, the distribution node decapsulates the obtained return packet message and forwards the return packet message to the upper node. And after the upper node receives the packet return message, completing a message forwarding processing flow.
In the whole message forwarding process, the distribution node can confirm whether the message is sent to the target subordinate node or not through the back packet of the target subordinate node, so that the reliable transmission of the message is realized. In addition, the distribution node can also sense whether the target subordinate node is abnormal or not by judging whether the packet is overtime or not, whether the error code is normal or not and the like. When a certain target subordinate node is overloaded or fails, the distribution node can transfer the flow to other healthy subordinate nodes, so that the normal operation of the overall service of the system is ensured, and the disaster tolerance capability of the business service is improved.
And the distribution node performs flow scheduling on the target subordinate node according to the message receiving state of the target subordinate node and the running state of the target subordinate node provided in the second message. Referring to fig. 5, the user ID end number is taken as an example of the message routing field. Corresponding subordinate nodes machine room 1, machine room 2 and machine room 3 are responsible for messages with ID end numbers 00-33,34-66 and 67-99 routing field ranges, respectively. Under normal conditions, the distribution node forwards the first message corresponding to the ID tail number to the corresponding lower node for processing according to the routing field range. When the flow scheduling is needed, the field range responsible for the lower node is adjusted to realize the stability and reliability of the message forwarding processing.
Specifically, if the distribution node determines that the target subordinate node is overloaded based on the second message, the field range corresponding to the target subordinate node is narrowed, and the routing field of the specified segment in the field range is allocated to the other subordinate nodes. For example, in fig. 5, it is determined that the machine room 3 is overloaded based on the second message, at this time, the field range for which the machine room 3 is responsible needs to be narrowed, the ID end number range "67-99" originally responsible is adjusted to "67-88", and the partial ID end numbers "89-99" are adjusted to the machine room 2 with idle computing resources, and then the machine room 2 is responsible for message processing of the ID end numbers "34-66" and 89-99 "at this time.
And if the distribution node determines that the target subordinate node has a fault based on the second message, allocating the first message of the field range corresponding to the target subordinate node to other subordinate nodes so as to indicate the other subordinate nodes to process the first message in the field range. For example, in fig. 5, it is determined that the room 3 is faulty based on the second message, and at this time, the field range for which the room 3 is responsible, i.e., the D-tail number range "67-99" needs to be allocated to the room 1 and/or the room 2, so as to process the message of the ID-tail number "67-99" through the room 1 and/or the room 2.
Optionally, the backup routing node of the first message is determined from the remaining subordinate nodes based on the backup routing information by extracting the backup routing information included in the first message, and the first message is sent to the backup routing node. Before that, an alternate routing node of each field value message is previously designated, and when a lower node of a corresponding routing field fails, the message can be processed through the alternate routing node. For example, when the machine room 3 fails, the standby routing node of the message with the ID tail number of "67-88" part is determined to be machine room 1, and then the message is forwarded to the machine room 1 for processing. And determining that the standby routing node of the message with the ID tail number of the part 89-99 is the machine room 2, and forwarding the message to the machine room 2 for processing.
In addition, the distribution node determines the computing resource state of the target subordinate node based on the second message, and expands the field range corresponding to the target subordinate node according to the computing resource state. It can be understood that, for a subordinate node with idle computing resources, the field ranges responsible for the rest nodes with larger loads can be scheduled to the current target subordinate node, so as to expand the field range corresponding to the target subordinate node, to achieve full utilization of the computing resources of the target subordinate node, and at the same time, to reduce the load pressure of other nodes, and to optimize the stability and processing efficiency of message processing.
According to the range of the routing field, the routing field range of each computer room is configured. The routing field range is divided according to the user ID tail number, wherein the user ID tail number 00-33 is divided into the machine room 1, the user ID tail number 34-66 is divided into the machine room 2, the routing field range 67-99 is divided into the machine room 3, so that the flow of the machine room can be accurately controlled, when the capacity of a certain machine room changes, the flow of the machine room can be adjusted by configuring the range of the user ID tail number, and the overload or low load of the machine room is avoided.
Optionally, the distribution node may further shield the flow of the designated machine room by one key, and when machine room flow scheduling is required due to a machine room-level fault, the fault machine room can be isolated quickly, the flow of the fault machine room is transferred to a standby machine room, and disaster recovery is completed.
By changing unreliable asynchronous messages into reliable synchronous messages for transmission under the condition of not changing the format of the inlet messages, the link distribution node can timely sense the message processing state and abnormal conditions of the downstream nodes, thereby isolating the fault nodes and improving the stability of service processing. Meanwhile, the distribution node has traffic routing scheduling capability, can accurately control traffic distribution, and further improves the stability and reliability of service processing.
The first message is encapsulated by using a set protocol by receiving the first message sent by the superior node, wherein the set protocol is used for communicating with each subordinate node; forwarding the first message to a corresponding target subordinate node according to a routing field contained in the first message; and receiving a second message which is back-packaged by the target lower node according to the first message, decapsulating the second message by using a set protocol, forwarding the second message to the upper node, and executing the flow scheduling service of the target lower node according to the second message. By adopting the technical means, the distribution node receives the back packet of the subordinate node by setting the protocol so as to confirm the current message forwarding state and the running state of the target subordinate node, and the reliability and the stability of message forwarding can be improved. By executing the flow scheduling service, the flow scheduling effect of the system can be optimized, and the reliability and the stability of the forwarding of the system message are further improved.
On the basis of the foregoing embodiment, fig. 6 is a schematic structural diagram of a message forwarding system provided in the present application. Referring to fig. 6, the message forwarding system provided in this embodiment specifically includes: an encapsulation module 21, a forwarding module 22 and a receiving module 23.
The encapsulation module 21 is configured to receive a first message sent by a higher node, encapsulate the first message using a set protocol, where the set protocol is used to communicate with each lower node to indicate that the corresponding lower node performs repackaging on the first message;
the forwarding module 22 is configured to forward the first message to the corresponding target subordinate node according to the routing field included in the first message;
the receiving module 23 is configured to receive a second message that is back-packaged by the target lower node according to the first message, decapsulate the second message using a set protocol, forward the second message to the upper node, and execute a traffic scheduling service of the target lower node according to the second message.
Specifically, the forwarding module 22 is specifically configured to determine a routing field included in the first message; and forwarding the first message to the corresponding target subordinate node according to the field range where the routing field is located, wherein the target subordinate node is preconfigured with the corresponding field range so as to indicate that the target subordinate node is responsible for processing the first message in the field range.
And executing the traffic scheduling service of the target lower node or retransmitting the first message under the condition that the second message is determined to be received overtime.
The receiving module 23 is specifically configured to:
determining that the target subordinate node is overloaded based on the second message, reducing a field range corresponding to the target subordinate node, and allocating a routing field of a specified section in the field range to other subordinate nodes;
determining a fault of the target subordinate node based on the second message, and allocating a first message of a field range corresponding to the target subordinate node to other subordinate nodes to indicate the other subordinate nodes to process the first message in the field range; extracting the standby routing information contained in the first message, determining a standby routing node of the first message from the rest of lower nodes based on the standby routing information, and sending the first message to the standby routing node;
and determining the computing resource state of the target subordinate node based on the second message, and expanding the field range corresponding to the target subordinate node according to the computing resource state.
The first message is encapsulated by using a set protocol by receiving the first message sent by the superior node, wherein the set protocol is used for communicating with each subordinate node; forwarding the first message to a corresponding target subordinate node according to a routing field contained in the first message; and receiving a second message which is back-packaged by the target lower node according to the first message, decapsulating the second message by using a set protocol, forwarding the second message to the upper node, and executing the flow scheduling service of the target lower node according to the second message. By adopting the technical means, the distribution node receives the back packet of the subordinate node by setting the protocol so as to confirm the current message forwarding state and the running state of the target subordinate node, and the reliability and the stability of message forwarding can be improved. By executing the flow scheduling service, the flow scheduling effect of the system can be optimized, and the reliability and the stability of the forwarding of the system message are further improved.
The message forwarding system provided by the embodiment of the application can be used for executing the message forwarding method provided by the embodiment, and has corresponding functions and beneficial effects.
On the basis of the above practical example, an embodiment of the present application further provides an electronic device, with reference to fig. 7, the electronic device includes: the device comprises a processor, a memory, a communication module, an input device and an output device. The memory, which is a computer-readable storage medium, may be used to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the message forwarding methods described in any of the embodiments of the present application (e.g., encapsulation module, forwarding module, and receiving module in a message forwarding system). The communication module is used for data transmission. The processor executes various functional applications of the device and data processing by executing software programs, instructions and modules stored in the memory, that is, implements the message forwarding method described above. The input device may be used to receive input numeric or character information and to generate key signal inputs relating to user settings and function controls of the apparatus. The output device may include a display device such as a display screen. The electronic device provided by the above can be used to execute the message forwarding method provided by the above embodiment, and has corresponding functions and beneficial effects.
On the basis of the above embodiments, the present application also provides a storage medium containing computer-executable instructions for performing a message forwarding method when executed by a computer processor, and the storage medium may be any of various types of memory devices or storage devices. Of course, the storage medium provided in the embodiments of the present application and containing computer-executable instructions is not limited to the message forwarding method described above, and may also perform related operations in the message forwarding method provided in any embodiment of the present application.
The foregoing is considered as illustrative of the preferred embodiments of the invention and the technical principles employed. The present application is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present application has been described in more detail with reference to the above embodiments, the present application is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present application, and the scope of the present application is determined by the scope of the claims.
Claims (10)
1. A message forwarding method, comprising:
receiving a first message sent by a superior node, and encapsulating the first message by using a set protocol, wherein the set protocol is used for communicating with each subordinate node so as to indicate the corresponding subordinate node to carry out repackaging on the first message;
forwarding the first message to a corresponding target subordinate node according to a routing field contained in the first message;
receiving a second message, which is back-packaged by the target lower node according to the first message, decapsulating the second message by using the set protocol, forwarding the second message to the upper node, and executing a traffic scheduling service of the target lower node according to the second message.
2. The message forwarding method according to claim 1, wherein the forwarding the first message to the corresponding target subordinate node according to the routing field included in the first message comprises:
determining a routing field contained in the first message;
forwarding the first message to a corresponding target subordinate node according to a field range in which the routing field is located, the target subordinate node pre-configuring the corresponding field range to indicate that the target subordinate node is responsible for processing the first message within the field range.
3. The message forwarding method according to claim 2, wherein the performing the traffic scheduling service of the target subordinate node according to the second message comprises:
determining that the target subordinate node is overloaded based on the second message, narrowing the field range corresponding to the target subordinate node, and allocating the routing field of the specified segment in the field range to other subordinate nodes.
4. The message forwarding method according to claim 2, wherein the performing the traffic scheduling service of the target subordinate node according to the second message further comprises:
determining that the target subordinate node is faulty based on the second message, and dispatching the first message of the field range corresponding to the target subordinate node to the remaining subordinate nodes to instruct the remaining subordinate nodes to process the first message within the field range.
5. The message forwarding method according to claim 3, wherein the field range corresponding to the target subordinate node is allocated to the remaining subordinate nodes, and the field range comprises:
and extracting standby routing information contained in the first message, determining a standby routing node of the first message from other subordinate nodes based on the standby routing information, and sending the first message to the standby routing node.
6. The message forwarding method according to claim 2, wherein the performing the traffic scheduling service of the target subordinate node according to the second message further comprises:
determining a computing resource state of the target subordinate node based on the second message, and expanding the field range corresponding to the target subordinate node according to the computing resource state.
7. The message forwarding method according to claim 2, wherein after forwarding the first message to the corresponding target subordinate node, further comprising:
and under the condition that the second message reception is determined to be overtime, executing the traffic scheduling service of the target lower node or retransmitting the first message.
8. A message forwarding system, comprising:
the device comprises an encapsulation module, a sending module and a sending module, wherein the encapsulation module is used for receiving a first message sent by a superior node and encapsulating the first message by using a set protocol, and the set protocol is used for communicating with each subordinate node so as to indicate the corresponding subordinate node to carry out repackaging on the first message;
a forwarding module, configured to forward the first message to a corresponding target subordinate node according to a routing field included in the first message;
a receiving module, configured to receive a second message that is back-packaged by the target lower node according to the first message, decapsulate the second message using the set protocol, forward the second message to the upper node, and execute a traffic scheduling service of the target lower node according to the second message.
9. An electronic device, comprising:
a memory and one or more processors;
the memory for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the message forwarding method of any of claims 1-7.
10. A storage medium containing computer-executable instructions for performing the message forwarding method of any one of claims 1-7 when executed by a computer processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111521859.3A CN114157598B (en) | 2021-12-13 | 2021-12-13 | Message forwarding method, system, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111521859.3A CN114157598B (en) | 2021-12-13 | 2021-12-13 | Message forwarding method, system, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114157598A true CN114157598A (en) | 2022-03-08 |
| CN114157598B CN114157598B (en) | 2023-04-07 |
Family
ID=80450588
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111521859.3A Active CN114157598B (en) | 2021-12-13 | 2021-12-13 | Message forwarding method, system, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114157598B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1719912A (en) * | 2004-07-09 | 2006-01-11 | 华为技术有限公司 | Method for processing push notification in multimedia message service |
| US20070008955A1 (en) * | 2005-07-08 | 2007-01-11 | Tekelec | Methods, systems, and computer program products for triggering SIP nodes to include SS7 routing information in response messages including information requested by SS7 nodes |
| US20070226168A1 (en) * | 2001-09-29 | 2007-09-27 | Anil Mukundan | Computing system and method for automatic completion of pick field |
| JP2009038511A (en) * | 2007-07-31 | 2009-02-19 | Panasonic Corp | Routing method, and node device |
| CN103415059A (en) * | 2013-08-26 | 2013-11-27 | 宇龙计算机通信科技(深圳)有限公司 | Terminals and mobile communication method |
| WO2015184687A1 (en) * | 2014-06-05 | 2015-12-10 | 中兴通讯股份有限公司 | Packet transmission method, node, path management server and storage medium |
| CN112165430A (en) * | 2020-09-24 | 2021-01-01 | 北京百度网讯科技有限公司 | Data routing method, device, equipment and storage medium |
-
2021
- 2021-12-13 CN CN202111521859.3A patent/CN114157598B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070226168A1 (en) * | 2001-09-29 | 2007-09-27 | Anil Mukundan | Computing system and method for automatic completion of pick field |
| CN1719912A (en) * | 2004-07-09 | 2006-01-11 | 华为技术有限公司 | Method for processing push notification in multimedia message service |
| US20070008955A1 (en) * | 2005-07-08 | 2007-01-11 | Tekelec | Methods, systems, and computer program products for triggering SIP nodes to include SS7 routing information in response messages including information requested by SS7 nodes |
| JP2009038511A (en) * | 2007-07-31 | 2009-02-19 | Panasonic Corp | Routing method, and node device |
| CN103415059A (en) * | 2013-08-26 | 2013-11-27 | 宇龙计算机通信科技(深圳)有限公司 | Terminals and mobile communication method |
| WO2015184687A1 (en) * | 2014-06-05 | 2015-12-10 | 中兴通讯股份有限公司 | Packet transmission method, node, path management server and storage medium |
| CN112165430A (en) * | 2020-09-24 | 2021-01-01 | 北京百度网讯科技有限公司 | Data routing method, device, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 冯涛;郭显;马建峰;李兴华;: "可证明安全的节点不相交多路径源路由协议" * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114157598B (en) | 2023-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11689606B2 (en) | Communication method, system and apparatus | |
| CN103312528B (en) | A kind of heartbeat message sending method and user terminal | |
| CN104184756A (en) | Data synchronization method, device and system | |
| JP6008761B2 (en) | Independent distributed network system | |
| CN104852828A (en) | Network delay detection method, device and system | |
| CN113746733A (en) | Table item synchronization method, gateway equipment, networking system and storage medium | |
| CN114157598B (en) | Message forwarding method, system, electronic equipment and storage medium | |
| CN113259408A (en) | Data transmission method and system | |
| CN116055426B (en) | Method, equipment and medium for traffic offload forwarding in multi-binding mode | |
| CN116032880A (en) | System, method, electronic equipment and storage medium for session synchronization | |
| WO2022083281A1 (en) | Message transmission method and system, electronic device, and storage medium | |
| CN112398913B (en) | Service scheduling method and system | |
| CN107872479B (en) | Cloud management platform and controller integration method and system and related modules | |
| KR20120128031A (en) | System and method for providing push service | |
| CN111953786A (en) | System, method and device for recording messages in whole network, network equipment and storage medium | |
| CN111416852A (en) | Method for session synchronization among multiple load balancers and load balancer | |
| WO2018120960A1 (en) | Proxy-based service processing method, device, and network element device | |
| CN115913809B (en) | Data distribution communication method, system, computer device and storage medium | |
| CN113411266B (en) | Cloud data transmission method and system based on isolation device, terminal and storage medium | |
| CN114979037B (en) | Multicast method, device, switch and storage medium | |
| CN114285889B (en) | Processing method, device and equipment for configuration information of application service | |
| CN114095342B (en) | Backup realization method and device | |
| US20230208544A1 (en) | Method, apparatus, and system for processing time synchronization fault and storage medium | |
| US20230171830A1 (en) | Apparatus and method for configuring data communication between robot components in different networks | |
| WO2006057349A1 (en) | Management system, device for use in the system, program therefor, and management method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |