Message forwarding method and device, storage medium and electronic equipment

Abstract

Embodiments of the present application provide a message forwarding method and device, a storage medium and an electronic device. The method comprises: in the case of obtaining a to-be-forwarded message, searching for an entry label of the to-be-forwarded message from a current label forwarding table corresponding to a current time slice or a current topology; in the case of not searching for the entry label from the current label forwarding table, searching for the entry label from a target label forwarding table corresponding to a target time slice or a target topology; and in the case of searching for the entry label from the target time slice, forwarding the to-be-forwarded message according to an exit label corresponding to the entry label in the target label forwarding table. Through the present application, the problem of message forwarding failure is solved, and the effect of improving the message forwarding efficiency is achieved.

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of communications, and more specifically, to a message forwarding method, apparatus, storage medium, and electronic device. Background Technology

[0002] In existing technologies, satellite routing and forwarding processes are subject to frequent topology changes. Therefore, a packet received by a node within a certain time period may be dropped by the next node because the time slot has been adjusted to the next time period. Consequently, the corresponding label may not be found at the next node, preventing forwarding. Summary of the Invention

[0003] This invention provides a message forwarding method, apparatus, storage medium, and electronic device to at least solve the problem of message forwarding failure in related technologies.

[0004] According to an embodiment of the present invention, a message forwarding method is provided, comprising: when a message to be forwarded is obtained, searching for an incoming label of the message to be forwarded from a current label forwarding table corresponding to the current time slice or the current topology; if the incoming label is not found in the current label forwarding table, searching for the incoming label from a target label forwarding table corresponding to the target time slice or the target topology; if the incoming label is found in the target time slice, forwarding the message to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table.

[0005] According to another embodiment of the present invention, a message forwarding apparatus is provided, comprising: a first lookup unit, configured to look up an incoming label of the message to be forwarded from a current label forwarding table corresponding to the current time slice or the current topology when a message to be forwarded is obtained; a second lookup unit, configured to look up an incoming label from a target label forwarding table corresponding to a target time slice or a target topology when no incoming label is found in the current label forwarding table; and a forwarding unit, configured to forward the message to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table when an incoming label is found in the target time slice.

[0006] According to yet another embodiment of the present invention, a computer-readable storage medium is also provided, wherein a computer program is stored in the computer program, and the computer program is configured to perform the steps in any of the above method embodiments when it is run.

[0007] According to yet another embodiment of the present invention, an electronic device is also provided, including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

[0008] By means of this invention, when a packet to be forwarded is obtained, if the incoming label of the packet to be forwarded cannot be found in the current label forwarding table corresponding to the current time slice or the current topology, the incoming label of the packet to be forwarded will be found in the target label forwarding table of the target time slice or the target topology, and the packet will be forwarded. The incoming packet will not be directly discarded. Therefore, the problem of packet forwarding failure can be solved, and the effect of improving packet forwarding efficiency can be achieved. Attached Figure Description

[0009] Figure 1 This is a hardware environment diagram of a message forwarding method according to an embodiment of the present invention;

[0010] Figure 2 This is a flowchart of a message forwarding method according to an embodiment of the present invention;

[0011] Figure 3 This is a schematic diagram of a tag for a message forwarding method according to an embodiment of the present invention;

[0012] Figure 4 This is a flowchart of a message forwarding method according to an embodiment of the present invention;

[0013] Figure 5 This is a flowchart of a message forwarding method according to an embodiment of the present invention;

[0014] Figure 6 This is a mapping diagram of the message forwarding method according to an embodiment of the present invention;

[0015] Figure 7 This is a topology diagram of a message forwarding method according to an embodiment of the present invention;

[0016] Figure 8 This is a topology diagram of a message forwarding method according to an embodiment of the present invention;

[0017] Figure 9 This is a topology diagram of a message forwarding method according to an embodiment of the present invention;

[0018] Figure 10 This is a topology diagram of a message forwarding method according to an embodiment of the present invention;

[0019] Figure 11 This is a structural block diagram of a message forwarding device according to an embodiment of the present invention. Detailed Implementation

[0020] The embodiments of the present invention will be described in detail below with reference to the accompanying drawings and examples.

[0021] It should be noted that the terms "first," "second," etc., in the specification, claims, and drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0022] The methods and embodiments provided in this application can be executed on a mobile terminal, computer terminal, or similar computing device. Taking running on a mobile terminal as an example, Figure 1 This is a hardware structure block diagram of a mobile terminal for a message forwarding method according to an embodiment of the present invention. Figure 1 As shown, a mobile terminal may include one or more ( Figure 1 Only one is shown in the diagram. A processor 102 (which may include, but is not limited to, a microprocessor MCU or a programmable logic device FPGA, etc.) and a memory 104 for storing data are also shown. The mobile terminal may further include a transmission device 106 for communication functions and an input / output device 108. Those skilled in the art will understand that... Figure 1 The structure shown is for illustrative purposes only and does not limit the structure of the mobile terminal described above. For example, the mobile terminal may also include components that are more... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown.

[0023] The memory 104 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the message forwarding method in this embodiment of the invention. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, thereby implementing the above-described method. The memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor 102, and these remote memories can be connected to the mobile terminal via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0024] The transmission device 106 is used to receive or send data via a network. Specific examples of the network described above may include a wireless network provided by the mobile terminal's communication provider. In one example, the transmission device 106 includes a Network Interface Controller (NIC), which can connect to other network devices via a base station to communicate with the Internet. In another example, the transmission device 106 may be a Radio Frequency (RF) module, used for wireless communication with the Internet.

[0025] This embodiment provides a message forwarding method. Figure 2 This is a flowchart of a message forwarding method according to an embodiment of the present invention, such as... Figure 2 As shown, the process includes the following steps:

[0026] Step S202: If a packet to be forwarded is obtained, search for the ingress label of the packet to be forwarded in the current label forwarding table corresponding to the current time slice or the current topology.

[0027] Step S204: If the incoming label is not found in the current label forwarding table, search for the incoming label in the target label forwarding table corresponding to the target time slice or the target topology.

[0028] Step S206: If the incoming label is found from the target time slice, forward the packet to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table.

[0029] Optionally, in this embodiment, when a packet to be forwarded is obtained, the incoming label of the packet can be first searched in the current label forwarding table corresponding to the current time slot or the current topology. If the incoming label is found, the packet can be forwarded according to the outgoing label corresponding to the incoming label in the current label forwarding table. If the incoming label of the packet cannot be found in the current label forwarding table, it indicates that the time slot has changed. In this case, the incoming label can be searched in the target label forwarding table corresponding to other time slots, i.e., the target time slot or the target topology, and the packet can be forwarded according to the outgoing label corresponding to the incoming label. This avoids the situation where packets are dropped due to time slot changes.

[0030] As an optional example, the method may also include the following before retrieving the message to be forwarded:

[0031] Calculate the topology path corresponding to each time slice, where there is a mapping relationship between each time slice, and each time slice corresponds to a topology path;

[0032] The label forwarding path corresponding to each time slice is obtained based on the topology path.

[0033] In this embodiment, a corresponding topology path can be calculated for each time slice. Based on the topology path, the label forwarding path for each time slice is obtained. The calculated topology paths for different time slices may be the same or different. The previous and next nodes of each node are determined based on the topology path, thus determining the label forwarding path.

[0034] As an optional example, when a packet to be forwarded is obtained, the incoming label of the packet to be forwarded is looked up in the current label forwarding table corresponding to the current time slice, including:

[0035] Parse the target tag of the message to be forwarded;

[0036] Based on the target label of the message to be forwarded, determine whether the message to be forwarded is a regular message or a satellite message;

[0037] If the message to be forwarded is a satellite message, the tag is retrieved from the current tag forwarding table.

[0038] Optionally, in this embodiment, a target tag can be added to the message to be forwarded to identify whether the message is a normal message or a satellite message. If the target tag identifies the message to be forwarded as a satellite message, then the ingress tag of the message to be forwarded is searched. The target tag can be a different string that identifies whether the message to be forwarded is a normal message or a satellite message.

[0039] As an optional example, the method may also include the following before parsing the target label of the message to be forwarded:

[0040] When parsing the message to be forwarded to obtain the first message, it is determined that the message to be forwarded includes the target label, wherein the first message may, but is not limited to, be located before the target label, and the first message may, but is not limited to, be 15;

[0041] If the first message is not obtained after parsing the message to be forwarded, it is determined that the message to be forwarded does not include the target label.

[0042] Optionally, in this embodiment, a first message can be used to identify whether the message to be forwarded includes a target tag. The first tag can be a tag with low identification time or low identification resource consumption. By identifying the first tag, it can be quickly determined whether the message to be forwarded includes the target tag. If the target tag is not included, it means that the message to be forwarded is not a normal message or a satellite message, and therefore the message to be forwarded is not forwarded.

[0043] As an optional example, if the incoming label is not found in the current label forwarding table, searching for the incoming label in the target label forwarding table corresponding to the target time slice includes:

[0044] If the target time slice is not found, wait for M-1 time periods, where each time period is a time slice, and M is the number of time slices in one cycle;

[0045] After waiting for M-1 time periods, locate the target time slice;

[0046] If the target time slice is found, the inbound label is retrieved from the target label forwarding table;

[0047] If the target time slice is not found, the forwarding of pending messages will be terminated.

[0048] In this embodiment, M represents the number of time slices in a cycle. For example, a cycle has 5 time slices, and each time slice corresponds to a tag forwarding table. If no incoming tag for a packet to be forwarded is found in a certain time slice, the process waits for M-1 time periods until the tag forwarding tables for the other time slices are determined. At this point, the incoming tag can be found from these tables.

[0049] This application relates to an integrated air-space-ground network architecture. This architecture is one of the core directions of 6G and is listed as one of the seven key network requirements by the International Telecommunication Union (ITU). The 6G integrated air-space-ground network architecture will be based on terrestrial cellular mobile networks, combined with the wide coverage, flexible deployment, and efficient broadcasting characteristics of broadband satellite communications. Through the deep integration of various heterogeneous networks, it will achieve full coverage across land, sea, and air, bringing new opportunities to markets such as maritime, airborne, transnational, and space-ground convergence. The integrated air-space-ground network consists of interconnected space-based information networks, terrestrial internet, and mobile communication networks.

[0050] Space-based information networks consist of a series of high, medium, and low Earth orbit satellites, utilizing inter-satellite data links for inter-satellite communication. This application can be applied to integrated space-air-ground networks, particularly to routers / switches in low Earth orbit satellite constellations with inter-satellite links. In this application, after the discrete topology is partitioned based on a time-slot algorithm (each time slot is a time slice), the controller calculates the topology path within each time slice, generating label forwarding paths (MPLS, SR-MPLS) for each topology. This application defines a new type of satellite label, which adds a time-slot attribute (or topology attribute) to the ordinary label format. Through the time-slot identifier ID / topology identifier ID within the label, it can be determined from which time slice / topology the label stream originated. Figure 2 As shown, satellite tags have a total of 5 fields:

[0051] Topology ID: 8 bits, identifies the discrete topology and is also the time slice ID. This 8-bit value is a suggested value and can be customized based on the time slice size.

[0052] Tag value: 12 bits, identifying the tag number within the current topology.

[0053] EXP: 3 bits, which can support Quality of Service (QoS).

[0054] S: Stack bottom identifier. MPLS supports multi-level tags, i.e., tag nesting. When S is 1, it indicates the bottom-level tag.

[0055] TTL: 8 bits, used to indicate the maximum number of network segments an IP packet is allowed to pass through before being dropped by a router.

[0056] When a satellite receives a tag message, it needs to distinguish whether the tag (target tag) in the message is a regular tag or a satellite tag. Therefore, a special tag (first tag) needs to be added before the satellite tag, for example, the tag value can be 15; this tag has the same format as the regular tag, and is used to instruct the satellite to recognize that it is a special satellite tag when processing the tag message. Figure 3 This is a schematic diagram.

[0057] Figure 4 , 5 This is a flowchart of this embodiment.

[0058] The controller maps the tag forwarding tables in each time slice (corresponding to the discrete topology) pairwise, that is, it maps tag 2001 in time slice T2 to tags in time slices T1, T3, ..., Tn one-to-one, such as... Figure 6 This is a mapping table between time slices T2 and T1. 02:2000 represents the incoming label assigned by the satellite packet forwarding device in time slice T2. When a packet carrying the label 01:510 originating from the source node in time slice T1 arrives at the satellite, the conventional approach is to directly look up the label forwarding table for the current time slice (T2). If the label is not found, the packet is discarded; otherwise, an incorrect outgoing label is found, causing the packet to be transmitted to the wrong satellite network node, ultimately leading to uncontrollable security issues. In this application, the time slice attribute in the label header is checked to determine if the packet's departure time from the source node belongs to the current time slice. If it does, the label forwarding table for the current time slice is looked up directly; otherwise, the topology mapping table for time slice T2 is checked to find the corresponding outgoing label for subsequent forwarding. If the corresponding outgoing tag information is not found, this application also proposes a retention strategy. Based on a pre-defined retention time strategy, such as a time period M, where M = N satellite cycles or N satellite time slices (M>=0, N>=0), the time slice ID1 of the message is used to search the mapping table for the existence of that time slice. The corresponding time slice ID2 is then found. If ID2<=M, the process waits for M-1 cycles. By this time, the satellite has already reached the Mth cycle, and the time slice ID2 can be found based on the message's time slice ID1. If the corresponding ID2 in the time slice cannot be found, forwarding is terminated.

[0059] Let's take the example of packets arriving within the same time slice to illustrate the MPLS label forwarding process on a satellite. No network topology switch occurs during the entire packet forwarding process. For example... Figure 7 As shown.

[0060] (1) The message data starts from satellite router R1 and is sent to the destination address satellite D. Before the message is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite.

[0061] (2) Therefore, when the service traffic is imported into satellite R1, after finding that the destination is satellite D, the modified label 01:510 is added to the message (the time slice of satellite R1 is T1 at this time), and a special satellite label 15 is added to the top of the label stack and sent to the next hop satellite R2.

[0062] (3) After receiving the tag message, satellite R2 first checks the top tag of the stack and finds that it is 15. It then knows that the subsequent tag is a satellite tag. After stripping tag number 15, it searches for the next satellite tag and finds that it belongs to time slice T1.

[0063] (4) Search the label forwarding table on R2, find the corresponding outgoing label is 01:520, swap the labels and then add a special label 15, and continue to send to the next hop satellite node R3;

[0064] (5) After receiving the R3, repeat the operation (4), exchange it for tag 01:540, add a special tag 15, and send it to the destination satellite D;

[0065] (6) When the D satellite receives the message, it finds that the message destination is itself and the forwarding ends.

[0066] The modified MPLS label forwarding process is illustrated using the example of inconsistent time slices after packet arrival. A network topology switch occurs during the hop-by-hop forwarding of packets from the source node to the destination node. For example... Figure 8 As shown.

[0067] (1) The message data starts from satellite router R1 and is sent to the destination address satellite D. Before the message is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite.

[0068] (2) Therefore, when the service traffic is imported into satellite R1, after finding that the destination is satellite D, the modified label 01:510 is added to the message (the time slice of satellite R1 is T1 at this time), and a special satellite label 15 is added to the top of the label stack and sent to the next hop satellite R2.

[0069] (3) When the message arrives at satellite R2, the top stack label is checked first and found to be 15. This indicates that the subsequent label is a satellite label. After stripping label 15, the next satellite label is searched and found to be T1. At this time, R2's time slice switches to T2. The mapping table needs to be searched, rather than the label forwarding table of R2 in the T2 time slice. It is found that 01:510 corresponds to 02:2001 in the T2 time slice. The labels are swapped and then the special label 15 is added. The message continues to be sent to the next hop R5.

[0070] (4) After receiving the message, satellite R5 repeats the action in (3) and sends it to the next hop satellite D;

[0071] (5) Satellite D receives the message, discovers that the message destination is itself, and the forwarding ends.

[0072] Examples for SR-MPLS tag types. For example... Figure 9 As shown,

[0073] (1) The data packet is sent from satellite router R1 to the destination satellite D. Before the packet is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite.

[0074] (2) Therefore, when the service traffic is imported into satellite R1, after finding that the destination is satellite D, it finds that it can go through the path list (15, 01:1010, 01:1020, 01:1030), after adding the tagged list to the IP header, it is sent to the next hop satellite R2.

[0075] (3) After receiving the tag message, satellite R2 first checks the top tag of the stack and finds that it is 15. It then knows that the subsequent tag is a satellite tag and finds that the next satellite tag is T1.

[0076] (4) Look up the label forwarding table on R2, find the corresponding outgoing interface and next hop, pop the label and continue to send it to the next hop satellite node R3;

[0077] (5) After receiving the data, R3 repeats the operation in (4), pops up the tag 01:1020, and sends it to the destination satellite D;

[0078] (6) When the D satellite receives the message, it finds that the message destination is itself and the forwarding ends.

[0079] The modified SR-MPLS label forwarding process is illustrated using the example of inconsistent time slices after packet arrival. A network topology switch occurs during the hop-by-hop forwarding of packets from the source node to the destination node. For example... Figure 10 As shown.

[0080] (1) The message data starts from satellite router R1 and is sent to the destination address satellite D. Before the message is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite.

[0081] (2) Therefore, when the service traffic is imported into satellite R1, after finding that the destination is satellite D, it finds that it can follow the path list (15,01:1010,01:1020,01:1030), after adding the tagged list to the IP header, it is sent to the next hop satellite R2.

[0082] (3) After receiving the tag message, satellite R2 first checks the top tag of the stack and finds that it is 15. It then knows that the subsequent tag is a satellite tag and finds that the next satellite tag is T1.

[0083] (4) At this time, R2's time slice has switched to T2. Look up the time slice ID in the packet label and find that it is T1 time slice. At this time, it is necessary to look up the mapping table, instead of looking up R2's label forwarding table in T2 time slice. It is found that 01:1010 corresponds to (15, 02:2020, 02:2030) in T2 time slice. At this time, a label swapping action is required. After the label swapping, continue to send to the next hop R5.

[0084] (5) After receiving the data, R3 repeats the operation in (4), pops up the label 02:2020, and sends it to the destination satellite D;

[0085] (6) When the D satellite receives the message, it pops up the tags 15 and 02:2030, finds that the message destination is itself, and the forwarding ends.

[0086] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods according to the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods of the various embodiments of the present invention.

[0087] This embodiment also provides a message forwarding device for implementing the above embodiments and preferred embodiments; details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that performs a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0088] Figure 11 This is a structural block diagram of a message forwarding device according to an embodiment of the present invention, such as... Figure 11 As shown, the device includes:

[0089] The first lookup unit 1102 is used to look up the ingress label of the packet to be forwarded from the current label forwarding table corresponding to the current time slice or the current topology when a packet to be forwarded is obtained.

[0090] The second lookup unit 1104 is used to look up the incoming label from the target label forwarding table corresponding to the target time slice or the target topology when the incoming label is not found in the current label forwarding table.

[0091] Forwarding unit 1106 is used to forward the message to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table when the incoming label is found from the target time slice.

[0092] For other examples of this embodiment, please refer to the examples above, which will not be repeated here.

[0093] It should be noted that the above modules can be implemented by software or hardware. For the latter, they can be implemented in the following ways, but are not limited to: all the above modules are located in the same processor; or, the above modules are located in different processors in any combination.

[0094] Embodiments of the present invention also provide a computer-readable storage medium storing a computer program, wherein the computer program is configured to perform the steps in any of the above method embodiments when executed.

[0095] In one exemplary embodiment, the aforementioned computer-readable storage medium may include, but is not limited to, various media capable of storing computer programs, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard disk, magnetic disk, or optical disk.

[0096] Embodiments of the present invention also provide an electronic device including a memory and a processor, the memory storing a computer program and the processor being configured to run the computer program to perform the steps in any of the above method embodiments.

[0097] In one exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor and the input / output device is connected to the processor.

[0098] Specific examples in this embodiment can be found in the examples described in the above embodiments and exemplary implementations, and will not be repeated here.

[0099] It is obvious to those skilled in the art that the modules or steps of the present invention described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. They can be implemented using computer-executable program code, and thus can be stored in a storage device for execution by a computing device. In some cases, the steps shown or described can be performed in a different order than those described herein, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, the present invention is not limited to any particular combination of hardware and software.

[0100] The above are merely preferred embodiments of the present invention and are not intended to limit the present invention. For those skilled in the art, the present invention can have various modifications and variations. Any modifications, equivalent substitutions, improvements, etc., made within the principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A message forwarding method, characterized in that, include: If a message to be forwarded is obtained, the incoming label of the message to be forwarded is searched in the current label forwarding table corresponding to the current time slice. If the incoming label is not found in the current label forwarding table, search for the incoming label in the target label forwarding table corresponding to the target time slice. If the incoming label is found from the target time slice, the packet to be forwarded is forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table. Before obtaining the message to be forwarded, the method also includes: Calculate the topology path corresponding to each time slice, where there is a mapping relationship between each time slice, and each time slice corresponds to a topology path; The label forwarding path corresponding to each time slice is obtained based on the topology path.

2. The method according to claim 1, characterized in that, Upon obtaining a packet to be forwarded, the incoming label of the packet to be forwarded is retrieved from the current label forwarding table corresponding to the current time slice. This includes: Parse the target tag of the message to be forwarded; Based on the target label of the message to be forwarded, determine whether the message to be forwarded is a regular message or a satellite message; If the message to be forwarded is a satellite message, the tag is retrieved from the current tag forwarding table.

3. The method according to claim 2, characterized in that, Before parsing the target label of the message to be forwarded, the method also includes: If the first message is obtained by parsing the message to be forwarded, it is determined that the message to be forwarded includes the target label; If the first message is not obtained after parsing the message to be forwarded, it is determined that the message to be forwarded does not include the target label.

4. The method according to claim 1, characterized in that, If the incoming label is not found in the current label forwarding table, the incoming label can be searched in the target label forwarding table corresponding to the target time slice, including: If the target time slice is not found, wait for M-1 time periods, where each time period is a time slice, and M is the number of time slices in one cycle; After waiting for M-1 time periods, locate the target time slice; If the target time slice is found, the inbound label is retrieved from the target label forwarding table; If the target time slice is not found, the forwarding of pending messages will be terminated.

5. A message forwarding device, characterized in that, include: The first lookup unit is used to look up the ingress label of the packet to be forwarded from the current label forwarding table corresponding to the current time slice when a packet to be forwarded is obtained. The second lookup unit is used to look up the incoming label from the target label forwarding table corresponding to the target time slice when the incoming label is not found in the current label forwarding table. The forwarding unit is used to forward the message to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table when the incoming label is found from the target time slice. The device further includes: The calculation unit is used to calculate the topology path corresponding to each time slice before obtaining the packet to be forwarded. There is a mapping relationship between each time slice, and each time slice corresponds to a topology path. The determination unit is used to obtain the label forwarding path corresponding to each time slice based on the topology path.

6. The apparatus according to claim 5, characterized in that, The first search unit includes: The parsing module is used to parse the target label of the message to be forwarded; The first determining module is used to determine whether the message to be forwarded is a regular message or a satellite message based on the target label of the message to be forwarded. The lookup module is used to find the tag in the current tag forwarding table when the message to be forwarded is a satellite message.

7. The apparatus according to claim 6, characterized in that, The first search unit also includes: The second determining module is used to determine that the message to be forwarded includes a target label before parsing the target label of the message to be forwarded, provided that the first message is obtained by parsing the message to be forwarded. The third determination module is used to determine that the message to be forwarded does not include the target label if the first message is not obtained after parsing the message to be forwarded.

8. The apparatus according to claim 5, characterized in that, The second search unit includes: The processing module is used to wait for M-1 time periods if the target time slice is not found, where each time period is a time slice and M is the number of time slices in a cycle; after waiting for M-1 time periods, it searches for the target time slice; if the target time slice is found, it searches for the incoming label from the target label forwarding table; if the target time slice is not found, it terminates the forwarding of the packets to be forwarded.

9. A computer-readable storage medium, characterized in that, A computer-readable storage medium stores a computer program, wherein when executed by a processor, the computer program implements the steps of the method of any one of claims 1 to 4.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, The steps of the method of any one of claims 1 to 4 are implemented when the processor executes a computer program.

Images