Message transmission method and device, electronic equipment and medium
By sending and receiving bitmaps between the source and destination nodes, the status of candidate logical paths is estimated, which solves the problems of data flow continuity and service availability in tunneling technology during network failures, and realizes fast path switching and low-overhead data transmission.
Patent Information
- Application Number
- CN202411188037.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-27
- Publication Date
- 2024-11-05
AI Technical Summary
Existing tunneling technologies cannot detect and react to network failures in a timely manner, resulting in poor data flow continuity and service availability. Bare tunnels are encapsulated with stateless processing, while multipath transmission protocols encapsulate large computational and storage overheads.
By sending and receiving bitmaps between the source and destination nodes, comparing the sending and receiving states, and predicting the state of candidate logical paths, fast path switching is achieved by avoiding placing packets on potentially faulty paths.
It improves data flow continuity and business availability, reduces computing and storage overhead, quickly detects and switches to non-faulty paths, and reduces data packet loss and business interruption.
Smart Images

Figure CN118900247A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of data communication, and in particular to a message transmission method, device, electronic equipment and medium. Background Art
[0002] Tunneling is a technology for transmitting data between networks. The message data transmitted using tunneling can be data frames or packets using different transmission protocols. In the process of transmitting message data, the sender uses tunneling technology to encapsulate the data message of one network protocol in another network protocol. After receiving the message data, the receiver decouples the original data message and the encapsulated packet header. Tunneling technology can realize communication between different networks.
[0003] The most widely used tunnel technologies at present include bare tunnel encapsulation and multi-path transport protocol encapsulation. Bare tunnel encapsulation is only a stateless tunnel encapsulation of message data. When a network failure occurs, it cannot sense and respond to the failure in the network. Failures can only be solved by retransmission. Therefore, data flow continuity and service availability are poor. Multi-path transport protocol encapsulation guarantees the reliable transmission of data messages by referencing the complete transport protocol, but since the complete transport protocol is referenced, it will bring huge computing and storage overheads. Summary of the invention
[0004] The embodiments of the present disclosure provide a message transmission method, device, electronic device and medium, which can improve data flow continuity and service availability in message transmission while maintaining low computing overhead and storage overhead.
[0005] According to one aspect of the present disclosure, a message transmission method is provided, which is applied to a source node. The message transmission method includes:
[0006] Determining an initial logical path among a plurality of candidate logical paths to a destination node based on addressing information of the target message;
[0007] Acquire a sending bitmap of the source node, where the sending bitmap indicates a message sending status of the source node for each of the candidate logical paths;
[0008] Sending a reception status request to the destination node, and receiving a reception bitmap of the destination node, wherein the reception bitmap indicates a message reception status of the destination node for each of the candidate logical paths;
[0009] Determining the path status of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap;
[0010] If the path status of the initial logical path is faulty, a non-faulty target logical path is determined from among the multiple candidate logical paths, and the target message is transferred to the target logical path.
[0011] According to one aspect of the present disclosure, a message transmission method is provided, which is applied to a destination node. The message transmission method includes:
[0012] In the current cycle, receiving a receiving state request sent by the source node through the candidate logical path;
[0013] Saving a current bitmap to be processed as a reception bitmap of a previous cycle of the current cycle, wherein a plurality of bits of the current bitmap to be processed respectively correspond to a plurality of candidate logical paths, and the current bitmap to be processed is used to indicate the candidate logical path for which the reception status request has been received;
[0014] Reset each bit in the current to-be-processed bitmap to a first value, and set the bit in the current to-be-processed bitmap corresponding to the candidate logical path that has received the receive status request to a second value;
[0015] The receiving bitmap of the previous cycle is sent to the source node, so that the source node determines the path status of each candidate logical path based on the receiving bitmap of the previous cycle and the sending bitmap, and determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0016] According to one aspect of the present disclosure, a message transmission method is provided, which is applied to a source node. The message transmission method includes:
[0017] Determining an initial logical path among a plurality of candidate logical paths to a destination node based on addressing information of the target message;
[0018] Acquire a sending bitmap of the source node, where the sending bitmap indicates a message sending status of the source node for each of the candidate logical paths;
[0019] Sending the sending bitmap to the destination node so that the destination node determines the path status of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap of the destination node;
[0020] receiving the path status of each of the candidate logical paths returned by the destination node;
[0021] If the path status of the initial logical path is faulty, a non-faulty target logical path is determined from the multiple candidate logical paths, and the target message is transferred from the initial logical path to the target logical path for transmission.
[0022] According to one aspect of the present disclosure, a message transmission method is provided, which is applied to a destination node. The message transmission method includes:
[0023] receiving a sending bitmap sent by a source node, wherein the sending bitmap indicates a message sending status of the source node for each candidate logical path to the destination node;
[0024] Acquire a reception bitmap of the destination node, wherein the reception bitmap indicates a message reception status of the destination node for each of the candidate logical paths;
[0025] Determine the path status of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap;
[0026] The path status of each of the candidate logical paths is sent to the source node, so that the source node determines a target logical path for sending a target message based on the path status of each of the candidate logical paths.
[0027] According to one aspect of the present disclosure, there is provided a message transmission device, which is arranged in a source node, and the message transmission device includes:
[0028] a first determining unit, configured to determine an initial logical path among a plurality of candidate logical paths to a destination node based on addressing information of a target message;
[0029] A first acquisition unit, configured to acquire a sending bitmap of the source node, wherein the sending bitmap indicates a message sending status of the source node for each of the candidate logical paths;
[0030] a first sending unit, configured to send a receiving status request to the destination node, and receive a receiving bitmap of the destination node, wherein the receiving bitmap indicates a message receiving status of the destination node for each of the candidate logical paths;
[0031] A first comparing unit, configured to determine a path state of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap;
[0032] The first transfer unit is configured to determine a non-faulty target logical path from among the multiple candidate logical paths and transfer the target message to the target logical path if the path status of the initial logical path is faulty.
[0033] Optionally, the addressing information is quintuple information of the target message;
[0034] The first determining unit is specifically configured to:
[0035] Performing a hash operation on the five-tuple information to obtain a target hash value;
[0036] Performing a modulo operation on the target hash value and the number of the plurality of candidate logical paths to obtain a target remainder;
[0037] Based on the target remainder, the initial logic path is determined among the plurality of candidate logic paths.
[0038] Optionally, the first determining unit is specifically configured to:
[0039] Assigning an index to each of the candidate logical paths;
[0040] Arranging the indexes of the candidate logical paths into an index group, and repeating the index group a third number of times to obtain an original index queue;
[0041] In the original index queue, an index at the rank of the target remainder is selected as an initial index, and the candidate logical path corresponding to the initial index is determined to be the initial logical path.
[0042] Optionally, the first determining unit is specifically configured to:
[0043] Obtaining a hash algorithm for the hash operation;
[0044] Determining a maximum hash value generated by the hash algorithm;
[0045] Obtaining the storage space size of the source node;
[0046] Obtaining the computing capacity of the source node;
[0047] The third number is determined based on the maximum hash value, the storage space size, and the computing power.
[0048] Optionally, the first determining unit is specifically configured to:
[0049] Obtaining a transmission flow per unit time in a target tunnel from the source node to the destination node;
[0050] Obtaining a path failure rate of the target tunnel;
[0051] Obtaining an average transmission flow variance in the target tunnel;
[0052] The number of the plurality of candidate logical paths is determined based on the transmission flow per unit time, the path failure rate, and the average transmission flow variance.
[0053] Optionally, the first determining unit is specifically configured to:
[0054] Determining the expected transmission flow per unit time of the target tunnel based on the transmission flow per unit time and the path failure rate;
[0055] Determining a target adjustment coefficient based on the average transmission flow variance;
[0056] The number of the plurality of candidate logical paths is determined based on the expected transmission flow per unit time and the target adjustment coefficient.
[0057] Optionally, the sending bitmap and the receiving bitmap are generated periodically;
[0058] The first acquisition unit is specifically used to: acquire, in a current cycle, a sending bitmap of the source node in a previous cycle;
[0059] The first sending unit is specifically used to: send the receiving status request to the destination node in the current cycle, and receive the receiving bitmap of the destination node in the previous cycle.
[0060] Optionally, the first acquiring unit is specifically configured to:
[0061] Initializing each bit of the sending bitmap to a first value, the number of bits of the sending bitmap being equal to the number of the plurality of candidate logical paths;
[0062] If the source node sends the receiving status request on the candidate logical path in the previous cycle, the bit corresponding to the candidate logical path is set to a second value.
[0063] Optionally, the first sending unit is specifically configured to:
[0064] adding the receive status request to a first tunnel encapsulation field of a first data message, and sending the first data message to the destination node;
[0065] A second data packet sent by the destination node is received, wherein a second tunnel encapsulation field of the second data packet carries the reception bitmap of the destination node in a previous cycle.
[0066] Optionally, the first tunnel encapsulation field includes a first tag field and a reception status request field, the second tunnel encapsulation field includes a second tag field, a reception status response field and a reception bitmap field, the first tag field indicates that the first data message carries the reception status request, and the second tag field indicates that the second data message carries the reception status response;
[0067] The first sending unit is specifically configured to: set the first tag field in the first tunnel encapsulation field; add the receiving status request to the receiving status request field in the first tunnel encapsulation field, and send the first data message to the destination node;
[0068] The second data message is generated by: setting the second tag field in the second tunnel encapsulation field; adding the reception status response to the reception status response field in the second tunnel encapsulation field; and adding the reception bitmap to the reception bitmap field in the second tunnel encapsulation field.
[0069] Optionally, adding the receive bitmap to the receive bitmap field in the second tunnel encapsulation field includes: initializing each bit of the receive bitmap to a first value, the number of bits of the receive bitmap being equal to the number of the multiple candidate logical paths; if in the previous cycle, the destination node receives the first data packet with the receive status request added to the first tunnel encapsulation field on the candidate logical path, setting the bit corresponding to the candidate logical path to a second value; and adding the receive bitmap to the receive bitmap field in the second tunnel encapsulation field.
[0070] Optionally, the first sending unit is specifically used to: obtain a first number of forward data messages sent by the source node through the candidate logical path in the current cycle; add the receiving status request to the first tunnel encapsulation field of the first number of forward data messages to generate the first data message; and send the first data message to the destination node;
[0071] The second data message is generated in the following manner: obtaining the first number of reverse data messages sent by the destination node through the candidate logical path in the current period; adding the receiving bitmap to the second tunnel encapsulation field of the first number of reverse data messages to generate the second data message.
[0072] Optionally, the first sending unit is specifically configured to:
[0073] Obtaining an average number of the forward data messages sent within a second number of cycles before the current cycle;
[0074] Obtaining an average packet loss rate of the forward data messages sent in a second number of cycles before the current cycle;
[0075] Obtaining the message type of the first forward data message to be sent in the current cycle;
[0076] Determining a message sending priority based on the message type;
[0077] The first number is determined based on the average number, the average packet loss rate and the message sending priority.
[0078] Optionally, the first sending unit is specifically configured to: send the first data message corresponding to the candidate logical path to the destination node through each of the candidate logical paths;
[0079] The first sending unit is specifically configured to: if a data packet carrying the receiving bitmap is received from any candidate logical path among the multiple candidate logical paths, use the data packet as the received second data packet.
[0080] Optionally, the first comparing unit is specifically configured to:
[0081] If a bit corresponding to a candidate logical path in the sending bitmap is a second value, and a bit corresponding to the candidate logical path in the receiving bitmap is a second value, determining that the path state of the candidate logical path is normal;
[0082] If a bit corresponding to a candidate logical path in the sending bitmap is a second value, but a bit corresponding to the candidate logical path in the receiving bitmap is a first value, determining that the path state of the candidate logical path is a fault;
[0083] If the bit corresponding to a candidate logical path in the sending bitmap is the first value, it is determined that the path state of the candidate logical path is inactive.
[0084] Optionally, the sending bitmap and the receiving bitmap are sent periodically;
[0085] The first comparison unit is specifically used for:
[0086] If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in the multiple consecutive cycles are all the first value, it is determined that the path state of the candidate logical path is faulty.
[0087] Optionally, the first comparing unit is specifically configured to:
[0088] Removing the first cycle and the last cycle of the plurality of consecutive cycles to obtain a plurality of intermediate cycles;
[0089] If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive intermediate cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in multiple consecutive intermediate cycles are all the first value, it is determined that the path state of the candidate logical path is faulty.
[0090] Optionally, the first transfer unit is specifically used for:
[0091] If the path status of the initial logical path is faulty, searching for the first index of the initial logical path in the original index queue;
[0092] According to the order of the non-faulty candidate logical paths among the multiple candidate logical paths, the first index is replaced with the second index of the non-faulty candidate logical path, so that the original index queue becomes a target index queue;
[0093] In the target index queue, an index at the rank of the target remainder is selected as the target index, and the candidate logical path corresponding to the target index is determined to be the target logical path.
[0094] Optionally, the message transmission device further includes a switching unit, and the switching unit is specifically configured to:
[0095] Determining failure recovery of the initial logical path;
[0096] If the target message has not been sent in the target logical path, the target message is switched back to the initial logical path for sending.
[0097] Optionally, the switching unit is specifically used to:
[0098] Sending a probe request to the destination node at predetermined intervals;
[0099] receiving reception status information of the destination node on the initial logical path, the reception status information being sent by the destination node in response to the probe request;
[0100] Based on the reception status information, the initial logical path failure recovery is determined.
[0101] Optionally, if the destination node receives the probe request, the reception status information is a second value;
[0102] The switching unit is specifically configured to: determine that the initial logical path failure is recovered if a predetermined number of the receiving status information received continuously are all the second value.
[0103] Optionally, the switching unit is specifically used to:
[0104] If the target message has not been sent in the target logical path, obtaining an initial position of the first index of the initial logical path in the original index queue;
[0105] Replacing the index of the initial position in the target index queue with the first index of the initial logical path to obtain an updated index queue;
[0106] In the updated target index queue, an index at the rank of the target remainder is selected as the updated index, and the target message waiting to be sent on the target logical path is sent on the initial logical path corresponding to the updated index.
[0107] Optionally, the message transmission device further includes a replacement unit, and the replacement unit is specifically configured to:
[0108] For each non-faulty candidate logical path, obtaining the index number corresponding to the candidate logical path in the updated index queue;
[0109] Determining an average value of the index numbers of each non-faulty candidate logic path;
[0110] determining a difference between the average value and the index number of the candidate logic path;
[0111] In the updated index queue, the other indexes other than the first index are replaced with the first index of the initial logical path.
[0112] According to one aspect of the present disclosure, there is provided a message transmission device, which is arranged in a destination node, and the message transmission device includes:
[0113] A first receiving unit, configured to receive a receiving state request sent by a source node through a candidate logical path in a current cycle;
[0114] A first saving unit, configured to save a current to-be-processed bitmap as a receiving bitmap of a previous cycle of the current cycle, wherein a plurality of bits of the current to-be-processed bitmap respectively correspond to a plurality of candidate logical paths, and the current to-be-processed bitmap is used to indicate the candidate logical path for which the receiving status request is received;
[0115] A first resetting unit, configured to reset each bit in the current to-be-processed bitmap to a first value, and to set a bit in the current to-be-processed bitmap corresponding to the candidate logical path that has received the receiving status request to a second value;
[0116] A second sending unit is used to send the receiving bitmap of the previous cycle to the source node, so that the source node determines the path status of each candidate logical path based on the receiving bitmap of the previous cycle and the sending bitmap, and determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0117] According to one aspect of the present disclosure, there is provided a message transmission device, which is arranged in a source node, and the message transmission device includes:
[0118] a second determining unit, configured to determine an initial logical path among a plurality of candidate logical paths to a destination node based on the addressing information of the target message;
[0119] A second acquisition unit, configured to acquire a sending bitmap of the source node, wherein the sending bitmap indicates a message sending status of the source node for each of the candidate logical paths;
[0120] A third sending unit, configured to send the sending bitmap to the destination node, so that the destination node determines the path status of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap of the destination node;
[0121] A second receiving unit, configured to receive the path status of each of the candidate logical paths returned by the destination node;
[0122] The second transfer unit is configured to determine a non-faulty target logical path from among the multiple candidate logical paths if the path state of the initial logical path is faulty, and transfer the target message from the initial logical path to the target logical path for transmission.
[0123] According to one aspect of the present disclosure, there is provided a message transmission device, which is arranged in a destination node, and the message transmission device includes:
[0124] a third receiving unit, configured to receive a sending bitmap sent by a source node, wherein the sending bitmap indicates a message sending status of the source node for each candidate logical path to the destination node;
[0125] A third acquisition unit, configured to acquire a reception bitmap of the destination node, wherein the reception bitmap indicates a message reception status of the destination node for each of the candidate logical paths;
[0126] a third determining unit, configured to determine a path state of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap;
[0127] The fourth sending unit is used to send the path status of each candidate logical path to the source node, so that the source node determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0128] In the disclosed embodiment, unlike bare tunnel encapsulation, which can only solve the fault through post-transmission, a reception status request is sent to the destination node, a reception bitmap sent by the destination node is received, and the transmission bitmap of the source node is compared with the reception bitmap of the destination node to avoid placing the target message in a logical path that may have a fault in advance. Since the transmission bitmap indicates the message transmission status of the source node for each candidate logical path, and the reception bitmap indicates the message reception status of the destination node for each candidate logical path, the path status of each candidate logical path can be obtained by comparing the transmission bitmap with the reception bitmap, so that when the initial logical path assigned to the target message fails, a non-faulty target logical path is assigned to the target message. This method avoids sending the target message in a faulty candidate logical path by accurately estimating which candidate logical paths may be faulty in advance, which greatly improves data flow continuity and service availability compared to the solution of only retransmitting afterwards. This solution only needs to add a receive status request or a receive bitmap in a small number of data messages to be implemented. The transmission and storage overhead is low, and the processing of comparing the send bitmap and the receive bitmap is simple and the computational overhead is low. Therefore, while maintaining a small computational overhead and storage overhead, the data flow continuity and service availability in message transmission are improved.
[0129] Other features and advantages of the present disclosure will be described in the following description, and partly become apparent from the description, or understood by practicing the present disclosure. The purpose and other advantages of the present disclosure can be realized and obtained by the structures particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0130] The accompanying drawings are used to provide further understanding of the technical solution of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the technical solution of the present disclosure and do not constitute a limitation on the technical solution of the present disclosure.
[0131] Figure 1A-Figure 1C is a system architecture diagram of a system to which the message transmission method according to an embodiment of the present disclosure is applied;
[0132] Figure 2 is a schematic diagram of a software form of a message transmission method according to an embodiment of the present disclosure;
[0133] Figure 3 is a schematic diagram of the topology of a data center network to which the message transmission method according to an embodiment of the present disclosure is applied;
[0134] Figure 4 It is an overall flow chart of a message transmission method for determining the path status of each candidate logical path by a source node according to an embodiment of the present disclosure, applied to a source node side;
[0135] Figure 5 is a schematic diagram of a method for transmitting a message executed by a source node according to an embodiment of the present disclosure;
[0136] Figure 6 is a schematic diagram of a target message according to an embodiment of the present disclosure;
[0137] Figure 7 is a schematic diagram of determining an initial logical path based on addressing information of a target message according to an embodiment of the present disclosure;
[0138] Figure 8 is a schematic diagram of determining the message reception status of each candidate logical path based on comparison of a sending bitmap and a receiving bitmap according to an embodiment of the present disclosure;
[0139] Fig. 9 is a schematic diagram of a source node sending a reception status request to a destination node and receiving a reception bitmap of the destination node according to an embodiment of the present disclosure;
[0140] Fig.10 is a schematic diagram of determining a non-faulty target logic path among a plurality of candidate logic paths according to an embodiment of the present disclosure;
[0141] Figure 11A-11B is a schematic diagram comparing a message transmission method according to an embodiment of the present disclosure and an existing message transmission method;
[0142] Fig.12 is a flow chart for determining an initial logic path according to an embodiment of the present disclosure;
[0143] Fig.13 is a schematic diagram of five-tuple information of a target message according to an embodiment of the present disclosure;
[0144] Fig.14 is a schematic diagram of determining an initial logic path according to an embodiment of the present disclosure;
[0145] Fig.15 is a schematic diagram of multiple candidate logic paths according to an embodiment of the present disclosure;
[0146] Fig.16 is a flowchart of determining a candidate logical path corresponding to an initial index as an initial logical path according to an embodiment of the present disclosure;
[0147] Fig.17 is a schematic diagram of obtaining an original index queue by repeating the index group a third number of times according to an embodiment of the present disclosure;
[0148] Fig.18 is a flowchart of determining a third number according to an embodiment of the present disclosure;
[0149] Fig.19 is a flowchart of determining the number of multiple candidate logic paths according to an embodiment of the present disclosure;
[0150] Fig. 20 is a flow chart of determining the number of multiple candidate logical paths based on the transmission flow per unit time, the path failure rate, and the average transmission flow variance according to an embodiment of the present disclosure;
[0151] Fig.21 is a flowchart of obtaining a transmission bitmap of a source node, sending a reception status request to a destination node, and receiving a reception bitmap of the destination node according to an embodiment of the present disclosure;
[0152] Fig. 22 It is a schematic diagram of a source node sending a reception status request to a destination node in a current cycle and receiving a reception bitmap of a previous cycle of the destination node according to an embodiment of the present disclosure;
[0153] Fig.23 is a flowchart of acquiring a sending bitmap of a source node in a previous cycle in a current cycle according to an embodiment of the present disclosure;
[0154] Fig.24 It is a schematic diagram of obtaining a sending bitmap of a source node in a previous cycle in a current cycle according to an embodiment of the present disclosure;
[0155] Fig.25 is a flowchart of sending a reception status request to a destination node in a current cycle and receiving a reception bitmap of a previous cycle of the destination node according to an embodiment of the present disclosure;
[0156] Fig.26 is a schematic diagram of adding a reception status request to a first tunnel encapsulation field of a first data message according to an embodiment of the present disclosure;
[0157] Fig. 27 is a schematic diagram of a reception bitmap of a previous cycle of a destination node carried in a second tunnel encapsulation field of a second data packet according to an embodiment of the present disclosure;
[0158] Fig.28 is a flow chart of sending a first data message to a destination node and generating a second data message according to an embodiment of the present disclosure;
[0159] Fig.29 is a schematic diagram showing that a first tunnel encapsulation field includes a first tag field and a reception status request field according to an embodiment of the present disclosure;
[0160] Fig.30 is a schematic diagram showing that the second tunnel encapsulation field according to an embodiment of the present disclosure includes a second tag field, a reception status response field and a reception bitmap field;
[0161] Fig.31 is a flow chart of adding a receive bitmap to a receive bitmap field in a second tunnel encapsulation field according to an embodiment of the present disclosure;
[0162] Fig.32 is a schematic diagram of determining a receiving bitmap according to an embodiment of the present disclosure;
[0163] Fig.33 is a flowchart of sending a first data packet to a destination node and generating a second data packet when a receive status request is added to a first tunnel encapsulation field of a first first number of competing data packets according to an embodiment of the present disclosure;
[0164] Fig.34 is a schematic diagram of sending a first data packet to a destination node and generating a second data packet in a case where a receive status request is added to a first tunnel encapsulation field of a first first number of competing data packets according to an embodiment of the present disclosure;
[0165] Fig.35 is a flow chart of determining a first number according to an embodiment of the present disclosure;
[0166] Fig.36 is a flowchart of sending a first data message to a destination node and receiving a second data message sent by the destination node according to an embodiment of the present disclosure;
[0167] Fig.37 is a flow chart of determining the path status of each candidate logical path according to an embodiment of the present disclosure;
[0168] Fig.38 is a schematic diagram of determining the path status of each candidate logical path according to an embodiment of the present disclosure;
[0169] Fig.39 is a flowchart of determining the path status of a candidate logical path based on the path status of the candidate logical path in a plurality of consecutive cycles according to an embodiment of the present disclosure;
[0170] Fig.40 is a schematic diagram of determining the path state of a candidate logical path based on the path states of the candidate logical paths in a plurality of consecutive cycles according to an embodiment of the present disclosure;
[0171] Fig.41It is a flowchart of determining the path status of a candidate logical path based on the path status of the candidate logical path in a plurality of consecutive cycles after filtering the noise caused by network delay and packet loss according to an embodiment of the present disclosure;
[0172] Fig.42 is a schematic diagram of determining the path state of a candidate logical path based on the path states of the candidate logical paths in a plurality of consecutive cycles after filtering the noise caused by network delay and packet loss according to an embodiment of the present disclosure;
[0173] Fig.43 is a flow chart of determining a non-faulty target logic path among a plurality of candidate logic paths according to an embodiment of the present disclosure;
[0174] Fig.44 is a schematic diagram of replacing a first index with a second index of a non-faulty candidate logical path according to the order of the non-faulty candidate logical paths among a plurality of candidate logical paths according to an embodiment of the present disclosure;
[0175] Fig.45 It is a flowchart of switching the target message back to the initial logical path for sending after determining that the initial logical path has recovered from a fault according to an embodiment of the present disclosure;
[0176] Fig.46 is a flow chart for determining initial logical path failure recovery according to an embodiment of the present disclosure;
[0177] Fig.47 is a schematic diagram of a source node sending a probe request to a destination node and receiving reception status information of the destination node on an initial logical path according to an embodiment of the present disclosure;
[0178] Fig.48 is a flow chart of determining initial logical path failure recovery based on receiving state information according to an embodiment of the present disclosure;
[0179] Fig.49 is a flowchart of switching a target message back to an initial logical path for sending according to an embodiment of the present disclosure;
[0180] Fig.50A is a schematic diagram of determining an initial position of a first index in an original index queue according to an embodiment of the present disclosure;
[0181] Fig.50B is a schematic diagram of replacing the index of the initial position in the target index queue with the first index of the initial logical path according to an embodiment of the present disclosure;
[0182] Fig.51 is a flowchart of replacing other indexes other than the first index with the first index of the initial logic path according to an embodiment of the present disclosure;
[0183] Fig.52 is a schematic diagram of determining an index queue in the presence of multiple candidate logical failure paths according to an embodiment of the present disclosure;
[0184] Fig.53 It is an overall flow chart of a method for transmitting a message by a source node to determine the path status of each candidate logical path according to an embodiment of the present disclosure, applied to a destination node side;
[0185] Fig.54 It is an overall flow chart of a method for transmitting a message by a destination node to determine the path status of each candidate logical path according to an embodiment of the present disclosure, applied to a source node side;
[0186] Fig.55 It is a schematic diagram of a source node sending a sending bitmap to a destination node and receiving the path status of each candidate logical path returned by the destination node according to an embodiment of the present disclosure;
[0187] Fig.56 It is an overall flow chart of a method for transmitting a message by a destination node to determine the path status of each candidate logical path according to an embodiment of the present disclosure, applied to a destination node side;
[0188] Fig.57 is a module block diagram of a message transmission device applied to a source node side according to an embodiment of the present disclosure;
[0189] Fig.58 is a module block diagram of a message transmission device applied to a destination node side according to an embodiment of the present disclosure;
[0190] Fig.59 is a structural diagram of a terminal for executing a message transmission method according to an embodiment of the present disclosure;
[0191] Fig.60 It is a structural diagram of a server for executing a message transmission method according to an embodiment of the present disclosure. DETAILED DESCRIPTION
[0192] In order to make the purpose, technical solution and advantages of the present disclosure more clear, the present disclosure is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present disclosure and are not used to limit the present disclosure.
[0193] Before further describing the embodiments of the present disclosure in detail, the nouns and terms involved in the embodiments of the present disclosure are described. The nouns and terms involved in the embodiments of the present disclosure are subject to the following interpretations:
[0194] Message: It is the unit of data exchanged and transmitted in the network, that is, the data block that a node wants to send at one time. Message is also the unit of network transmission. During the transmission process, it will be continuously encapsulated into groups, packets, and frames for transmission. The way of encapsulation is to add some information segments, which are the data organized in a certain format by the message header. The message contains the complete data information to be sent, and its length is very inconsistent, and the length is unlimited and variable.
[0195] Tunnel encapsulation: Tunnel encapsulation is a network protocol data packet encapsulation technology that encapsulates a network protocol data packet in another network protocol for transmission. This technology is widely used in virtual private networks (VPNs) and virtualized networks in data centers to achieve isolation between different tenants or applications, networking interconnection, and free addressing and mobility of virtual hosts.
[0196] Overlay network: An overlay network is a virtual network built on top of an existing physical network (underlying network). It connects nodes through logical or virtual links to form a network structure independent of the underlying physical network. Overlay networks can achieve a variety of functions, including network virtualization, isolation, and security enhancement. The basic principle of an overlay network is to use tunnel encapsulation technology to transparently transmit data packets in the underlying network, and decapsulate the original message after reaching the destination. Common tunnel encapsulation technologies include VXLAN, NVGRE, and IPsec. For example, VXLAN is a widely used overlay technology that can build a virtual Layer 2 network on an existing Layer 3 physical network, thereby enabling tenant Layer 2 messages to be transmitted across the Layer 3 network between different sites.
[0197] Tunneling technology is a technology for transmitting data between networks. The message data transmitted using tunnels can be data frames or packets using different transmission protocols. In the process of transmitting message data, the sender uses tunneling technology to encapsulate the data message of one network protocol in another network protocol. After receiving the message data, the receiver decouples the original data message and the encapsulated packet header. Tunneling technology can be used to achieve communication between different networks. Currently, the most widely used tunneling technologies include bare tunnel encapsulation and multipath transport protocol encapsulation. Bare tunnel encapsulation only tunnels the message data in a stateless manner. When a network fails, it cannot perceive and respond to the failure in the network. Failures can only be resolved by retransmission. Therefore, data flow continuity and service availability are poor. Multipath transport protocol encapsulation guarantees the reliable transmission of data messages by referencing the complete transport protocol, but since the complete transport protocol is referenced, it will bring huge computing and storage overheads.
[0198] Based on this, the embodiments of the present disclosure provide a message transmission method, device, electronic device and medium. It can send a receiving status request to the destination node, receive the receiving bitmap sent by the destination node, compare the sending bitmap of the source node with the receiving bitmap of the destination node, and accurately estimate which of the candidate logical paths may be faulty in advance, thereby avoiding placing the target message in the logical path that may be faulty in advance. Compared with the scheme of only retransmitting afterwards, the data flow continuity and service availability are greatly improved. Moreover, the embodiments of the present disclosure only need to add a receiving status request or a receiving bitmap to a small number of data messages to achieve, the transmission storage overhead is low, the processing of comparing the sending bitmap and the receiving bitmap is simple, and the computational overhead is low. The embodiments of the present disclosure can improve the data flow continuity and service availability in message transmission while maintaining a small computational overhead and storage overhead.
[0199] System architecture and scenario description of the application of the embodiments of the present disclosure
[0200] Figure 1A-Figure 1C It is a system architecture diagram applied to the message transmission method according to the embodiment of the present disclosure. Figure 1A It includes terminal 140, Internet 130, gateway 120, server 110 and the like.
[0201] The terminal 140 includes various forms such as desktop computers, laptop computers, PDAs (personal digital assistants), mobile phones, vehicle-mounted terminals, home theater terminals, and dedicated terminals. In addition, it can be a single device or a collection of multiple devices. The terminal 140 can communicate with the Internet 130 in a wired or wireless manner to exchange data.
[0202] The server 110 refers to a computer system that can provide certain services to the terminal 140. Compared with ordinary terminals 140, the server 110 has higher requirements in terms of stability, security, performance, etc. The server 110 can be a high-performance computer in a network platform, a cluster of multiple high-performance computers, a part of a high-performance computer (such as a virtual machine), a combination of parts of multiple high-performance computers (such as virtual machines), etc. In a distributed system, multiple servers 110 are interconnected as computing and storage units to transmit data and coordinate task processing using shared communication lines.
[0203] The gateway 120 is also called an internetwork connector or a protocol converter. The gateway realizes network interconnection at the transport layer and is a computer system or device that acts as a converter. The gateway is a translator between two systems that use different communication protocols, data formats or languages, or even completely different architectures. At the same time, the gateway can also provide filtering and security functions. The message sent by the terminal 140 to the server 110 must be sent to the corresponding server 110 through the gateway 120. The message sent by the server 110 to the terminal 140 must also be sent to the corresponding terminal 140 through the gateway 120.
[0204] The source node and the destination node of the message transmission method of the embodiment of the present disclosure are both the server 110. Figure 1B and Figure 1C , assuming that the source node is server 1, the destination node 1 is server 2, and the destination node 2 is server 3. Server 1 is connected to server 2 and server 3 through the Internet 130, and there are multiple logical paths between server 1 and server 2, and there are multiple logical paths between server 1 and server 3. Among them, each logical path maps a physical transmission path, and the message can be transmitted between different servers through the transmission path mapped by the logical path. Figure 1B It can be determined that each server is provided with a private network service layer, which allows the server to build an isolated virtual network environment capable of managing configurations and policies. There are multiple virtual machines in the private network service layer, which are complete computer systems with complete hardware system functions and running in a completely isolated environment simulated by software. The server can connect to external applications through virtual machines, receive messages sent by external applications, and send messages to their corresponding destination nodes. Different messages correspond to different source nodes and destination nodes. Based on this, for messages with the same source node and destination node, a tunnel can be established between the source node and the destination node corresponding to the message to transmit these messages, and the endpoints corresponding to the tunnel are the source node and the destination node. Among them, the tunnel is an abstract concept of physical connection, which allows a direct, point-to-point relationship to be established between the source node and the destination node without considering the details of the physical layer. The transmission of messages between the source node and the destination node through the tunnel can achieve isolation between different applications, networking interconnection, and automatic addressing and movement of virtual machines.
[0205] Moreover, a tunnel includes multiple logical paths, and the message received by the virtual machine of the source node reaches the destination node through these logical paths. Figure 1B and Figure 1C, assuming that virtual machine 1 of server 1 receives message 1 and message 2, and the destination nodes of message 1 and message 2 are both server 2, it can be determined that message 1 and message 2 can be transmitted through the same tunnel. The tunnel between server 1 and server 2 includes multiple logical paths, based on which, message 1 and message 2 can reach server 2 through the physical path mapped by any logical path in the tunnel.
[0206] Figure 2 Schematic diagram of the software form of the server used in the message transmission method according to the embodiment of the present disclosure. Figure 2 In software form, the embodiments of the present disclosure can be implemented within a software transmission protocol stack, and the upper layer of the message transmission method of the embodiments of the present disclosure is also provided with a transmission control protocol (TCP) and a connectionless transmission protocol (UDP) to achieve reliable transmission of messages.
[0207] The embodiments of the present disclosure can be applied in data transmission scenarios. Figure 3 , Figure 3 It is a schematic diagram of the topology of a data center network to which the message transmission method according to an embodiment of the present disclosure is applied. Figure 3 H0-H15 in the figure can represent multiple servers in a computer room. The server can be connected to external applications, receive message data sent by external applications and transmit it to other servers in the data center network.
[0208] LA0-LA31 and LC0-LC7 can represent multiple switches in a computer room, and the switches are used to forward data.
[0209] Figure 3 The data center has three layers of switches, namely the access layer, the aggregation layer and the core layer. The switches at the access layer include LA16-LA31, the switches at the aggregation layer include LA0-LA15, and the switches at the core layer include LC0-LC7. The servers are connected to the switches at the access layer. It should be noted that in mainstream data center networks, in order to increase the communication bandwidth and connection reliability between servers, the servers generally use two links to connect to the two switches at the access layer (that is, the two network ports of the server are connected to the two switches respectively). For example: switch H0 uses two links to connect to switches LA16 and LA17 at the access layer.
[0210] Further, here we combine the process of sending message data by the server to Figure 3 The network architecture of the data center is described as follows: Figure 3In the example, the server as the source node needs to send message data corresponding to a certain application to the server as the destination node. First, it needs to send the message data to the switch at the access layer. The switch at the access layer forwards the message data to the switch at the aggregation layer. The switch at the aggregation layer forwards the message data to the switch at the core layer. After the core layer receives the message data forwarded by the switch at the aggregation layer, it forwards the message data to the switch at the aggregation layer. The switch at the aggregation layer forwards the message data to the switch at the access layer. Finally, the switch at the access layer forwards the received message data to the server as the destination node. Figure 3 It can be understood that there are multiple transmission paths composed of switches between the server as the source node and the server as the destination node, and each transmission path corresponds to a logical path. The message data received by the server as the source node can reach the server as the destination node through the corresponding logical path.
[0211] Exemplarily, if the server H1 as a source node needs to send message data to the server H9 as a destination node, there are multiple transmission paths, and each transmission path corresponds to a logical path. Here, the process of server H1 sending message data A to server H9 is described for one of the logical paths: server H1 first sends message data A to the switch LA16 at the access layer, and the switch LA16 forwards the message data A to the switch LA1 at the aggregation layer, so that the switch LA1 forwards the message data A to the switch LC2 at the core layer. Then, the switch LC2 forwards the message data A to the switch LA9 at the aggregation layer, and the switch LA9 forwards the message data A to the switch LA24 at the access layer. Finally, the switch LA24 forwards the message data A to the server H9.
[0212] It should be understood that the above content only illustrates some application scenarios of the present disclosure. The business scenarios to which the present disclosure can be applied may include but are not limited to the specific embodiments listed above.
[0213] General description of the disclosed embodiments
[0214] It should be emphasized that the embodiments of the present disclosure can be applied to a variety of application scenarios, such as data transmission, Redis database, high-speed cluster, cloud storage and other scenarios. The most widely used tunnel technologies currently include bare tunnel encapsulation and multi-path transmission protocol encapsulation. Bare tunnel encapsulation only tunnels the message data in a stateless manner, and cannot perceive and react to the fault in the network when a network fault occurs. The fault can only be solved by retransmission. Therefore, the data flow continuity and service availability are poor. Multi-path transmission protocol encapsulation guarantees the reliable transmission of data messages by referencing a complete transmission protocol, but since the complete transmission protocol is referenced, it will bring huge computing overhead and storage overhead. Some embodiments of the present disclosure provide a message transmission method, device, electronic device and medium, which can send a receiving status request to a destination node, receive a receiving bitmap sent by a destination node, compare the sending bitmap of a source node with the receiving bitmap of a destination node, and accurately estimate which of each candidate logical path may be faulty in advance, thereby avoiding placing the target message in a logical path that may have a fault in advance. Compared with the solution of only retransmitting afterwards, the data flow continuity and service availability are greatly improved. Moreover, the embodiments of the present disclosure only need to add a receiving status request or a receiving bitmap in a small amount of data messages to achieve the desired effect, and the transmission storage overhead is low. The processing of comparing the sending bitmap and the receiving bitmap is relatively simple, and the calculation overhead is low. The embodiments of the present disclosure can improve the data flow continuity and service availability in message transmission while maintaining a small calculation overhead and storage overhead.
[0215] The message transmission method of the embodiment of the present disclosure is executed on the server 110 of the source node and the destination node. The server 110 of the source node transmits the target message from the external application to the server 110 of the destination node to achieve reliable transmission at the sending level.
[0216] like Figure 4 As shown, according to an embodiment of the present disclosure, applied to a source node, the message transmission method includes:
[0217] Step 410: Determine an initial logical path from among multiple candidate logical paths to the destination node based on the addressing information of the target message;
[0218] Step 420: Obtain a sending bitmap of the source node, where the sending bitmap indicates the message sending status of the source node for each candidate logical path;
[0219] Step 430: Send a reception status request to the destination node, and receive a reception bitmap of the destination node, where the reception bitmap indicates the message reception status of the destination node for each candidate logical path;
[0220] Step 440: Determine the path status of each candidate logical path based on the comparison between the sending bitmap and the receiving bitmap;
[0221] Step 450: If the path status of the initial logical path is faulty, determine a non-faulty target logical path from multiple candidate logical paths, and transfer the target message to the target logical path.
[0222] The above steps 410 - 450 are briefly described below.
[0223] In step 410, an initial logical path is determined from a plurality of candidate logical paths to a destination node based on the addressing information of the target message.
[0224] According to an embodiment of the present disclosure, the source node may be a server that sends messages, the destination node may be a server that receives messages, the source node corresponds to the destination node, and a tunnel is established between the source node and the destination node. If there are multiple messages whose source nodes and destination nodes are the same, then these messages can be transmitted through the same tunnel, that is, the source node and destination node of the messages transmitted by each tunnel are the same. Among them, the tunnel is an abstract concept of physical connection, and the tunnel allows a direct, point-to-point relationship to be established between the source node and the destination node without considering the physical layer details. A tunnel includes multiple candidate logical paths, each of which is mapped to a physical transmission path from the source node to the destination node, so the message can be transmitted from the source node to the destination node through the candidate logical path.
[0225] It can be understood that the target message refers to the message data that the source node is to send to the destination node.
[0226] The target message includes addressing information, which is used to indicate the destination node corresponding to the target message. Based on the addressing information, the source node can determine the destination node corresponding to the target message. Figure 5After receiving the target message sent by the external application, the source node will first determine the destination node corresponding to the target message based on the addressing information of the target message, and then determine whether there is a tunnel connection between the source node and the destination node corresponding to the target message (that is, whether the source node has sent a message to the destination node before). If there is no tunnel connection between the source node and the destination node corresponding to the target message, the source node first needs to establish a tunnel connection with the destination node corresponding to the target message. If there is a tunnel connection between the source node and the destination node corresponding to the target message, because the tunnel itself includes multiple candidate logical paths, the source node only needs to select a candidate logical path from the multiple candidate logical paths included in the tunnel based on the addressing information as the initial logical path to transmit the message using the initial logical path. Among them, the initial logical path is the candidate logical path determined by the source node.
[0227] According to the embodiments of the present disclosure, referring to Figure 6 , the form of addressing information is generally a field in the target message. The addressing information can be expressed as a five-tuple information, which includes source IP (referring to the IP address of the source node), destination IP (referring to the IP address of the destination node), protocol number (used to ensure that the target message can be correctly sent and received), UDP source port number (UDP (User Datagram Protocol) is a connectionless transport layer protocol, and its message structure is relatively simple. In the UDP message, the source port number is an important field used to identify the port where the application sending the target message is located) and the destination port number (the destination port number can be used to identify the port number where the application receiving the target message is located). For the target message with the same source node and destination node, the source IP, destination IP, protocol number and destination port number of the target message are consistent, and only the UDP source port number is different. Therefore, the candidate logical path can be selected as the initial logical path based on the UDP source port number of the target message. On the other hand, since the source port number has 16 bits, only part of the bit segment of the source port number can be used to select the candidate logical path. Exemplarily, the lower 8 bits or the upper 8 bits of the source port number can be used to select the candidate logical path. Furthermore, in a network supporting IPv6 (next generation Internet Protocol) routing, the addressing information can also be represented as a flow field in the protocol number. Figure 7 , it can be determined that the source node can select a candidate logical path from multiple candidate logical paths between the source node and the destination node as the initial logical path to transmit the target message based on the addressing information carried by the target message.
[0228] In step 420, a sending bitmap of the source node is obtained, where the sending bitmap indicates the message sending status of the source node for each candidate logical path.
[0229] According to an embodiment of the present disclosure, for each destination node corresponding to a target message, the source node maintains a corresponding sending bitmap. The sending bitmap is used to indicate the message sending status of the source node for each candidate logical path between the source node and the destination node. The message sending status of the candidate logical path can be used to indicate whether the source node uses the candidate logical path to transmit the target message to the destination node. For example, refer to Figure 8 , assuming that for a destination node of a target message, the tunnel between the source node and the destination node has 8 candidate logical paths, then the sending bitmap maintained by the source node side can be used to indicate the message sending status corresponding to the 8 candidate logical paths. For example, the message sending status corresponding to the candidate logical path 1 in the sending bitmap is message sending status 1.
[0230] In step 430, a reception status request is sent to the destination node, and a reception bitmap of the destination node is received, where the reception bitmap indicates the message reception status of the destination node for each candidate logical path.
[0231] According to the embodiments of the present disclosure, referring to Figure 5 and Fig. 9 After obtaining the sending bitmap, the source node sends a receiving status request to the destination node. The receiving status request can be used to request the receiving bitmap from the destination node, that is, after receiving the receiving status request sent by the source node, the destination node will return the receiving bitmap to the source node, such as Fig. 9 shown.
[0232] It can be understood that for each source node corresponding to a target message, the destination node maintains a corresponding reception bitmap. The reception bitmap is used to indicate the message reception status of the destination node for each candidate logical path between the source node and the destination node. The message reception status of the candidate logical path can be used to indicate whether the destination node has received the target message transmitted using the candidate logical path. Figure 8 , assuming that for a certain source node, there are 8 candidate logical paths for the tunnel between the destination node and the source node, then the receiving bitmap maintained by the destination node side can be used to indicate the message receiving status of the 8 candidate logical paths. For example, the message receiving status corresponding to the candidate logic 1 in the receiving bitmap is message receiving status 1.
[0233] In step 440, the path status of each candidate logical path is determined based on the comparison between the sending bitmap and the receiving bitmap.
[0234] According to an embodiment of the present disclosure, the path status of the candidate logical path is used to indicate the health and availability status of the candidate logical path, and the path status corresponding to each candidate logical path is also different. Figure 5After receiving the receiving bitmap of the destination node, the source node can compare the sending bitmap maintained by the source node with the receiving bitmap received by the source node to comprehensively determine the path status of each candidate logical path. Figure 8 , since the sending bitmap indicates the message sending status of the source node for each candidate logical path, and the receiving bitmap indicates the message receiving status of the destination node for each candidate logical path. For a certain candidate logical path, the path status of the candidate logical path can be quickly obtained based on the comparison of the message sending status and the message receiving status of the candidate logical path. Figure 8 For example, it is assumed that a tunnel between a source node and a destination node has 8 candidate logical paths. It can be obtained that for candidate logical path 1, the path state of candidate logical path 1 can be determined based on message sending state 1 and message receiving state 1, and the path state of candidate logical path 1 is path state 1.
[0235] It can be understood that in the embodiments of the present disclosure, only a receiving status request or a receiving bitmap needs to be added to a small amount of data packets to detect the path status of each candidate logical path, and the transmission and storage overhead is low. Moreover, the process of comparing the sending bitmap and the receiving bitmap is relatively simple, and the calculation overhead is also low.
[0236] In step 450, if the path status of the initial logical path is faulty, a non-faulty target logical path is determined from a plurality of candidate logical paths, and the target message is transferred to the target logical path.
[0237] According to the embodiments of the present disclosure, if the path status of the initial logical path is faulty, it means that if the initial logical path is continued to be used to transmit the target message, there will be a risk of target message packet loss. Based on this, it is necessary to re-determine the logical path for the target message. The source node can determine a non-faulty target logical path from multiple candidate logical paths, such as Fig.10 As shown. The target logical path refers to a candidate logical path that is re-determined for the target message when the path state of the initial logical path is faulty, and the path state of the target logical path is not faulty. Furthermore, after determining the non-faulty target logical path, in order to ensure that the target message can reach the destination node, the target message needs to be transferred to the target logical path so as to transmit the target message through the target logical path.
[0238] According to the embodiments of the present disclosure, referring to Fig.11ABy testing the existing message transmission method and the message transmission method of the embodiment of the present disclosure, it can be obtained that: when the switching node fails at the 0th second, the existing message transmission method (i.e., the naked tunnel encapsulation method) will experience a long period of data flow interruption because it cannot perceive the path failure in time. After the transmission protocol fails to retransmit the target message after multiple timeouts (at the 2nd second), it will notify the service layer of the source node of the transmission failure, triggering a service error. However, even if the service retries to establish a transmission connection, it will still experience retransmission failures, which will cause the service to be unavailable for a long time until the network management layer detects the switching node failure at the 10th second, thereby triggering a routing change. After this, the service will be successful only if it re-initiates the transmission connection. In contrast, the embodiment of the present disclosure does not rely on changing the switching node to bypass the faulty path, but determines the path status of each candidate logical path based on the comparison of the sending bitmap and the receiving bitmap, thereby realizing the rapid determination of the path status of the logical path, such as Fig.11A As shown, the embodiment of the present disclosure can detect that the path status of the initial logical path is faulty in 40 milliseconds. Moreover, in the case where the path status of the initial logical path is faulty, the target message can be transferred to the non-faulty target logical path. At this time, even if the upper layer has experienced short-term packet loss and no response status, the source node can restore the traffic of the data flow after the first or second timeout retransmission. In this case, the upper layer service will not perceive the data flow interruption, and the service will not be unavailable. Fig. 11B From the perspective of throughput, when the switching node fails at the 10th second, the throughput of the existing message transmission method will experience a long-term decrease and will not recover until the 40th second. In the embodiment of the present disclosure, although the throughput of the switching node will decrease after the failure, it will recover soon. Based on this, it can be determined that compared with the existing message transmission method, the embodiment of the present disclosure can improve the data flow continuity and service availability in message transmission.
[0239] The above-mentioned embodiment of step 410 to step 450 is not like bare tunnel encapsulation, which can only solve the fault by retransmission afterwards, but by sending a receiving status request to the destination node, receiving the receiving bitmap sent by the destination node, and comparing the sending bitmap of the source node with the receiving bitmap of the destination node, so as to avoid putting the target message in the logical path that may have a fault in advance. Since the sending bitmap indicates the message sending status of the source node for each candidate logical path, and the receiving bitmap indicates the message receiving status of the destination node for each candidate logical path, the path status of each candidate logical path can be obtained by comparing the sending bitmap with the receiving bitmap, so that when the initial logical path assigned to the target message fails, a non-faulty target logical path is assigned to the target message. This method avoids sending the target message in the candidate logical path that has a fault by accurately estimating which candidate logical paths may have a fault in advance, and greatly improves the data flow continuity and service availability compared with the solution of only retransmitting afterwards. This solution only needs to add a receive status request or a receive bitmap in a small number of data messages to be implemented. The transmission and storage overhead is low, and the processing of comparing the send bitmap and the receive bitmap is simple and the computational overhead is low. Therefore, while maintaining a small computational overhead and storage overhead, the data flow continuity and service availability in message transmission are improved.
[0240] The above is a general description of step 410 to step 450. The specific implementation process of step 410 to step 450 is described in detail below.
[0241] Detailed description of step 410
[0242] In step 410, an initial logical path is determined from a plurality of candidate logical paths to a destination node based on the addressing information of the target message.
[0243] In one embodiment, the addressing information is five-tuple information of the target message;
[0244] Reference Fig.12 , step 410 includes:
[0245] Step 1210: Perform a hash operation on the five-tuple information to obtain a target hash value;
[0246] Step 1220: Perform a modulo operation on the target hash value and the number of candidate logical paths to obtain a target remainder;
[0247] Step 1230: Determine an initial logic path from among multiple candidate logic paths based on the target remainder.
[0248] Steps 1210 to 1230 are described in detail below:
[0249] In step 1210, a hash operation is performed on the five-tuple information to obtain a target hash value.
[0250] It is understandable that, referring to Fig.13 , the addressing information can be expressed as the five-tuple information of the target message. The five-tuple information is added to the target message as a field. The destination node corresponding to the target message and the candidate logical path used for the target message transmission can be determined through the five-tuple information. The five-tuple information includes the source IP, destination IP, protocol number, UDP source port number and destination port number. Among them, for the target message with the same source node and destination node, the source IP, destination IP, protocol number and destination port number of the target message are consistent, and only the UDP source port number is different. It can be understood that the candidate logical paths selected by the target messages with different UDP source port numbers are also different. Therefore, the candidate logical path can be selected based on the five-tuple information.
[0251] According to an embodiment of the present disclosure, a hash operation is a process of converting an input of arbitrary length into an output of fixed length through a hash function. At the same time, in the process of selecting candidate logical paths based on quintuple information, a hash operation is also a commonly used method for considering mapping balance. In order to minimize the impact on the target message when the path state of the logical path corresponding to the target message is a fault, an embodiment of the present disclosure adopts a consistent hashing method. First, a hash operation can be performed on the quintuple information to obtain a target hash value. Among them, the target hash value refers to the value obtained after calculating the quintuple information using a hash function.
[0252] In step 1220, a modulo operation is performed on the target hash value and the number of candidate logical paths to obtain a target remainder.
[0253] According to an embodiment of the present disclosure, the number of multiple candidate logical paths refers to the number of all candidate logical paths included in the tunnel from the source node to the destination node. Modulo operation can be used to calculate the remainder after dividing two numbers, that is, the modulo operation can calculate the remainder after the target hash value is divided by the number of multiple candidate logical paths, and the remainder after the target hash value is divided by the number of multiple candidate logical paths is also the target remainder.
[0254] In step 1230 , an initial logic path is determined among a plurality of candidate logic paths based on the target remainder.
[0255] According to an embodiment of the present disclosure, the target remainder may be understood as an index, which may be used to determine the candidate logical path corresponding to the target message. Fig.14, here we take target message 1 and target message 2 as examples: the candidate logical path pointed to by the target remainder of target message 1 is candidate logical path 2, and the candidate logical path pointed to by the target remainder of target message 2 is candidate logical path 3. Therefore, it can be determined that the initial logical path corresponding to target message 1 is candidate logical path 2, and the initial logical path corresponding to target message 2 is candidate logical path 3. Fig.15 Since the destination nodes of target message 1 and target message 2 are the same, both are destination node 1, target message 1 and target message 2 both use tunnel 1 to be transmitted to destination node 1. Further, target message 1 uses candidate logical path 2 in tunnel 1 to be transmitted to destination node 1, and target message 2 uses candidate logical path 3 in tunnel 2 to be transmitted to destination node 2.
[0256] The specific method of “determining an initial logic path among multiple candidate logic paths based on the target remainder” will be described in detail below.
[0257] The embodiment of the above steps 1210 to 1230 determines the initial logical path corresponding to the target message by performing a consistent hash operation on the five-tuple information of the target message, and can evenly select the corresponding initial logical path for each different target message, thereby reducing the congestion of the candidate logical path caused by too many messages using the same candidate logical path for transmission.
[0258] In one embodiment, referring to Fig.16 , step 1230 includes:
[0259] Step 1610: assign an index to each candidate logical path;
[0260] Step 1620: Arrange the indexes of the candidate logical paths into an index group, and repeat the index group a third number of times to obtain an original index queue;
[0261] Step 1630: In the original index queue, select the index at the rank of the target remainder as the initial index, and determine the candidate logical path corresponding to the initial index as the initial logical path.
[0262] Steps 1610 to 1630 are described in detail below:
[0263] In step 1610, an index is assigned to each candidate logical path.
[0264] According to an embodiment of the present disclosure, the index can provide a pointer to a candidate logical path for the five-tuple information. Each candidate logical path corresponds to an index, that is, the corresponding candidate logical path can be determined based on this index later. Therefore, it is necessary to first assign an index to each candidate logical path. For example, refer to Fig.17 , assuming that there are candidate logical path 1, candidate logical path 2, candidate logical path 3 and candidate logical path 4, index 1 can be assigned to candidate logical path 1, index 2 can be assigned to candidate logical path 2, index 3 can be assigned to candidate logical path 3, and index 4 can be assigned to candidate logical path 4.
[0265] In step 1620, the indexes of the candidate logical paths are arranged into index groups, and the index groups are repeated a third number of times to obtain an original index queue.
[0266] According to an embodiment of the present disclosure, an index group refers to a queue composed of index arrangements of each candidate logical path. The third number refers to the number of repetitions of the cyclic arrangement of the index group, and the specific method for determining the third number will be described in detail below. The original index queue refers to a queue obtained by cyclically arranging the index group based on the third number. For example, refer to Fig.17 , assuming that there are candidate logical path 1, candidate logical path 2, candidate logical path 3 and candidate logical path 4. The indexes corresponding to the candidate logical paths are 1, 2, 3, and 4, respectively. Based on this, the indexes of the candidate logical paths are arranged into index groups, and the obtained index groups include 1, 2, 3, and 4. Further, assuming that the third number is 4, the index group including 1, 2, 3, and 4 is repeated 4 times for circular arrangement, and the following can be obtained: Fig.17 The original index queue shown.
[0267] In step 1630, in the original index queue, an index at the rank of the target remainder is selected as an initial index, and a candidate logic path corresponding to the initial index is determined as the initial logic path.
[0268] According to the embodiments of the present disclosure, the rank refers to the order of the index on the original index queue, and different indexes correspond to different ranks. The initial index refers to the index on the rank of the target remainder corresponding to the target message in the original index queue. Based on the initial index of the target message, the initial logical path of the target message can be determined. For example, refer to Fig.14 Assuming that after hash operation and modulus operation, the target remainder of target message 1 is determined to be 6, the position of the original index queue is searched based on the target remainder of target message 1, and the index on the position of the original index queue is 2. Taking 2 as the initial index of target message 1, it can be determined that the candidate logical path corresponding to the initial index is candidate logical path 2, so candidate logical path 2 can be determined as the initial logical path.
[0269] The embodiments of the above steps 1610 to 1630 can arrange the indexes of each candidate logical path into an index group, and arrange the index group cyclically according to the third number to obtain the original index queue. Based on this, uniform mapping of the candidate logical paths is achieved. Moreover, in the original index queue, the initial logical path can also be determined based on the index on the position of the target remainder of the target message, and the corresponding initial logical path is evenly selected for each different message, thereby achieving load balancing on each candidate logical path.
[0270] In one embodiment, referring to Fig.18 , the third number in step 1620 is determined by:
[0271] Step 1810: Obtain a hash algorithm for hash operation;
[0272] Step 1820, determining the maximum hash value generated by the hash algorithm;
[0273] Step 1830: Obtain the storage space size of the source node;
[0274] Step 1840: Obtain the computing capacity of the source node;
[0275] Step 1850: Determine a third number based on the maximum hash value, storage space size, and computing power.
[0276] Steps 1810 to 1850 are described in detail below:
[0277] In step 1810, a hash algorithm for hash operation is obtained.
[0278] According to the embodiments of the present disclosure, there are many types of hash algorithms, each of which has its own specific application scenarios and performance characteristics. Therefore, before using a hash algorithm to perform a hash operation on quintuple information, a hash algorithm for the hash operation needs to be obtained first.
[0279] In step 1820, the maximum hash value generated by the hash algorithm is determined.
[0280] According to an embodiment of the present disclosure, the maximum hash value refers to the maximum target remainder that can be obtained after performing a hash operation on the five-tuple information using a hash algorithm. The larger the maximum hash value, the larger the target remainder of the target message. Because the target remainder is used to determine the initial logical path of the target message in the original index queue, in order to ensure that the target remainder of each target message does not exceed the number of indexes of the original index queue, the maximum hash value is proportional to the third number, and the larger the maximum hash value, the larger the third number.
[0281] In step 1830, the storage space size of the source node is obtained.
[0282] According to an embodiment of the present disclosure, the larger the storage space of the source node, the more data the source node can accommodate. Although the larger the third number, the higher the uniformity of selecting the candidate logical path, this will also result in a larger storage space occupied by the original index queue. In order to ensure a balance between the storage space occupied by the original index queue and the uniformity of selecting the candidate logical path, the size of the third number can be reasonably determined based on the storage space size of the source node. The storage space size of the source node is proportional to the third number. The larger the storage space of the source node, the larger the third number.
[0283] In step 1840, the computing capacity of the source node is obtained.
[0284] According to the embodiments of the present disclosure, the computing power of the source node refers to the ability of the source node to process messages. If the computing power of the source node is very poor, it means that the target remainder obtained by the source node after performing a hash operation on the quintuple may not be accurate, so the uniformity of selecting the candidate logical path will also decrease. Based on this, the third number can be set larger to improve the uniformity of selecting the candidate logical path. Therefore, the computing power of the source node is inversely proportional to the third number. The stronger the computing power of the source node, the smaller the third number.
[0285] In step 1850, a third number is determined based on the maximum hash value, the storage space size, and the computing power.
[0286] It can be understood that the method for determining the third number based on the maximum hash value, storage space size, and computing power includes: determining a first score based on the maximum hash value; determining a second score based on the storage space size; determining a third score based on computing power; determining a fourth score based on the first score, the second score, and the third score; and determining the third number based on the fourth score.
[0287] The first score can be determined based on the maximum hash value by looking up a table. The first score corresponding to the maximum hash value is obtained according to the correspondence table between the maximum hash value and the first score. The first score can also be determined based on the maximum hash value by substitution. The maximum hash value is substituted into a pre-set formula of the maximum hash value and the first score to obtain the first score corresponding to the maximum hash value.
[0288] The second score can be determined based on the storage space size by looking up a table. According to the corresponding relationship table between the storage space size and the second score, the second score corresponding to the storage space size is obtained. The second score can also be determined based on the storage space size by substitution. The storage space size is substituted into a preset formula of the storage space size and the second score to obtain the second score corresponding to the storage space size.
[0289] The third score can be determined based on the computing capability by looking up a table. The third score corresponding to the computing capability is obtained according to the corresponding relationship table between the computing capability and the third score. The third score can also be determined based on the computing capability by substitution. The computing capability is substituted into a preset formula of the computing capability and the third score to obtain the third score corresponding to the computing capability.
[0290] The fourth score may be the sum of the first score, the second score and the third score, or the average of the first score, the second score and the third score. Furthermore, different weights may be assigned to the first score, the second score and the third score according to the maximum hash value, the storage space size and the computing power, and the fourth score may be determined as the weighted sum of the first score, the second score and the third score.
[0291] The third number can be determined based on the fourth score by looking up a table. The third number corresponding to the fourth score is obtained according to the corresponding relationship table between the fourth score and the third number. The third number can be determined based on the fourth score by substitution. The fourth score is substituted into a preset formula of the fourth score and the third number to obtain the third number corresponding to the fourth score.
[0292] In the above-mentioned embodiment of step 1810 to step 1850, the size of the third number can be comprehensively determined based on the maximum hash value generated by the hash algorithm, the storage space size of the source node, and the computing power of the source node. Because the importance of the above three factors is taken into consideration, the original index queue obtained based on the third number can also be more suitable for the source node.
[0293] In one embodiment, referring to Fig.19 The number of multiple candidate logic paths in step 410 is determined by:
[0294] Step 1910, obtaining the transmission flow per unit time in the target tunnel from the source node to the destination node;
[0295] Step 1920: Obtain the path failure rate of the target tunnel;
[0296] Step 1930: Obtain the average transmission flow variance in the target tunnel;
[0297] Step 1940: Determine the number of multiple candidate logical paths based on the transmission flow per unit time, the path failure rate, and the average transmission flow variance.
[0298] Steps 1910 to 1940 are described in detail below:
[0299] In step 1910, the transmission flow per unit time in the target tunnel from the source node to the destination node is obtained.
[0300] According to an embodiment of the present disclosure, a target tunnel refers to a tunnel between a source node and a destination node, and the tunnel includes multiple candidate logical paths. The transmission flow per unit time refers to the number of messages sent from a source node to a destination node per unit time. The larger the transmission flow per unit time in the target tunnel from the source node to the destination node, the more messages the tunnel has to transmit. When the number of candidate logical paths remains unchanged, the transmission burden of each candidate logical path in the target tunnel will increase with the increase of the transmission flow per unit time in the target tunnel. Based on this, in order to apportion the transmission flow per unit time of the target tunnel, the transmission flow per unit time in the target tunnel is proportional to the number of multiple candidate logical paths. The more the transmission flow per unit time in the target tunnel, the larger the number of multiple candidate logical paths.
[0301] In step 1920, the path failure rate of the target tunnel is obtained.
[0302] According to an embodiment of the present disclosure, the path failure rate of the target tunnel refers to the probability that the candidate logical paths included in the target tunnel fail under normal circumstances. The higher the path failure rate of the target tunnel, the more candidate logical paths in the target tunnel are unavailable.
[0303] In step 1930, the average transmission flow variance in the target tunnel is obtained.
[0304] According to an embodiment of the present disclosure, the average transmission flow variance of the target tunnel refers to the variance of the transmission flow of each candidate logical path contained in the target tunnel. The larger the average transmission flow variance of the target tunnel, the more uneven the transmission flow of each candidate logical path of the target tunnel. Generally, the smaller the average transmission flow variance in the target tunnel, the more balanced the transmission flow of each candidate logical path of the target tunnel.
[0305] In step 1940, the number of multiple candidate logical paths is determined based on the transmission flow per unit time, the path failure rate, and the average transmission flow variance.
[0306] According to the embodiments of the present disclosure, after determining the number of messages sent from the source node to the destination node per unit time, the probability of failure of the candidate logical paths included in the target tunnel, and the variance of the transmission flow of each candidate logical path included in the target tunnel, the transmission capacity of multiple candidate logical paths in the target tunnel can be further derived. Based on the transmission capacity of multiple candidate logical paths in the target tunnel, the number of multiple candidate logical paths can be reasonably determined.
[0307] The specific method of “determining the number of multiple candidate logical paths based on the transmission flow per unit time, the path failure rate, and the average transmission flow variance” will be described in detail below.
[0308] The above-mentioned embodiments of steps 1910 to 1940 can determine a reasonable number of candidate logical paths according to the transmission flow per unit time in the target tunnel from the source node to the destination node, the path failure rate of the target tunnel, and the average transmission flow variance in the target tunnel. If the number of candidate logical paths in the tunnel is too small, congestion will occur arbitrarily when there are too many messages, thereby reducing the transmission efficiency. If the number of candidate logical paths in the tunnel is too large, it is easy to cause waste of resources. Based on this, determining a reasonable number of candidate logical paths can improve the transmission efficiency while reducing the waste of resources.
[0309] In one embodiment, referring to Fig. 20 , step 1940 includes:
[0310] Step 210: Determine the expected transmission flow per unit time of the target tunnel based on the transmission flow per unit time and the path failure rate;
[0311] Step 2020: Determine a target adjustment coefficient based on the average transmission flow variance;
[0312] Step 2030: Determine the number of multiple candidate logical paths based on the expected transmission flow per unit time and the target adjustment coefficient.
[0313] Steps 2010 to 2030 are described in detail below:
[0314] In step 210, based on the transmission flow per unit time and the path failure rate, the expected transmission flow per unit time of the target tunnel is determined.
[0315] According to an embodiment of the present disclosure, the expected transmission flow rate per unit time of the target tunnel refers to the number of packets successfully transmitted by the target tunnel per unit time when a candidate logical path contained in the target tunnel may fail. The expected transmission flow rate per unit time of the target tunnel can be obtained by multiplying the transmission flow rate per unit time by the path availability. Among them, the path availability refers to the probability that the path status of the candidate logical path contained in the target tunnel is normal, and the path availability is 1 minus the difference between the path failure rate and the path failure rate. For example, assuming that the transmission flow rate per unit time is 500MB and the path failure rate is 10%, based on this, it can be determined that the path availability is 90%. Multiplying the path availability by the transmission flow rate per unit time, it can be obtained that the expected transmission flow rate per unit time of the target tunnel is 450MB.
[0316] It is understandable that in order to apportion the expected transmission flow per unit time of the target tunnel, the expected transmission flow per unit time of the target tunnel is proportional to the number of candidate logical paths. The greater the expected transmission flow per unit time in the target tunnel, the greater the number of candidate logical paths.
[0317] In step 2020, a target adjustment coefficient is determined based on the average transmission flow variance.
[0318] According to the embodiments of the present disclosure, the larger the average transmission flow variance is, the more uneven the transmission flow of each candidate logical path of the target tunnel is. At this time, it is necessary to adjust the transmission flow corresponding to each candidate logical path in the target tunnel, and the target adjustment coefficient corresponds to the adjustment strength of the transmission flow corresponding to each candidate logical path in the target tunnel. It can be determined that the average transmission flow variance is proportional to the target adjustment coefficient, and the larger the average transmission flow variance is, the larger the target adjustment coefficient is.
[0319] It is understandable that the larger the target adjustment coefficient is, the greater the adjustment strength of each candidate logical path in the target tunnel is. Based on this, the number of candidate logical paths can be appropriately increased to balance the transmission flow of each candidate logical path. Therefore, the target adjustment coefficient is proportional to the number of candidate logical paths. The larger the target adjustment coefficient is, the larger the number of candidate logical paths is.
[0320] In step 2030, the number of multiple candidate logical paths is determined based on the expected transmission flow per unit time and the target adjustment coefficient.
[0321] According to an embodiment of the present disclosure, the product of the expected transmission flow per unit time and the target adjustment coefficient can be determined as the number of multiple candidate logical paths. For example, assuming that the expected transmission flow per unit time is 500MB and the target adjustment coefficient is 0.1, the product of the expected transmission flow per unit time and the target adjustment coefficient can be determined as the number of multiple candidate logical paths, that is, the number of candidate logical paths is 50.
[0322] In the process of determining the candidate logical paths, the embodiment of the above steps 2010 to 2030 not only takes into account the number of messages successfully transmitted by the target tunnel per unit time when the candidate logical paths included in the target tunnel may fail, but also takes into account the adjustment strength of the transmission flow corresponding to each candidate logical path in the target tunnel. Based on the above steps, a more reasonable number of candidate logical paths can be determined, which reduces resource waste and improves transmission efficiency.
[0323] Detailed description of step 420 and step 430
[0324] Since step 420 and step 430 are inseparable, these two steps will be described jointly below.
[0325] In step 420, a sending bitmap of the source node is obtained, where the sending bitmap indicates the message sending status of the source node for each candidate logical path.
[0326] In step 430, a reception status request is sent to the destination node, and a reception bitmap of the destination node is received, where the reception bitmap indicates the message reception status of the destination node for each candidate logical path.
[0327] In one embodiment, referring to Fig.21 , the sending bitmap and the receiving bitmap are generated periodically, and step 420 includes:
[0328] Step 2110: In the current cycle, obtain the sending bitmap of the source node in the previous cycle;
[0329] Step 430 includes:
[0330] Step 2120: Send a receive status request to the destination node in the current cycle, and receive the receive bitmap of the destination node in the previous cycle.
[0331] Step 2110 and step 2120 are described in detail below:
[0332] In step 2110, in the current cycle, the sending bitmap of the source node in the previous cycle is obtained.
[0333] According to an embodiment of the present disclosure, the sending bitmap maintained by the source node is generated on a periodic basis, and the sending bitmap corresponding to each period is used to indicate the message sending status of the source node for each candidate logical path within the period. When the current period has not yet ended, the source node cannot obtain the complete sending bitmap of the current period, but the sending bitmap of the period before the current period is complete. In order to more accurately judge the path status of multiple candidate logical paths, the source node will select the sending bitmap of the previous period closest to the current period for comparison. Among them, the length of the period can be specifically determined according to the size of the data center network and the application scenario. For example: when the message transmission method of the embodiment of the present disclosure is applied to an application scenario with high timeliness requirements, the length of a period can be set to 4ms.
[0334] The specific method of "obtaining the sending bitmap of the source node in the previous cycle in the current cycle" will be described in detail below.
[0335] In step 2120, a reception status request is sent to the destination node in the current cycle, and a reception bitmap of the destination node in the previous cycle is received.
[0336] According to an embodiment of the present disclosure, the receiving bitmap maintained by the destination node is generated on a periodic basis, and the receiving bitmap corresponding to each period is used to indicate the message receiving status of the destination node for each candidate logical path within the period. When the current period has not yet ended, the destination node cannot obtain the complete receiving bitmap of the current period, but the receiving bitmap of the period before the current period is complete. In order to more accurately judge the path status of multiple candidate logical paths, the destination node will select the receiving bitmap of the previous period closest to the current period to send to the source node. Exemplarily, refer to Fig. 22 , assuming that the current cycle is the second cycle, the previous cycle of the second cycle is the first cycle, the source node sends a receive status request to the destination node in the second cycle, and after receiving the receive status request, the destination node returns the receive bitmap of the first cycle to the source node.
[0337] It should be noted that, in order to accurately determine the path states of multiple candidate logical paths, the periods corresponding to the sending bitmap and the receiving bitmap used for comparison are the same.
[0338] The specific method of "sending a reception status request to the destination node in the current cycle and receiving the reception bitmap of the destination node in the previous cycle" will be described in detail below.
[0339] In the above-mentioned embodiment of steps 2110 to 2120, the source node sends a reception status request to the destination node in the current cycle, and receives the reception bitmap of the previous cycle returned by the destination node. By determining the path status of multiple candidate logical paths based on the transmission bitmap of the previous cycle closest to the current cycle and the reception bitmap of the previous cycle, the path status of multiple candidate logical paths with more accuracy and better real-time performance can be determined.
[0340] In one embodiment, referring to Fig.23 , step 2110 includes:
[0341] Step 2310: Initialize each bit of the sending bitmap to a first value, where the number of bits of the sending bitmap is equal to the number of the plurality of candidate logical paths;
[0342] Step 2320: If the source node sends a receive status request on the candidate logical path in the previous cycle, set the bit corresponding to the candidate logical path to the second value.
[0343] Step 2310 and step 2320 are described in detail below:
[0344] In step 2310, each bit of the sending bitmap is initialized to a first value, and the number of bits of the sending bitmap is equal to the number of the plurality of candidate logical paths.
[0345] According to an embodiment of the present disclosure, in order to facilitate the judgment of the sending status of each candidate logical path, the sending status corresponding to each candidate logical path is maintained in the sending bitmap, the number of bits of the sending bitmap is also equal to the number of multiple candidate logical paths, and each bit in the sending bitmap corresponds to the sending status of a candidate logical path. Further, in the sending bitmap, the bit corresponding to the candidate logical path is a first value that can be used to indicate that there is currently no receiving status request to use the candidate logical path to send to the destination node. At the beginning of each cycle, in order to facilitate the statistics of the sending status of each candidate logical path, it is necessary to initialize each bit of the sending bitmap to a first value. Among them, the first value can be set to 0 or any value.
[0346] For example, refer to Fig.24 , assuming that there are currently 16 candidate logical paths, the number of bits in the sending bitmap is equal to 16. When the first value is 0, the bits corresponding to the 16 candidate logical paths in the sending bitmap need to be set to 0 at the beginning of each cycle.
[0347] In step 2320, if the source node sends a receive status request on the candidate logical path in the previous cycle, the bit corresponding to the candidate logical path is set to a second value.
[0348] According to an embodiment of the present disclosure, in the transmission bitmap, the bit corresponding to the candidate logical path is the second value, which can be used to indicate that there is currently a reception status request to use the candidate logical path to send to the destination node. Since the transmission bitmap obtained by the source node in step 2110 is the previous cycle, when the source node sends a reception status request on the candidate logical path in the previous cycle, the bit corresponding to the candidate logical path in the transmission bitmap is set to the second value. The second value can be set to 1 or any value, but the second value is a value different from the first value.
[0349] It can be understood that, in the previous cycle, only when there is a receiving state request to use a candidate logical path for transmission, the bit corresponding to the candidate logical path on the sending bitmap will be changed from the first value to the second value.
[0350] For example, refer to Fig.24 , assuming that there are currently 16 candidate logical paths, the first value is 0, and the second value is 1. At the beginning of the previous cycle, the bits corresponding to the 16 candidate logical paths in the transmission bitmap are all set to 0. If the source node sends a receive status request on candidate logical path 2 in the previous cycle, the bit corresponding to candidate logical path 2 is set to 1.
[0351] In the above-mentioned embodiment of step 2310 to step 2320, each bit of the transmission bitmap is initialized to the first value at the beginning of each cycle, and the bit corresponding to the candidate logical path is set to the second value when the source node sends a receiving status request on the candidate logical path. This method can accurately record the transmission status of each candidate logical path in each cycle, so as to facilitate the subsequent determination of the path status of each candidate logical path according to the transmission status and receiving status of each candidate logical path.
[0352] In one embodiment, referring to Fig.25 , step 2120 includes:
[0353] Step 2510: Add a reception status request to the first tunnel encapsulation field of the first data message.
[0354] and sending a first data message to the destination node;
[0355] Step 2520: Receive a second data message sent by the destination node, wherein the second tunnel encapsulation field of the second data message carries a receiving bitmap of the destination node in a previous cycle.
[0356] The following describes step 2510 and step 2520 in detail:
[0357] In step 2510, a receive status request is added to a first tunnel encapsulation field of a first data packet, and the first data packet is sent to a destination node.
[0358] According to an embodiment of the present disclosure, the first tunnel encapsulation field refers to a field in which the source node encapsulates the target message to be transmitted to the destination node, and the first tunnel encapsulation field encapsulates a reception status request. The first data message refers to a message obtained after the source node uses the first tunnel encapsulation field to encapsulate the target message to be transmitted to the destination node, such as Fig.26 It can be understood that the embodiment of the present disclosure reduces the transmission overhead by adding the reception status request to the first tunnel encapsulation field of the first data message so that the target message sent by the source node to the destination node carries the reception status request instead of sending a separate reception status request to the destination node.
[0359] In step 2520, a second data packet sent by the destination node is received, and the second tunnel encapsulation field of the second data packet carries a reception bitmap of the destination node in the previous cycle.
[0360] According to an embodiment of the present disclosure, the second tunnel encapsulation field refers to a field used by the destination node to encapsulate a message to be transmitted to the source node, and the second tunnel encapsulation field encapsulates a reception bitmap of the destination node in the previous cycle. The second data message refers to a message obtained after the destination node uses the second tunnel encapsulation field to encapsulate the message to be transmitted to the source node, such as Fig. 27 As shown. It can be understood that the embodiment of the present disclosure reduces the transmission overhead by adding the reception bitmap of the previous cycle to the second tunnel encapsulation field of the second data packet, so that the message sent by the destination node to the source node carries the reception bitmap of the previous cycle, instead of sending a data packet of the reception bitmap of the previous cycle to the source node alone.
[0361] The source node of the embodiment of the above steps 2510 to 2520 adds the reception status request to the first tunnel encapsulation field of the first data message, so that the target message sent by the source node to the destination node carries the reception status request, and there is no need to send a separate reception status request to the destination node, thereby reducing the transmission overhead. Moreover, the destination node adds the reception bitmap of the previous cycle to the second tunnel encapsulation field of the second data message, so that the message sent by the destination node to the source node carries the reception bitmap of the previous cycle, and there is no need to send a data packet of the reception bitmap of the previous cycle to the source node separately, thereby further reducing the transmission overhead.
[0362] In one embodiment, the first tunnel encapsulation field includes a first tag field and a reception status request field, the second tunnel encapsulation field includes a second tag field, a reception status response field and a reception bitmap field, the first tag field indicates that the first data message carries the reception status request, and the second tag field indicates that the second data message carries the reception status response;
[0363] In one embodiment, referring to Fig.28 , step 2510 includes:
[0364] Step 2810: Set the first tag field in the first tunnel encapsulation field; add the receive status request to the receive status request field in the first tunnel encapsulation field, and send the first data message to the destination node;
[0365] The second data of step 2520 is generated by:
[0366] Step 2820: set the second tag field in the second tunnel encapsulation field; add the reception status response to the reception status response field in the second tunnel encapsulation field; and add the reception bitmap to the reception bitmap field in the second tunnel encapsulation field.
[0367] Step 2810 and step 2820 are described in detail below.
[0368] In step 2810, the first tag field in the first tunnel encapsulation field is set; a receive status request is added to the receive status request field in the first tunnel encapsulation field, and a first data message is sent to the destination node.
[0369] According to the embodiments of the present disclosure, referring to Fig.29 The first tag field is a field in the first tunnel encapsulation field, and the first tag field is used to indicate whether the first data message carries a receive status request. The receive status request field is also a field in the first tunnel encapsulation field, and the receive status request field can be used to encapsulate the receive status request.
[0370] If the target message carries a receive status request, that is, the receive status request field of the first data message is encapsulated with a receive status request, the first tag field of the first data message can be set to a third value, and the third value can be 1 or other values. Moreover, the first tunnel encapsulation field can also include a first cycle count field, and the first cycle count field is used to indicate the cycle corresponding to the receive bitmap requested by the source node. In the case where the target message carries a receive status request, the first cycle count field will be filled with the number of cycles corresponding to the receive bitmap requested by the source node. If the target message does not carry a receive status request, the receive status request field of the first data message is not filled with a receive status request, and the first cycle count field is not filled with the number of cycles. In this case, the first tag field of the first data message can be set to a fourth value, and the fourth value can be 0 or other values, and the fourth value is a value different from the third value.
[0371] In step 2820, the second tag field in the second tunnel encapsulation field is set; a reception status response is added to the reception status response field in the second tunnel encapsulation field; and a reception bitmap is added to the reception bitmap field in the second tunnel encapsulation field.
[0372] According to the embodiments of the present disclosure, referring to Fig.30 The second tag field refers to a field in the second tunnel encapsulation field, and the second tag field is used to indicate whether the second data message carries a reception status response. The reception status response refers to the confirmation response returned to the source node after the destination node receives the target message carrying the reception status request sent by the source node. The reception status response field is also a field in the second tunnel encapsulation field, and the reception status response field can be used to encapsulate the reception status response. The reception bitmap field is also a field in the second tunnel encapsulation field, and the reception bitmap field can be used to encapsulate the reception bitmap.
[0373] If the second data message sent by the current destination node to the source node is a confirmation response returned to the source node by the destination node after receiving the target message sent by the source node carrying the reception status request, the reception status response can be added to the reception status response field in the second tunnel encapsulation field. If the current destination node returns a reception bitmap to the source node, that is, the reception bitmap field of the second data message is encapsulated with a reception bitmap, the second tag field of the second data message can be set to a fifth value, and the fifth value can be 1 or other values. Moreover, the second tunnel encapsulation field can also include a second cycle count field, and the second cycle count field is used to indicate the cycle corresponding to the reception bitmap. In the case where the reception bitmap field of the second data message is encapsulated with a reception bitmap, the second cycle count field will be filled with the number of cycles corresponding to the reception bitmap. If the message sent by the destination node to the source node does not carry the reception bitmap of the previous cycle, the reception bitmap field of the second data message is not encapsulated with a reception bitmap, and the second cycle count field is not filled with the number of cycles. In this case, the second tag field of the second data message can be set to a sixth value, and the sixth value can be 0 or other values, and the sixth value is a value different from the fifth value.
[0374] The source node of the embodiment of the above steps 2810 to 2820 does not need to send a separate receive status request to the destination node by setting the first tag field in the first tunnel encapsulation field and adding the receive status request to the receive status request field in the first tunnel encapsulation field, thereby reducing not only the transmission overhead but also the message overhead. Moreover, the destination node further reduces the transmission overhead and the message overhead by setting the second tag field in the second tunnel encapsulation field, adding the receive status response to the receive status response field in the second tunnel encapsulation field, and adding the receive bitmap to the receive bitmap field in the second tunnel encapsulation field.
[0375] In one embodiment, referring to Fig.31 , step 2820 includes:
[0376] Step 3110: Initialize each bit of the receiving bitmap to a first value, where the number of bits of the receiving bitmap is equal to the number of the plurality of candidate logical paths;
[0377] Step 3120: If in the previous cycle, the destination node receives the first data message with the reception status request added in the first tunnel encapsulation field on the candidate logical path, set the bit corresponding to the candidate logical path to the second value;
[0378] Step 3130: Add the receive bitmap to the receive bitmap field in the second tunnel encapsulation field.
[0379] Steps 3110 to 3130 are described in detail below.
[0380] In step 3110, each bit of the receiving bitmap is initialized to a first value, and the number of bits of the receiving bitmap is equal to the number of the plurality of candidate logical paths.
[0381] According to an embodiment of the present disclosure, in order to facilitate the judgment of the receiving status of each candidate logical path, the receiving status corresponding to each candidate logical path is maintained in the receiving bitmap, the number of bits of the receiving bitmap is also equal to the number of multiple candidate logical paths, and each bit in the receiving bitmap corresponds to the receiving status of a candidate logical path. Furthermore, in the receiving bitmap, the bit corresponding to the candidate logical path is a first value that can be used to indicate that the current destination node has not received a message carrying a receiving status request for transmission using the candidate logical path. At the beginning of each cycle, in order to facilitate the statistics of the receiving status of each candidate logical path, it is necessary to initialize each bit of the receiving bitmap to a first value. Among them, the first value can be set to 0 or to any value.
[0382] For example, refer to Fig.32 , assuming that there are currently 16 candidate logical paths, the number of bits in the receiving bitmap is equal to 16. When the first value is 0, at the beginning of each cycle, the bits corresponding to the 16 candidate logical paths in the receiving bitmap need to be set to 0.
[0383] In step 3120, if the destination node receives the first data packet with a reception status request added in the first tunnel encapsulation field on the candidate logical path in the previous cycle, the bit corresponding to the candidate logical path is set to the second value.
[0384] According to an embodiment of the present disclosure, in the receiving bitmap, the bit corresponding to the candidate logical path is the second value, which can be used to indicate that the current destination node has received a message carrying a receiving status request that is transmitted using the candidate logical path. Since the receiving bitmap encapsulated by the destination node in step 2820 is from the previous cycle, when the destination node receives a message carrying a receiving status request that is transmitted using the candidate logical path in the previous cycle, the bit corresponding to the candidate logical path in the receiving bitmap is set to the second value. The second value can be set to 1 or any value, but the second value is a value different from the first value.
[0385] It can be understood that, in the previous cycle, only when the candidate logical path receives a message carrying a receiving status request, the bit corresponding to the candidate logical path on the receiving bitmap will be changed from the first value to the second value.
[0386] For example, refer to Fig.32, assuming that there are currently 16 candidate logical paths, the first value is 0, and the second value is 1. At the beginning of the previous cycle, the bits corresponding to the 16 candidate logical paths in the receive bitmap are all set to 0. If in the previous cycle, the destination node receives a message carrying a receive status request that is transmitted using candidate logical path 2, the bit corresponding to candidate logical path 2 is set to 1.
[0387] In step 3130, the receive bitmap is added to the receive bitmap field in the second tunnel encapsulation field.
[0388] It can be understood that the detailed process of "adding the receiving bitmap to the receiving bitmap field in the second tunnel encapsulation field" has been described above, and will not be repeated here.
[0389] In the above-mentioned embodiment of step 3110 to step 3130, each bit of the reception bitmap is initialized to the first value at the beginning of each cycle, and when the destination node receives a message carrying a reception status request transmitted using a candidate logical path, the bit corresponding to the candidate logical path is set to the second value. This method can accurately record the reception status of each candidate logical path in each cycle, so as to facilitate the subsequent determination of the path status of each candidate logical path according to the transmission status and reception status of each candidate logical path.
[0390] In one embodiment, referring to Fig.33 , step 2510 includes:
[0391] Step 3310: Obtain the first number of forward data messages sent by the source node in the current period through the candidate logical path; add a receive status request to the first tunnel encapsulation field of the first number of forward data messages, generate a first data message, and send the first data message to the destination node;
[0392] The second data message of step 2520 is generated in the following manner:
[0393] Step 3320: Obtain the first number of reverse data packets sent by the destination node in the current cycle through the candidate logical path; add the receiving bitmap to the second tunnel encapsulation field of the first number of reverse data packets to generate a second data packet.
[0394] Step 3310 and step 3320 are described in detail below.
[0395] In step 3310, obtain the first number of forward data packets sent by the source node through the candidate logical path in the current cycle; add a receive status request to the first tunnel encapsulation field of the first number of forward data packets, generate a first data packet, and send the first data packet to the destination node.
[0396] According to an embodiment of the present disclosure, a forward data message refers to a target message sent by a source node to a destination node. It is understandable that in each period, the source node can send multiple forward data messages to the destination node through a candidate logical path, but if each forward data message carries a receive status request, it will bring huge message overhead. In order to reduce the message overhead, the source node only encapsulates the receive status request in the first first number of forward data messages sent through the candidate logical path, where the first number can be determined based on the actual message transmission situation. In general, in order to reduce the message overhead and achieve lightweight transmission, the first number is set to 1.
[0397] For example, here combined Fig.34 Step 3310 is explained. Assuming that the first number is 1, for cycle 1, the first forward data message sent by the source node through the candidate logical path in cycle 1 is obtained, the reception status request is added to the first tunnel encapsulation field of the first forward data message, a first data message is generated, and the first data message is sent to the destination node, such as Fig.34 In cycle 1, the source node first points to the destination node as shown by the arrow.
[0398] In step 3320, the first number of reverse data packets sent by the destination node of the current cycle through the candidate logical path are obtained; the receiving bitmap is added to the second tunnel encapsulation field of the first number of reverse data packets to generate a second data packet.
[0399] According to an embodiment of the present disclosure, a reverse data message refers to a message sent by a destination node to a source node. It is understandable that in each period, a destination node can send multiple reverse data messages to a source node through a candidate logical path, but if each reverse data message carries a receiving bitmap of the destination node in the previous period, it will bring huge message overhead. In order to reduce the message overhead, the destination node only encapsulates the receiving bitmap in the first first number of reverse data messages sent through the candidate logical path.
[0400] For example, here combined Fig.34 Step 3320 is explained. Assuming that the first number is 1, for cycle 1, the first reverse data message sent by the destination node through the candidate logical path in cycle 1 is obtained, the receiving bitmap is added to the second tunnel encapsulation field of the first reverse data message, a second data message is generated, and the second data message is sent to the source node, such as Fig.34 In cycle 1 the destination node is first indicated by an arrow pointing to the source node.
[0401] In the above-mentioned embodiment of steps 3310 to 3320, the source node only encapsulates the reception status request in the first first number of forward data messages sent through the candidate logical path, and does not need to encapsulate the reception status request in each forward data message, thereby reducing the message overhead. Similarly, the destination node only encapsulates the reception bitmap in the first first number of reverse data messages sent through the candidate logical path, and does not need to encapsulate the reception bitmap in each reverse data message, thereby further reducing the message overhead.
[0402] In one embodiment, referring to Fig.35 , the first numbers of step 3310 and step 3320 can be determined by:
[0403] Step 3510: Obtain an average number of forward data messages sent in a second number of cycles before the current cycle;
[0404] Step 3520: Obtain an average packet loss rate of forward data messages sent in a second number of cycles before the current cycle;
[0405] Step 3530: Obtain the message type of the first forward data message to be sent in the current cycle;
[0406] Step 3540: Determine the message sending priority based on the message type;
[0407] Step 3550: Determine a first number based on the average number, the average packet loss rate, and the message sending priority.
[0408] Step 3510 and step 3550 are described in detail below:
[0409] In step 3510, the average number of forward data messages sent in a second number of cycles before the current cycle is obtained.
[0410] According to an embodiment of the present disclosure, the number of forward data packets sent by the source node through each candidate logical path in each cycle is not exactly the same. The method of calculating the average number of forward data packets sent in the second number of cycles before the current cycle refers to the average number of forward data packets sent by the source node through each candidate logical path in the second number of cycles before the current cycle. Among them, the second number can be determined based on the actual message transmission situation, and the second number is proportional to the calculation accuracy of the average number of forward data packets sent. The larger the second number, the higher the accuracy of the calculated average number of forward data packets.
[0411] It can be understood that the greater the average number of forward data packets sent in the second number of cycles before the current cycle, the greater the flow of packets transmitted by each candidate logical path. Accordingly, the first number can be set to a larger value. Therefore, it can be determined that the average number of forward data packets sent in the second number of cycles before the current cycle is proportional to the first number.
[0412] In step 3520, an average packet loss rate of forward data messages sent in a second number of cycles before the current cycle is obtained.
[0413] According to an embodiment of the present disclosure, the average packet loss rate of forward data messages sent in the second number of cycles before the current cycle refers to the average packet loss rate of forward data messages sent by the source node through each candidate logical path in the second number of cycles before the current cycle. It can be understood that the greater the average packet loss rate of forward data messages sent in the second number of cycles before the current cycle, the greater the packet loss rate of messages sent by the source node to the destination node, and correspondingly, the greater the packet loss rate of messages carrying receive status requests. Based on this, in order to ensure that the destination node can receive the message carrying the receive status request, the first number can be set to a larger value. Therefore, it can be determined that the average packet loss rate of forward data messages sent in the second number of cycles before the current cycle is proportional to the first number.
[0414] In step 3530, the message type of the first forward data message to be sent in the current cycle is obtained.
[0415] According to an embodiment of the present disclosure, the message type of the forward data message refers to the type of application corresponding to the forward data message. Figure 1C If the type of external application connected to the source node is important conference live broadcast, the message type of the forward data message is also important conference live broadcast type; if the type of external application connected to the source node is satellite live broadcast, the message type of the forward data message is also satellite live broadcast type.
[0416] In step 3540, based on the message type, the message sending priority is determined.
[0417] According to an embodiment of the present disclosure, the message sending priority is used to indicate the allowable packet loss rate of the message. The higher the message sending priority, the lower the allowable packet loss rate of the message. Moreover, the message sending priority varies with the immediacy of the message type. Generally, the higher the immediacy of the message type, the higher the message sending priority. Exemplarily, there are currently message 1 and message 2. The message type of message 1 is a live broadcast of an important meeting, and the message type of message 2 is an advertisement with low immediacy requirements. It can be determined that the immediacy of message 1 is higher than that of message 2, and the sending priority of message 1 is higher than the sending priority of message 2.
[0418] It can be understood that the higher the message sending priority of the message currently sent by the source node to the destination node, the more important the message type currently being processed is. In this case, the first number also increases accordingly to improve resistance to packet loss and ensure that the destination node can receive the receive status request and the source node can receive the receive bitmap.
[0419] In step 3550, a first number is determined based on the average number, the average packet loss rate, and the message sending priority.
[0420] It can be understood that the method for determining the first number based on the average number, the average packet loss rate and the message sending priority includes: determining the fifth score based on the average number; determining the sixth score based on the average packet loss rate; determining the seventh score based on the message sending priority; determining the eighth score based on the fifth score, the sixth score and the seventh score; and determining the first number based on the eighth score.
[0421] The fifth score can be determined based on the average number by looking up a table. The fifth score corresponding to the average number is obtained according to the corresponding relationship table between the average number and the fifth score. The fifth score can also be determined based on the average number by substitution. The average number is substituted into a preset formula of the average number and the fifth score to obtain the fifth score corresponding to the average number.
[0422] The sixth score can be determined based on the average packet loss rate by looking up a table. The sixth score corresponding to the average packet loss rate is obtained according to the corresponding relationship table between the average packet loss rate and the sixth score. The sixth score can also be determined based on the average packet loss rate by substitution. The average packet loss rate is substituted into a preset formula of the average packet loss rate and the sixth score to obtain the sixth score corresponding to the average packet loss rate.
[0423] The seventh score can be determined based on the message sending priority by a table lookup method. According to the correspondence table between the message sending priority and the seventh score, the seventh score corresponding to the message sending priority is obtained. The seventh score can also be determined based on the message sending priority by a substitution method. Substitute the message sending priority into the formula of the preset message sending priority and the seventh score to obtain the seventh score corresponding to the message sending priority.
[0424] The eighth score may be the sum of the fifth score, the sixth score and the seventh score, or the average of the fifth score, the sixth score and the seventh score. Furthermore, different weights may be assigned to the fifth score, the sixth score and the seventh score according to the average number, the average packet loss rate and the message sending priority, and the eighth score may be determined as the weighted sum of the fifth score, the sixth score and the seventh score.
[0425] The first number can be determined based on the eighth fraction by looking up a table. The first number corresponding to the eighth fraction is obtained according to the corresponding relationship table between the eighth fraction and the first number. The first number can be determined based on the eighth fraction by substitution. The eighth fraction is substituted into a preset formula of the eighth fraction and the first number to obtain the first number corresponding to the eighth fraction.
[0426] The embodiment of the above steps 3510 to 3550 can comprehensively determine the size of the first number based on the average number of forward data messages sent in the second number of cycles before the current cycle, the average packet loss rate of the forward data message, and the message sending priority of the first forward data message to be sent in the current cycle. Because the importance of the above three factors is taken into account, the first number determined is more reasonable. Not only is the possibility of the destination node being unable to receive the receiving status request and the source node being unable to receive the receiving bitmap due to the first number being too small reduced, but also the problem of large message overhead caused by too many first numbers is avoided.
[0427] In one embodiment, referring to Fig.36 , step 3310 includes:
[0428] Step 3610: Send a first data message corresponding to each candidate logical path to a destination node through each candidate logical path;
[0429] Step 3320 includes:
[0430] Step 3620: If a data packet carrying a receiving bitmap is received from any candidate logical path among the multiple candidate logical paths, the data packet is regarded as a received second data packet.
[0431] Steps 3610 to 3620 are described in detail below:
[0432] In step 3610, a first data packet corresponding to each candidate logical path is sent to a destination node through each candidate logical path.
[0433] According to an embodiment of the present disclosure, there are multiple candidate logical paths in the tunnel between the source node and the destination node. When the source node sends the first data message carrying the reception status request to the destination node, it does not send it by selecting a certain candidate logical path, but sends it through each candidate logical path in the tunnel. This means that as long as there is a candidate logical path in the tunnel whose path status is normal, the destination node can receive the first data message carrying the reception status request.
[0434] In step 3620, if a data packet carrying a receiving bitmap is received from any candidate logical path among the multiple candidate logical paths, the data packet is taken as the received second data packet.
[0435] According to an embodiment of the present disclosure, because there are multiple candidate logical paths in the tunnel between the source node and the destination node, when the destination node sends a data message carrying a receive bitmap to the source node, it does not send it by selecting a certain candidate logical path, but sends it through each candidate logical path in the tunnel. This means that as long as there is a candidate logical path in the tunnel whose path state is normal, the source node can receive the data message carrying the receive bitmap. Furthermore, as long as there is a candidate logical path in the tunnel whose path state is normal, the source node can determine the path state of each candidate logical path, thereby quickly perceiving the faulty candidate logical path.
[0436] The source node of the embodiment of the above steps 3610 to 3620 sends the first data message carrying the reception status request through each candidate logical path in the tunnel. As long as there is a candidate logical path in the tunnel whose path status is normal, the destination node can receive the first data message carrying the reception status request. Similarly, the destination node sends the data message carrying the reception bitmap through each candidate logical path in the tunnel. As long as there is a candidate logical path in the tunnel whose path status is normal, the source node can determine the path status of each candidate logical path, thereby quickly perceiving the faulty candidate logical path, and transferring the message to the non-faulty candidate logical path, thereby improving the data flow continuity and service availability in message transmission.
[0437] Detailed description of step 440
[0438] Step 440: Determine the path status of each candidate logical path based on the comparison between the sending bitmap and the receiving bitmap.
[0439] In one embodiment, referring to Fig.37, step 440 includes:
[0440] Step 3710: If a bit corresponding to a candidate logical path in the sending bitmap is the second value, and a bit corresponding to the candidate logical path in the receiving bitmap is the second value, determine that the path state of the candidate logical path is normal;
[0441] Step 3720: If a bit corresponding to a candidate logical path in the sending bitmap is the second value, but a bit corresponding to the candidate logical path in the receiving bitmap is the first value, determine that the path state of the candidate logical path is faulty;
[0442] Step 3730: If the bit corresponding to a candidate logical path in the sending bitmap is the first value, determine that the path state of the candidate logical path is inactive.
[0443] It should be noted that step 3710, step 3720 and step 3730 are not connected, but are three parallel steps. Step 3710, step 3720 and step 3730 are described in detail below:
[0444] In step 3710, if a bit corresponding to a candidate logical path in the sending bitmap is the second value and a bit corresponding to the candidate logical path in the receiving bitmap is the second value, it is determined that the path state of the candidate logical path is normal.
[0445] According to an embodiment of the present disclosure, if the bit corresponding to a candidate logical path in the sending bitmap is the second value, it means that there was a message carrying a receive status request in the previous cycle that used the candidate logical path to send to the destination node. If the bit corresponding to the candidate logical path in the receiving bitmap is the second value, it means that the destination node in the previous cycle received a message carrying a receive status request that was transmitted using the candidate logical path. Therefore, if the bit corresponding to a candidate logical path in the sending bitmap is the second value, and the bit corresponding to the candidate logical path in the receiving bitmap is the second value, it can be determined that the path state of the candidate logical path is normal.
[0446] For example, refer to Fig.38 , assuming that the first value is 0 and the second value is 1. For candidate logical path 1, the bit corresponding to candidate logical path 1 in the sending bitmap is 1, and the bit corresponding to candidate logical path 1 in the receiving bitmap is 1, it can be determined that the path state of candidate logical path 1 is normal, Fig.38 A normal path status may be indicated by 1, and a path failure may be indicated by 0.
[0447] In step 3720, if a bit corresponding to a candidate logical path in the sending bitmap is the second value, but a bit corresponding to the candidate logical path in the receiving bitmap is the first value, the path state of the candidate logical path is determined to be faulty.
[0448] According to an embodiment of the present disclosure, if the bit corresponding to a candidate logical path in the sending bitmap is the second value, it means that there was a message carrying a receive status request in the previous cycle that used the candidate logical path to send to the destination node. If the bit corresponding to a candidate logical path in the receiving bitmap is the first value, it means that the destination node did not receive the message carrying the receive status request that was transmitted using the candidate logical path in the previous cycle. It can be determined that there is packet loss on the candidate logical path. Therefore, if the bit corresponding to a candidate logical path in the sending bitmap is the second value, and the bit corresponding to the candidate logical path in the receiving bitmap is the first value, it can be determined that the path state of the candidate logical path is faulty.
[0449] For example, refer to Fig.38 , assuming that the first value is 0 and the second value is 1. For candidate logical path 4, the bit corresponding to candidate logical path 4 in the sending bitmap is 1, and the bit corresponding to candidate logical path 4 in the receiving bitmap is 0, it can be determined that the path state of candidate logical path 4 is faulty, Fig.38 A normal path status may be indicated by 1, and a path failure may be indicated by 0.
[0450] It is understandable that in some boundary scenarios, it is possible that the bit corresponding to a candidate logical path in the sending bitmap is the first value, but the bit corresponding to the candidate logical path in the receiving bitmap is the second value. In this case, the default candidate logical path is normal.
[0451] According to an embodiment of the present disclosure, if the bit corresponding to a candidate logical path in the sending bitmap is the first value, it means that there is no message carrying a receive status request sent to the destination node using the candidate logical path in the previous cycle. If the bit corresponding to the candidate logical path in the receiving bitmap is the second value, it means that the destination node has received a message carrying a receive status request that was transmitted using the candidate logical path in the previous cycle. The reason for this situation may be that there is congestion on the candidate logical path, resulting in the message carrying the receive status request sent using the candidate logical path before the previous cycle being delayed until the previous cycle to reach the destination node. Based on this, it can be assumed that the candidate logical path is normal.
[0452] The specific method of “if a bit corresponding to a candidate logical path in the sending bitmap is the second value, but the bit corresponding to the candidate logical path in the receiving bitmap is the first value, determining that the path state of the candidate logical path is faulty” will be described in detail below.
[0453] In step 3730, if the bit corresponding to a candidate logical path in the transmission bitmap is the first value, the path state of the candidate logical path is determined to be inactive.
[0454] According to an embodiment of the present disclosure, if the bit corresponding to a candidate logical path in the sending bitmap is the first value, it means that there is no message carrying a receive status request using the candidate logical path to send to the destination node in the previous cycle. If the bit corresponding to a candidate logical path in the receiving bitmap is the first value, it means that the destination node did not receive a message carrying a receive status request transmitted using the candidate logical path in the previous cycle.
[0455] It should be noted that if the source node has sent messages to the destination node in the last cycle, then the first number of messages among these messages must carry a receive status request, and the messages carrying the receive status request will reach the destination node through each candidate logical path from the source node to the destination node. Based on this, if there is no message carrying a receive status request sent to the destination node using a candidate logical path in the last cycle, and the destination node has not received a message carrying a receive status request transmitted using the candidate logical path, it can be determined that the source node did not send a message to the destination node in the last cycle. Therefore, if the corresponding bit of a candidate logical path in the sending bitmap is the first value, and the corresponding bit of the candidate logical path in the receiving bitmap is the first value, it can be determined that the path state of the candidate logical path is inactive. In this case, the path state of the candidate logical path can also be defaulted to normal.
[0456] For example, refer to Fig.38 , assuming that the first value is 0 and the second value is 1. For candidate logical path 13, the bit corresponding to candidate logical path 13 in the sending bitmap is 0, and the bit corresponding to candidate logical path 13 in the receiving bitmap is 0, it can be determined that the path state of candidate logical path 13 is inactive (the default path state is inactive, which is a normal situation), Fig.38 A normal path status may be indicated by 1, and a path failure may be indicated by 0.
[0457] In the embodiment of the above-mentioned steps 3710 to 3730, for a certain candidate logical path, the path status of this candidate logical path can be quickly judged based on the bit corresponding to the candidate logical path in the sending bitmap and the bit corresponding to the candidate logical path in the receiving bitmap, without spending a lot of time to detect the status of the switching node in the candidate logical path, thereby improving the speed of determining the path status of the candidate logical path.
[0458] In one embodiment, the transmit bitmap and the receive bitmap are transmitted periodically;
[0459] Reference Fig.39 , step 3720 includes:
[0460] Step 3910: If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in multiple consecutive cycles are all the first value, determine that the path state of the candidate logical path is faulty.
[0461] The following describes step 3910 in detail:
[0462] According to an embodiment of the present disclosure, the sending bitmap and the receiving bitmap are sent periodically, the source node side maintains a sending bitmap of multiple consecutive cycles, and the destination node side maintains a receiving bitmap of multiple consecutive cycles. And after receiving the message carrying the receiving status request sent by the source node in each cycle, the destination node will return the receiving bitmap of the previous cycle of the current cycle to the destination node. After receiving the receiving bitmap of the previous cycle of the current cycle, the destination node will also save the receiving bitmap.
[0463] It can be understood that when the message transmission method of the embodiment of the present disclosure is applied to an actual network, due to the congestion level of the switching node and other reasons, if the path state of the candidate logical path is evaluated based on the path state of a single cycle, the error rate of the path state of the candidate logical path determined by the source node is relatively large. For example: there is a probability of packet loss in the candidate logical path. If in the previous cycle, the message discarded in the candidate logical path is exactly the message carrying the reception status request, then the destination node corresponding to the candidate logical path cannot receive the message carrying the reception status request. Since in the reception bitmap maintained by the destination node side, only when the destination node receives the message carrying the reception status request transmitted using the candidate logical path, the bit corresponding to the candidate logical path will be changed from the first value to the second value. Then, in the case where the message discarded in the candidate logical path is exactly the message carrying the reception status request, if the path state of the candidate logical path is evaluated based on the path state of a single cycle, the candidate logical path will be determined to be faulty. However, in fact, the state of the candidate logical path is normal, which will result in a large error rate in the path state of the candidate logical path determined by the source node.
[0464] Based on the above reasons, in order to more accurately judge the path status of a candidate logical path, for a certain candidate logical path, the embodiment of the present disclosure can make a comprehensive judgment on the path status of the candidate logical path based on the bits corresponding to the candidate logical path in the sending bitmap sent by the source node in multiple consecutive cycles, and the bits corresponding to the candidate logical path in the receiving bitmap received by the source node in multiple consecutive cycles. The number of consecutive multiple cycles can be determined based on the packet loss probability of each candidate logical path. Generally, the number of consecutive multiple cycles can be set to 10.
[0465] Further, for a candidate logical path, if the bits corresponding to the candidate logical path in the sending bitmap sent by the source node in multiple consecutive cycles are all the second value, and the bits corresponding to the candidate logical path in the receiving bitmap received by the source node in multiple consecutive cycles are all the first value, it can be determined that the path state of the candidate logical path is faulty. Fig.40 , assuming that the first value is 0, the second value is 1, and the number of consecutive cycles is 10. For candidate logical path 4, if the bits corresponding to candidate logical path 4 in the sending bitmap sent by the source node in 10 consecutive cycles are all 1, and the bits corresponding to candidate logical path 4 in the receiving bitmap received by the source node in 10 consecutive cycles are all 0, it can be determined that the path status of candidate logical path 4 in 10 consecutive cycles is faulty. Based on this, the path status of candidate logical path 4 can be determined as faulty.
[0466] In the embodiment of the above-mentioned step 3910, for a certain candidate logical path, the path state of the candidate logical path can be comprehensively judged based on the bits corresponding to the candidate logical path in the sending bitmap sent by the source node in multiple consecutive cycles, and the bits corresponding to the candidate logical path in the receiving bitmap received by the source node in multiple consecutive cycles, thereby reducing the influence of the packet loss probability of the candidate logical path on the determination of the path state and improving the accuracy of judging the path state of the candidate logical path.
[0467] In one embodiment, referring to Fig.41 , step 3910 includes:
[0468] Step 4110: remove the first cycle and the last cycle of the plurality of consecutive cycles to obtain a plurality of intermediate cycles;
[0469] Step 4120: If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive intermediate cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in multiple consecutive intermediate cycles are all the first value, it is determined that the path state of the candidate logical path is faulty.
[0470] Steps 4110 to 4120 are described in detail below:
[0471] In step 4110, the first cycle and the last cycle of the plurality of consecutive cycles are removed to obtain a plurality of intermediate cycles.
[0472] According to an embodiment of the present disclosure, in order to deal with some boundary scenarios, before comprehensively judging the path status of each candidate logical path based on the sending bitmap of multiple consecutive cycles and the receiving bitmap in multiple consecutive cycles, it is first necessary to remove the first cycle and the last cycle of multiple consecutive cycles, and only retain multiple intermediate cycles. Here, an example is used to illustrate these boundary scenarios: when the congestion degree of each candidate logical path is different, even if the message carrying the receiving state request on each candidate logical path is sent by the source node at the same time, these messages carrying the receiving state request are likely not to arrive at the destination node at the same time. Moreover, for these messages carrying the receiving state request that arrive at the destination node through different candidate logical paths, their arrival interval may reach the millisecond level (generally, one cycle is only 4 milliseconds). In this case, some candidate logical paths may not receive the message carrying the receiving state request in the current cycle, resulting in the path state of the candidate logical path in the current cycle being determined as a fault. Based on this, the embodiment of the present disclosure reduces the impact of the path state misjudgment caused by such boundary scenarios on the final determined path state by removing the first cycle and the last cycle of multiple consecutive cycles.
[0473] For example, refer to Fig.42 , assuming that the number of consecutive multiple cycles is 10, and the consecutive multiple cycles include cycle 0 to cycle 9. Based on this, in order to cope with some boundary scenarios, it is necessary to remove cycle 0 and cycle 9 to obtain multiple intermediate cycles, namely cycle 1 to cycle 8. Further, when the path status of candidate logical path 1 to candidate logical path 16 is comprehensively judged later, it is determined based on the sending bitmap and receiving bitmap of cycle 1 to cycle 8.
[0474] In step 4120, if the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive intermediate cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in multiple consecutive intermediate cycles are all the first value, it is determined that the path state of the candidate logical path is faulty.
[0475] It can be understood that the specific implementation method of step 4210 is similar to the specific implementation method of step 3910 above, "If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in multiple consecutive cycles are all the first value, determine that the path state of the candidate logical path is faulty", and will not be repeated here.
[0476] In the embodiments of steps 4110 to 4120 above, the first cycle and the last cycle of multiple consecutive cycles can be removed, and the path status of each candidate logical path can be comprehensively judged based on the sending bitmap and the receiving bitmap of multiple intermediate cycles, thereby reducing the impact of the path status misjudgment caused by the boundary scenario on the final determined path status, and improving the accuracy of the path status judgment of the candidate logical path.
[0477] Detailed description of step 450
[0478] Step 450: If the path status of the initial logical path is faulty, determine a non-faulty target logical path from multiple candidate logical paths, and transfer the target message to the target logical path.
[0479] In one embodiment, referring to Fig.43 , step 450 comprises:
[0480] Step 4310: If the path status of the initial logical path is faulty, search for the first index of the initial logical path in the original index queue;
[0481] Step 4320: replace the first index with the second index of the non-faulty candidate logical path according to the order of the non-faulty candidate logical paths in the plurality of candidate logical paths, so that the original index queue becomes the target index queue;
[0482] Step 4330: In the target index queue, select the index at the rank of the target remainder as the target index, and determine the candidate logical path corresponding to the target index as the target logical path.
[0483] The following describes steps 4310 to 4330 in detail:
[0484] In step 4310, if the path status of the initial logical path is faulty, the first index of the initial logical path in the original index queue is searched.
[0485] According to an embodiment of the present disclosure, the first index refers to the index corresponding to the initial logical path in the original index queue. When the path state of the initial logical path is faulty, in order to prevent the subsequent source node from using the initial logical path to transmit other messages, the index corresponding to the initial logical path in the original index queue needs to be replaced first.
[0486] For example, refer to Fig.44 , assuming that the initial logical path is candidate logical path 4, and the index corresponding to candidate logical path 4 in the original index queue is 4, based on this, it can be determined that the first index of the initial logical path is 4.
[0487] In step 4320, the first index is replaced with the second index of the non-faulty candidate logical path according to the order of the non-faulty candidate logical paths in the plurality of candidate logical paths, so that the original index queue becomes the target index queue.
[0488] According to an embodiment of the present disclosure, a non-faulty candidate logical path refers to a candidate logical path whose path status is normal. The second index refers to the index corresponding to the candidate logical path whose path status is normal in the original index queue. The target index queue refers to an index queue determined after replacing the first index in the original index queue with the second index of the non-faulty candidate logical path. Specifically, the first index in the original index queue can be replaced based on the second index of the non-faulty candidate logical path in the order of the non-faulty candidate logical paths in multiple candidate logical paths, so as to achieve uniform mapping of the candidate logical paths whose path status is normal in the target index queue.
[0489] For example, refer to Fig.44 , assuming that the candidate logical paths include: candidate logical path 1, candidate logical path 2, candidate logical path 3 and candidate logical path 4. The initial logical path is candidate logical path 4, and the first index of candidate logical path 4 is 4. If the path status of the initial logical path is faulty, and the path statuses of candidate logical path 1, candidate logical path 2 and candidate logical path 3 are all normal, then the 4 in the original index queue can be replaced with 1, 2, and 3 in the order of candidate logical path 1, candidate logical path 2, and candidate logical path 3 to obtain the target index queue.
[0490] In step 4330, in the target index queue, an index at the rank of the target remainder is selected as the target index, and the candidate logical path corresponding to the target index is determined as the target logical path.
[0491] According to an embodiment of the present disclosure, the target index refers to the index corresponding to the position of the target remainder in the target index queue. After replacing the first index in the original index queue to obtain the target index queue, the source node can select the candidate logical path corresponding to each message based on the target index queue. The target logical path is the candidate logical path reselected based on the target index queue.
[0492] It should be noted that if there is a target message on the current source node side that has an initial logical path determined but not yet sent, when it is determined that the path state of the initial logical path is faulty, a candidate logical path can be reselected for the target message as the target logical path of the target message.
[0493] It can be understood that the specific implementation of step 4330 is similar to the specific implementation of step 1630 above, "in the original index queue, select the index at the position of the target remainder as the initial index, and determine the candidate logical path corresponding to the initial index as the initial logical path", and will not be repeated here.
[0494] The embodiments of the above-mentioned steps 4310 to 4330 can replace the first index in the original index queue based on the second index of the non-faulty candidate logical paths in sequence according to the order of the non-faulty candidate logical paths in multiple candidate logical paths, thereby achieving uniform mapping of the candidate logical paths with normal path status in the target index queue, and reducing the congestion of the candidate logical paths caused by too many messages using the same candidate logical path for transmission.
[0495] In one embodiment, referring to Fig.45 , after step 450, further comprising:
[0496] Step 4510, determine initial logical path failure recovery;
[0497] Step 4520: If the target message has not been sent in the target logical path, switch the target message back to the initial logical path for sending.
[0498] The following describes steps 4510 to 4520 in detail:
[0499] In step 4510, initial logical path failover is determined.
[0500] According to the embodiments of the present disclosure, it can be determined from the above that if the initial logical path fails, the source node will no longer select the initial logical path to transmit the message. Correspondingly, if the initial logical path is restored, the source node can continue to select the initial logical path to transmit the message.
[0501] The specific method of "determining initial logical path failure recovery" will be described in detail below.
[0502] In step 4520, if the target message has not been sent in the target logical path, the target message is switched back to the initial logical path for sending.
[0503] According to the embodiment of the present disclosure, it can be known from step 4310 to step 4320 that if there is a target message on the current source node side that has an initial logical path that has been determined but has not been sent, when it is determined that the path state of the initial logical path is faulty, a candidate logical path can be reselected for the target message as the target logical path of the target message. When it is determined that the initial logical path has been restored and the target message of the target logical path has been determined but has not been sent, in order to reduce the transmission overhead of the target logical path, the target message can be switched back to the initial logical path for sending.
[0504] The specific method of “if the target message has not been sent in the target logical path, switching the target message back to the initial logical path for sending” will be described in detail below.
[0505] In the embodiment of the above steps 4510 to 4520, after determining that the initial logical path fault has been recovered, the source node side can switch the target message that has not been sent in the target logical path back to the initial logical path for sending, thereby reducing the transmission overhead of the target logical path and balancing the transmission overhead of each non-faulty candidate logical path.
[0506] In one embodiment, referring to Fig.46 , step 4510 includes:
[0507] Step 4610: Send a probe request to the destination node every predetermined time period;
[0508] Step 4620: Receive reception status information of the destination node on the initial logical path, the reception status information being sent by the destination node in response to the probe request;
[0509] Step 4630: Determine initial logical path failure recovery based on the received status information.
[0510] Steps 4610 to 4630 are described in detail below:
[0511] In step 4610, a probe request is sent to the destination node every predetermined period of time.
[0512] According to the embodiments of the present disclosure, referring to Fig.47When the path state of the initial logical path is detected as a fault, in order to quickly detect whether the path state of the initial logical path has been restored, the source node will send a probe request to the destination node at a predetermined time interval. The probe request is an independent data packet sent by the source node to the destination node to detect whether the path state of the initial logical path has been restored. When the destination node can receive the probe request sent by the source node, it means that the path state of the initial logical path has been restored to normal. The predetermined time can be determined according to the actual message transmission situation. Generally, the predetermined time is longer than a cycle.
[0513] In step 4620, reception status information of the destination node on the initial logical path is received, the reception status information being sent by the destination node in response to the probe request.
[0514] According to the embodiments of the present disclosure, referring to Fig.47 When the destination node can receive the detection request sent by the source node, it means that the path status of the initial logical path has been restored to normal. At this time, in order to allow the source node to obtain the path status of the initial logical path in real time, the destination node will return the receiving status information to the source node in response to the detection request. The receiving status information can be a separate data packet or encapsulated in a message and sent to the source node.
[0515] In step 4630, initial logical path failure recovery is determined based on the received status information.
[0516] According to the embodiments of the present disclosure, referring to Fig.47 When the source node receives the receiving status information returned by the destination node in response to the detection request, it can be determined that the path status of the initial logical path has been restored, that is, after this, the source node can choose to use the initial logical path to transmit the message.
[0517] In the embodiment of the above steps 4610 to 4630, the source node sends a detection request to the destination node through the failed initial logical path at a predetermined time interval to detect whether the initial logical path has returned to normal. When the source node receives the receiving status information returned by the destination node in response to the detection request, it can be determined that the path state of the initial logical path has been restored. Through the above steps, the source node can quickly determine whether the initial logical path to the fault has been restored, and use the initial logical path to continue transmitting messages after determining that the initial logical path has been restored, thereby improving the continuity of the data flow.
[0518] In one embodiment, if the destination node receives the probe request, the receiving state information is a second value; Fig.48 , step 4630 includes:
[0519] Step 4810: If a predetermined number of receiving status information received consecutively are all the second value, it is determined that the initial logical path failure is recovered.
[0520] The following describes step 4810 in detail:
[0521] According to an embodiment of the present disclosure, the reception status information received by the source node being the second value means that the destination node has received the probe request sent by the source node using the initial logical path. The second value can be set to 1 or any value.
[0522] It is understandable that, in some cases, the reason why the destination node can receive the probe request sent by the source node is not necessarily because the faulty initial logical path has been fully restored, but because the probe request happens not to be the data packet that was discarded. In order to avoid this situation, the source node of the embodiment of the present disclosure will only determine that the fault of the initial logical path has been restored if a predetermined number of receiving status information received consecutively are all the second value. The predetermined number can be determined based on the actual message transmission situation. For example, when the predetermined number is 8, if the source node sends 10 probe requests consecutively to the destination node, and the 8 receiving status information received consecutively by the source node are all the second value, the source node can determine that the initial logical path fault has been restored.
[0523] The source node of the embodiment of step 4810 above will determine that the failure of the initial logical path has been restored only when the predetermined number of receiving status information received continuously are all the second value. Through the above steps, the path status of the initial logical path of the failure can be judged more rigorously, thereby improving the accuracy of the judgment of the path status.
[0524] In one embodiment, referring to Fig.49 , step 4520 includes:
[0525] Step 4910: If the target message has not been sent in the target logical path, obtain the initial position of the first index of the initial logical path in the original index queue;
[0526] Step 4920: Replace the index of the initial position in the target index queue with the first index of the initial logical path to obtain an updated index queue;
[0527] Step 4930: In the updated target index queue, select the index at the position of the target remainder as the updated index, and send the target message waiting to be sent on the target logical path in the initial logical path corresponding to the updated index.
[0528] Steps 4910 to 4930 are described in detail below:
[0529] In step 4910, if the target message has not been sent in the target logical path, the initial position of the first index of the initial logical path in the original index queue is obtained.
[0530] According to an embodiment of the present disclosure, if the source node determines that the initial logical path has recovered from the fault, and the target message of the target logical path has not been sent, in order to reduce the transmission overhead of the target logical path, the target message can be switched back to the initial logical path for transmission. Since the source node selects a candidate logical path for the message based on the target index queue at this time, in order to switch the target message back to the initial logical path for transmission, the target index queue needs to be modified so that the source node can select the initial logical path to transmit the target message based on the modified target index queue.
[0531] It is understandable that before modifying the target index queue, it is first necessary to obtain the initial position of the first index of the initial logical path in the original index queue. Fig.50A , assuming that the initial logical path is candidate logical path 4, after determining the path status failure change of the initial logical path, the target index queue is as follows Fig.44 If the failure recovery of candidate logical path 4 has been determined at this time, it is first necessary to obtain the initial position of the first index of candidate logical path 4 in the original index queue. Fig.50A It can be obtained that the first index of candidate logic path 4 is 4, and the initial position of the first index of candidate logic path 4 in the original index queue is as follows: Fig.50A As shown by the shading, the initial positions are 4, 8, 12, and 16.
[0532] In step 4920, the index of the initial position in the target index queue is replaced with the first index of the initial logical path to obtain an updated index queue.
[0533] It is understandable that after obtaining the initial position of the first index of the initial logical path in the original index queue, the target index queue can be modified, and the updated index queue is the index queue obtained after modifying the target index queue. Fig.50BThe process of "modifying the target index queue" is explained as follows: Assuming that the initial logical path is candidate logical path 4, through step 4910, it can be determined that the first index of candidate logical path 4 is 4, and the initial positions of the first index of candidate logical path 4 in the original index queue are 4, 8, 12, and 16. Based on this, the index with a position of 4, the index with a position of 8, the index with a position of 12, and the index with a position of 16 in the target index queue can all be replaced with the first index of candidate logical path 4, that is, the index with a position of 4, the index with a position of 8, the index with a position of 12, and the index with a position of 16 in the target index queue can all be replaced with 4 to obtain an updated index queue. The updated index queue is as follows: Fig.50B After obtaining the updated index queue, the source node can select the initial logical path to transmit the target message based on the updated index queue.
[0534] In step 4930, in the updated target index queue, an index at the rank of the target remainder is selected as the updated index, and the target message waiting to be sent on the target logical path is sent on the initial logical path corresponding to the updated index.
[0535] According to an embodiment of the present disclosure, the updated index refers to the index corresponding to the rank of the target remainder in the updated index queue.
[0536] It should be noted that, in the case where the path state of the initial logical path is determined to be faulty, a candidate logical path can be reselected for the target message as the target logical path of the target message. If the target message is still not sent from the source node when the fault of the initial logical path is recovered, the target message waiting to be sent on the target logical path can be sent through the initial logical path corresponding to the updated index.
[0537] It can be understood that the specific implementation of step 4930 is similar to the specific implementation of step 1630 above, "in the original index queue, select the index at the position of the target remainder as the initial index, and determine the candidate logical path corresponding to the initial index as the initial logical path", and will not be repeated here.
[0538] In the embodiment of the above steps 4910 to 4930, after determining that the initial logical path has recovered from the fault, the source node side can replace the index of the initial position in the target index queue with the first index of the initial logical path to obtain an updated index queue. Based on the updated index queue, the target message waiting to be sent on the target logical path is switched back to the initial logical path for sending, thereby reducing the transmission overhead of the target logical path and balancing the transmission overhead of each non-faulty candidate logical path.
[0539] In one embodiment, referring to Fig.51After step 4920, the message transmission method further includes:
[0540] Step 5110: for each non-faulty candidate logical path, obtain the index number corresponding to the candidate logical path in the updated index queue;
[0541] Step 5120, determining an average value of the index numbers of each non-faulty candidate logical path;
[0542] Step 5130, determining the difference between the average value and the index number of the candidate logic path;
[0543] Step 5140: In the updated index queue, replace the other indexes that are not the first index with the first index of the initial logical path.
[0544] The following describes steps 5110 to 5140 in detail:
[0545] In step 5110, for each non-faulty candidate logical path, the index number corresponding to the candidate logical path in the updated index queue is obtained.
[0546] According to an embodiment of the present disclosure, when there are multiple candidate logical path failures in the tunnel from the source node to the destination node, simply replacing the index of the initial position in the target index queue with the first index of the initial logical path recovered from the failure may cause the index of each non-faulty candidate logical path in the index queue to be uneven, thereby causing the transmission load of each non-faulty candidate logical path to be unbalanced. Based on this, after replacing the index of the initial position in the target index queue with the first index of the initial logical path recovered from the failure, the embodiment of the present disclosure will also obtain the number of indexes corresponding to the candidate logical path in the updated index queue for each non-faulty candidate logical path. Among them, the index number refers to the number of indexes of each non-faulty candidate logical path in the updated index queue.
[0547] For example, refer to Fig.52 , assuming that there are four candidate logical paths between the source node and the destination node, namely candidate logical path 1, candidate logical path 2, candidate logical path 3 and candidate logical path 4. The index corresponding to candidate logical path 1 is 1, the index corresponding to candidate logical path 2 is 2, the index corresponding to candidate logical path 3 is 3, and the index corresponding to candidate logical path 4 is 4. The original index queue is as follows Fig.52 As shown in the first index queue of FIG. , after determining that the candidate logical path 4 fails, the updated index queue is as follows Fig.52 If the failure of candidate logical path 4 has not been recovered and candidate logical path 1 is determined to be faulty, the updated index queue is as follows: Fig.52 As shown in the third index queue of . It can be obtained that Fig.52 The third index queue of only has the indexes of candidate logical path 2 and candidate logical path 3. If after determining that candidate logical path 1 is faulty, it is detected that candidate logical path 1 is restored, then the candidate logical path 2 and candidate logical path 3 are firstly Fig.52 The first index, the fifth index, the ninth index, and the thirteenth index in the third index queue are replaced with the index of candidate logic path 1. It can be obtained that the number of indexes corresponding to candidate logic path 1 in the modified index queue is 4, the number of indexes corresponding to candidate logic path 2 is 6, and the number of indexes corresponding to candidate logic path 3 is 6. Therefore, for the three non-faulty candidate logic paths, the index of each candidate logic path in the modified index queue is uneven.
[0548] In step 5120, an average value of the index numbers of each non-faulty candidate logic path is determined.
[0549] For example, refer to Fig.52 , if after determining that candidate logical path 1 and candidate logical path 4 are faulty, candidate logical path 1 is detected to be restored, the number of non-faulty candidate logical paths is 3. Fig.52 After replacing the 1st index, the 5th index, the 9th index, and the 13th index in the third index queue with the index of candidate logical path 1, it is determined that the number of indexes corresponding to candidate logical path 1 in the modified index queue is 4, the number of indexes corresponding to candidate logical path 2 is 6, and the number of indexes corresponding to candidate logical path 3 is 6. At this time, it can be determined that the average value of the index numbers of the non-faulty candidate logical paths is 16 / 3.
[0550] In step 5130, the difference between the average value and the index number of the candidate logic path is determined.
[0551] According to an embodiment of the present disclosure, the difference between the average value and the index number of the candidate logic can be used to indicate the degree of balance of the index number of each candidate logic path in the current index queue. In order to ensure the transmission load balance of each non-faulty candidate logic path, it is generally expected that the difference between the average value and the index number of each candidate logic path is less than 1.
[0552] For example, refer to Fig.52 , in Fig.52After replacing the 1st index, the 5th index, the 9th index and the 13th index in the third index queue with the index of candidate logical path 1, it is determined that the number of indexes corresponding to candidate logical path 1 in the modified index queue is 4, the number of indexes corresponding to candidate logical path 2 is 6, and the number of indexes corresponding to candidate logical path 3 is 6. For , the average value of the index numbers of each non-faulty candidate logical path is 16 / 3. It can be determined that the difference between the average value and candidate logical path 1 is 4 / 3, the difference between the average value and candidate logical path 2 is 2 / 3, and the difference between the average value and candidate logical path 3 is 2 / 3.
[0553] In step 5140, in the updated index queue, other indexes other than the first index are replaced with the first index of the initial logical path.
[0554] According to an embodiment of the present disclosure, other indexes other than the first index refer to other indexes in the updated index queue except the first index of the initial logical path of the fault recovery.
[0555] For example, here combined Fig.52 To illustrate step 5140, it is assumed that after determining that candidate logical path 1 and candidate logical path 4 are faulty, candidate logical path 1 is detected to be restored. Through the above steps 5110 to 5130, it can be determined that the difference between the average value and candidate logical path 1 is 4 / 3, the difference between the average value and candidate logical path 2 is 2 / 3, and the difference between the average value and candidate logical path 3 is 2 / 3. At this time, the difference between the average value and the index number of candidate logical path 1 is the largest, that is, the index number of candidate logical path 1 is the most unbalanced. At this time, an index of candidate logical path 2 in the index queue can be replaced with the index of candidate logical path 1, and an index of candidate logical path 3 in the index queue can also be replaced with the index of candidate logical path 1. Fig.52 In the example, an index of candidate logical path 3 in the index queue is replaced with an index of candidate logical path 1. Fig.52 The fourth index queue is shown in FIG.
[0556] After replacing the index of the initial position in the target index queue with the first index of the initial logical path of the fault recovery, the embodiment of the above steps 5110 to 5140 will also obtain the index number corresponding to the candidate logical path in the updated index queue for each non-faulty candidate logical path. And determine the difference between the average value of the index number of each non-faulty candidate logical path and the index number of the candidate logical path, and replace the other indexes other than the first index with the first index of the initial logical path in the updated index queue. Through the above steps, it can be ensured that the index of each non-faulty candidate logical path in the index queue is maintained in a relatively uniform state, thereby keeping the transmission load of each non-faulty candidate logical path balanced.
[0557] Description of the message transmission method of the above embodiment at the destination node side
[0558] In addition, if Fig.53 As shown, the message transmission method provided by the embodiment of the present disclosure is applied to the destination node, and the message transmission method includes:
[0559] Step 5310: In the current cycle, a receiving state request sent by the source node through the candidate logical path is received;
[0560] Step 5320: Save the current bitmap to be processed as the reception bitmap of the previous cycle of the current cycle, wherein the multiple bits of the current bitmap to be processed respectively correspond to the multiple candidate logical paths, and the current bitmap to be processed is used to indicate the candidate logical path for which the reception status request has been received;
[0561] Step 5330: reset each bit of the current to-be-processed bitmap to the first value, and set the bit corresponding to the candidate logical path that has received the receive status request in the current to-be-processed bitmap to the second value;
[0562] Step 5340: Send the receiving bitmap of the previous cycle to the source node so that the source node determines the path status of each candidate logical path based on the receiving bitmap and the sending bitmap of the previous cycle, and determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0563] Steps 5310 to 5340 are described in detail below.
[0564] In step 5310, in the current cycle, a receive status request is sent by the receiving source node through the candidate logical path.
[0565] According to the embodiments of the present disclosure, in each cycle, the source node determines the initial logical path among multiple candidate logical paths to the destination node based on the addressing information of the target message, and sends a reception status request to the destination node through the initial logical path. Furthermore, in each cycle, if the source node has a target message to send to the destination node, the source node will definitely send a reception status request to the destination node. Moreover, the reception status request is carried by the target message to reach the destination node.
[0566] In step 5320, the current bitmap to be processed is saved as the receiving bitmap of the previous cycle of the current cycle, and the multiple bits of the current bitmap to be processed respectively correspond to multiple candidate logical paths. The current bitmap to be processed is used to indicate the candidate logical path for which the receiving status request is received.
[0567] According to an embodiment of the present disclosure, the current pending bitmap refers to the reception bitmap maintained by the destination node at the current time. If the timestamp maintained by the destination node has reached the length of a preset cycle when the current destination node receives the reception status request sent by the source node, it is determined that a new cycle has been entered. At this time, the current pending bitmap can be saved as the reception bitmap of the previous cycle of the current cycle.
[0568] On the other hand, in some scenarios, the source node may not send a message to the destination node for a long time (for example, one hour). Because the reception status request is carried by the message, the destination node cannot receive the message sent by the source node, and naturally cannot receive the reception status request. In this case, if the destination node updates the reception bitmap according to the preset cycle duration, the destination node's computing overhead and storage overhead will be wasted. Therefore, the reception status request can be set as the trigger condition for the destination node to update the reception bitmap. In the case that the source node does not send a message to the destination node for a long time, the reception bitmap of the destination node will remain in a cycle. Until the source node sends a message carrying the reception status request to the destination node, the destination node determines that it has entered a new cycle and saves the current bitmap to be processed as the reception bitmap of the previous cycle of the current cycle.
[0569] In step 5330, each bit of the current bitmap to be processed is reset to a first value, and the bit corresponding to the candidate logical path that has received the receive status request in the current bitmap to be processed is set to a second value.
[0570] It can be understood that the specific implementation of step 5330 is similar to the specific implementation of steps 3110 to 3120 above, and will not be repeated here.
[0571] In step 5340, the receiving bitmap of the previous cycle is sent to the source node so that the source node determines the path status of each candidate logical path based on the receiving bitmap and the sending bitmap of the previous cycle, and determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0572] It can be understood that the specific implementation of step 5340 is similar to the specific implementation of steps 440 to 450 above, and will not be described in detail here.
[0573] The destination node of the embodiment of the above steps 5310 to 5340 resets each bit of the receiving bitmap to the first value at the beginning of each cycle, and sets the bit corresponding to the candidate logical path to the second value when receiving a message carrying a receiving status request transmitted using a candidate logical path. This method can accurately record the receiving status of each candidate logical path in each cycle, so that the source node can quickly determine the path status of each candidate logical path according to the sending status and receiving status of each candidate logical path.
[0574] Embodiment Description of Determining Path Status of Each Candidate Logical Path by a Destination Node
[0575] In the above embodiment, the destination node sends the receiving bitmap to the source node, and the source node compares the sending bitmap of the source node with the receiving bitmap of the destination node to determine the path status of each candidate path. In another embodiment, the path status of each candidate path can also be determined by the destination node. In this case, the source node sends the sending bitmap to the destination node, and the destination node determines the path status of each candidate path based on the sending bitmap of the source node and the receiving bitmap of the destination node.
[0576] In addition, if Fig.54 As shown, the message transmission method provided in the embodiment of the present disclosure is applied to a source node, and the message transmission method includes:
[0577] Step 5410: Determine an initial logical path from among multiple candidate logical paths to the destination node based on the addressing information of the target message;
[0578] Step 5420: Obtain a sending bitmap of the source node, where the sending bitmap indicates the message sending status of the source node for each candidate logical path;
[0579] Step 5430: Send the sending bitmap to the destination node, so that the destination node determines the path status of each candidate logical path based on the comparison between the sending bitmap and the receiving bitmap of the destination node;
[0580] Step 5440: Receive the path status of each candidate logical path returned by the destination node;
[0581] Step 5450: If the path status of the initial logical path is faulty, determine a non-faulty target logical path from multiple candidate logical paths, and transfer the target message from the initial logical path to the target logical path for transmission.
[0582] Steps 5410 to 5450 are described in detail below.
[0583] In step 5410, an initial logical path is determined from among a plurality of candidate logical paths to a destination node based on the addressing information of the target message.
[0584] It can be understood that the specific implementation of step 5410 is similar to the specific implementation of step 410 above, and will not be described in detail here.
[0585] In step 5420, a sending bitmap of the source node is obtained, where the sending bitmap indicates the message sending status of the source node for each candidate logical path.
[0586] It can be understood that the specific implementation of step 5420 is similar to the specific implementation of step 430 above, and will not be described in detail here.
[0587] In step 5430, the transmission bitmap is transmitted to the destination node so that the destination node determines the path status of each candidate logical path based on a comparison between the transmission bitmap and the reception bitmap of the destination node.
[0588] It is understood that in step 440, the source node may determine the path status of each candidate logical path based on a comparison between the locally maintained sending bitmap and the receiving bitmap returned by the destination node. Fig.55 In order to reduce the computational overhead on the source node side, the source node may also send a transmission bitmap to the destination node, and the destination node determines the path status of each candidate logical path based on the comparison between the transmission bitmap and the reception bitmap of the destination node. Further, the specific implementation of "determining the path status of each candidate logical path based on the comparison between the transmission bitmap and the reception bitmap of the destination node" is similar to the specific implementation of step 440 above, and will not be repeated here.
[0589] In step 5440, the path status of each candidate logical path returned by the destination node is received.
[0590] According to the embodiments of the present disclosure, referring to Fig.55 After the destination node determines the path status of each candidate logical path, in order to facilitate the source node to select a candidate logical path for each message to transmit based on the path status of each candidate logical path, the destination node also needs to return the path status of each candidate logical path to the source node.
[0591] In step 5450, if the path status of the initial logical path is faulty, a non-faulty target logical path is determined from multiple candidate logical paths, and the target message is transferred from the initial logical path to the target logical path for transmission.
[0592] It can be understood that the specific implementation of step 5450 is similar to the specific implementation of step 450 mentioned above, and will not be described in detail here.
[0593] The above-mentioned embodiment of step 5410 to step 5450 is not like naked tunnel encapsulation, which can only solve the fault by retransmission afterwards, but determines the candidate logical path of the fault by receiving the path status of each candidate logical path returned by the destination node, so as to avoid putting the target message in the logical path that may have a fault in advance. Compared with the scheme of only retransmitting afterwards, the data flow continuity and service availability are greatly improved. Moreover, this scheme only needs to add the sending bitmap or the path status of each candidate logical path in a small amount of data messages to achieve it, and the transmission storage overhead is also low.
[0594] Description of the above embodiment at the destination node side
[0595] In addition, if Fig.56 As shown, the message transmission method provided in the embodiment of the present disclosure can be applied to the destination node, and the message transmission method includes:
[0596] Step 5610: Receive a sending bitmap sent by a source node, where the sending bitmap indicates a message sending status of the source node for each candidate logical path to the destination node;
[0597] Step 5620: Obtain a reception bitmap of the destination node, where the reception bitmap indicates the message reception status of the destination node for each candidate logical path;
[0598] Step 5630: Determine the path status of each candidate logical path based on the comparison between the sending bitmap and the receiving bitmap;
[0599] Step 5640: Send the path status of each candidate logical path to the source node, so that the source node determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0600] Steps 5610 to 5640 are described in detail below.
[0601] In step 5610, a sending bitmap sent by a source node is received, where the sending bitmap indicates the message sending status of the source node for each candidate logical path to the destination node.
[0602] It is understood that in step 440, the source node may determine the path status of each candidate logical path based on a comparison between the locally maintained sending bitmap and the receiving bitmap returned by the destination node. Fig.55In order to reduce the computational overhead on the source node side, the source node may send a message carrying a sending bitmap to the destination node, and the destination node may receive the sending bitmap sent by the source node.
[0603] In step 5620, a reception bitmap of the destination node is obtained, where the reception bitmap indicates the message reception status of the destination node for each candidate logical path.
[0604] It can be understood that the “receiving bitmap of the destination node” has been described clearly enough in the above step 430 and will not be described in detail here.
[0605] In step 5630, based on the comparison between the sending bitmap and the receiving bitmap, the path status of each candidate logical path is determined.
[0606] It can be understood that the specific implementation of step 5630 is similar to the specific implementation of step 440 above, and will not be described in detail here.
[0607] In step 5640, the path status of each candidate logical path is sent to the source node, so that the source node determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0608] According to the embodiments of the present disclosure, referring to Fig.55 After the destination node determines and obtains the path status of each candidate logical path, in order to facilitate the source node to select a candidate logical path for each message to transmit based on the path status of each candidate logical path, the destination node also needs to return the path status of each candidate logical path to the source node. The destination node can reduce the transmission overhead by encapsulating the path status of each candidate logical path in the message sent to the source node.
[0609] The above-mentioned embodiment of step 5610 to step 5640 is not like bare tunnel encapsulation, which can only solve the fault through post-retransmission, but by receiving the sending bitmap sent by the source node, and comparing the sending bitmap of the source node with the receiving bitmap of the destination node, to avoid the source node from placing the target message in a logical path that may have a fault in advance. Since the sending bitmap indicates the message sending status of the source node for each candidate logical path, and the receiving bitmap indicates the message receiving status of the destination node for each candidate logical path, the path status of each candidate logical path can be obtained by comparing the sending bitmap with the receiving bitmap, so that when the initial logical path assigned by the source node to the target message fails, a non-faulty target logical path is assigned to the target message. This method accurately estimates which of the candidate logical paths may be faulty in advance, thereby avoiding the source node from placing the target message in a faulty candidate logical path for transmission. Compared with the solution of only retransmitting afterwards, the data flow continuity and service availability are greatly improved. This solution only needs to add a sending bitmap or the path status of each candidate logical path in a small number of data messages. The transmission storage overhead is low, the processing of comparing the sending bitmap and the receiving bitmap is simple, and the calculation overhead is low. Therefore, while maintaining a small calculation overhead and storage overhead, the data flow continuity and service availability in message transmission are improved.
[0610] Description of the apparatus and device of the present disclosure
[0611] It is to be understood that, although the steps in the above-mentioned flowcharts are sequentially displayed according to the characterization of arrows, these steps are not necessarily executed in sequence according to the order of arrow characterization. Unless there is a clear description in the present embodiment, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the above-mentioned flowcharts can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the steps or stages in other steps.
[0612] It should be noted that in each specific implementation of the present application, when it comes to the need to perform relevant processing based on data related to object characteristics such as object attribute information or attribute information sets, the permission or consent of the object will be obtained first, and the collection, use and processing of these data will comply with relevant laws, regulations and standards. In addition, when the embodiment of the present application needs to obtain object attribute information, the object's separate permission or separate consent will be obtained through a pop-up window or jump to a confirmation page. After clearly obtaining the object's separate permission or separate consent, the necessary object-related data used to enable the normal operation of the embodiment of the present application will be obtained.
[0613] Fig.57 A schematic diagram of the structure of a message transmission device 5700 provided in an embodiment of the present disclosure. The message transmission device 5700 is arranged in a source node, and the message transmission device 5700 includes:
[0614] A first determining unit 5710 is configured to determine an initial logical path from among a plurality of candidate logical paths to a destination node based on addressing information of a target message;
[0615] A first acquisition unit 5720 is used to acquire a sending bitmap of a source node, where the sending bitmap indicates a message sending status of the source node for each candidate logical path;
[0616] The first sending unit 5730 is used to send a receiving status request to the destination node and receive a receiving bitmap of the destination node, where the receiving bitmap indicates the message receiving status of the destination node for each candidate logical path;
[0617] A first comparison unit 5740, configured to determine the path status of each candidate logical path based on a comparison between the sending bitmap and the receiving bitmap;
[0618] The first transfer unit 5750 is configured to determine a non-faulty target logical path from a plurality of candidate logical paths and transfer the target message to the target logical path if the path status of the initial logical path is faulty.
[0619] Optionally, the addressing information is five-tuple information of the target message;
[0620] The first determining unit 5710 is specifically configured to:
[0621] Perform hash operation on the five-tuple information to obtain the target hash value;
[0622] Performing a modulo operation on the target hash value and the number of multiple candidate logic paths to obtain a target remainder;
[0623] Based on the target remainder, an initial logic path is determined among a plurality of candidate logic paths.
[0624] Optionally, the first determining unit 5710 is specifically configured to:
[0625] Assigning an index to each candidate logical path;
[0626] Arrange the indexes of the candidate logic paths into index groups, and repeat the index groups a third number of times,
[0627] Get the original index queue;
[0628] In the original index queue, an index at the position of the target remainder is selected as an initial index, and a candidate logic path corresponding to the initial index is determined as the initial logic path.
[0629] Optionally, the first determining unit 5710 is specifically configured to:
[0630] Get the hash algorithm used for hashing;
[0631] Determine the maximum hash value generated by the hash algorithm;
[0632] Get the storage space size of the source node;
[0633] Get the computing power of the source node;
[0634] The third number is determined based on the maximum hash value, the storage space size, and the computing power.
[0635] Optionally, the first determining unit 5710 is specifically configured to:
[0636] Obtain the transmission flow per unit time in the target tunnel from the source node to the destination node;
[0637] Obtain the path failure rate of the target tunnel;
[0638] Obtain the average transmission flow variance in the target tunnel;
[0639] The number of the plurality of candidate logical paths is determined based on the transmission flow per unit time, the path failure rate, and the average transmission flow variance.
[0640] Optionally, the first determining unit 5710 is specifically configured to:
[0641] Determine the expected transmission flow per unit time of the target tunnel based on the transmission flow per unit time and the path failure rate;
[0642] Based on the average transmission flow variance, a target adjustment coefficient is determined;
[0643] The number of multiple candidate logical paths is determined based on the expected transmission flow per unit time and the target adjustment coefficient.
[0644] Optionally, the send bitmap and the receive bitmap are generated periodically;
[0645] The first acquisition unit 5720 is specifically used to: in the current cycle, acquire the sending bitmap of the source node in the previous cycle;
[0646] The first sending unit 5730 is specifically used to: send a receiving status request to the destination node in the current cycle, and receive the receiving bitmap of the destination node in the previous cycle.
[0647] Optionally, the first acquiring unit 5720 is specifically configured to:
[0648] Initializing each bit of the sending bitmap to a first value, wherein the number of bits of the sending bitmap is equal to the number of the plurality of candidate logical paths;
[0649] If the source node sends a receive status request on the candidate logical path in the previous cycle, the bit corresponding to the candidate logical path is set to the second value.
[0650] Optionally, the first sending unit 5730 is specifically configured to:
[0651] adding a receive status request to a first tunnel encapsulation field of the first data message, and sending the first data message to the destination node;
[0652] A second data message sent by a destination node is received, wherein a second tunnel encapsulation field of the second data message carries a reception bitmap of the destination node in a previous cycle.
[0653] Optionally, the first tunnel encapsulation field includes a first tag field and a reception status request field, the second tunnel encapsulation field includes a second tag field, a reception status response field and a reception bitmap field, the first tag field indicates that the first data message carries a reception status request, and the second tag field indicates that the second data message carries a reception status response;
[0654] The first sending unit 5730 is specifically configured to: set the first tag field in the first tunnel encapsulation field; add the receiving status request to the receiving status request field in the first tunnel encapsulation field, and send the first data message to the destination node;
[0655] The second data message is generated by: setting the second tag field in the second tunnel encapsulation field; adding a reception status response to the reception status response field in the second tunnel encapsulation field; and adding a reception bitmap to the reception bitmap field in the second tunnel encapsulation field.
[0656] Optionally, adding a receive bitmap to a receive bitmap field in a second tunnel encapsulation field includes: initializing each bit of the receive bitmap to a first value, wherein the number of bits of the receive bitmap is equal to the number of multiple candidate logical paths; if in the previous cycle, the destination node receives a first data packet with a receive status request added to the first tunnel encapsulation field on the candidate logical path, setting the bit corresponding to the candidate logical path to a second value; and adding the receive bitmap to the receive bitmap field in the second tunnel encapsulation field.
[0657] Optionally, the first sending unit 5730 is specifically used to: obtain the first first number of forward data messages sent by the source node through the candidate logical path in the current period; add the receiving status request to the first tunnel encapsulation field of the first first number of forward data messages to generate a first data message; and send the first data message to the destination node;
[0658] The second data message is generated by: obtaining the first number of reverse data messages sent by the destination node through the candidate logical path in the current cycle; adding the receiving bitmap to the second tunnel encapsulation field of the first number of reverse data messages to generate the second data message.
[0659] Optionally, the first sending unit 5730 is specifically configured to:
[0660] Obtain the average number of forward data messages sent in the second number of cycles before the current cycle;
[0661] Obtain an average packet loss rate of forward data messages sent in a second number of cycles before the current cycle;
[0662] Get the message type of the first forward data message to be sent in the current cycle;
[0663] Determine the message sending priority based on the message type;
[0664] A first number is determined based on the average number, the average packet loss rate, and the message sending priority.
[0665] Optionally, the first sending unit 5730 is specifically configured to: send a first data message corresponding to the candidate logical path to the destination node through each candidate logical path;
[0666] The first sending unit 5730 is specifically configured to: if a data packet carrying a receiving bitmap is received from any candidate logical path among the multiple candidate logical paths, use the data packet as the received second data packet.
[0667] Optionally, the first comparing unit 5740 is specifically configured to:
[0668] If a bit corresponding to a candidate logical path in the transmission bitmap is the second value, and a bit corresponding to the candidate logical path in the reception bitmap is the second value, determining that the path state of the candidate logical path is normal;
[0669] If a bit corresponding to a candidate logical path in the transmission bitmap is the second value, but a bit corresponding to the candidate logical path in the reception bitmap is the first value, determining that the path state of the candidate logical path is faulty;
[0670] If the bit corresponding to a candidate logical path in the sending bitmap is the first value, it is determined that the path state of the candidate logical path is inactive.
[0671] Optionally, the sending bitmap and the receiving bitmap are sent periodically;
[0672] The first comparison unit 5740 is specifically used for:
[0673] If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in multiple consecutive cycles are all the first value, it is determined that the path state of the candidate logical path is faulty.
[0674] Optionally, the first comparing unit 5740 is specifically configured to:
[0675] Remove the first and last cycles of multiple consecutive cycles to obtain multiple intermediate cycles;
[0676] If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive intermediate cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in multiple consecutive intermediate cycles are all the first value, it is determined that the path state of the candidate logical path is faulty.
[0677] Optionally, the first transfer unit 5750 is specifically used for:
[0678] If the path status of the initial logical path is faulty, searching for the first index of the initial logical path in the original index queue;
[0679] According to the order of the non-fault candidate logical paths among the plurality of candidate logical paths, the first index is replaced with the second index of the non-fault candidate logical path, so that the original index queue becomes the target index queue;
[0680] In the target index queue, an index at the rank of the target remainder is selected as the target index, and a candidate logical path corresponding to the target index is determined as the target logical path.
[0681] Optionally, the message transmission device 5700 further includes a switching unit, and the switching unit is specifically configured to:
[0682] Determine initial logical path failover;
[0683] If the target message has not been sent in the target logical path, the target message is switched back to the initial logical path for sending.
[0684] Optionally, the switching unit is specifically used for:
[0685] Send a probe request to the destination node at a predetermined interval;
[0686] receiving reception status information of the destination node on the initial logical path, the reception status information being sent by the destination node in response to the probe request;
[0687] Based on the received status information, an initial logical path failover is determined.
[0688] Optionally, if the destination node receives the probe request, the reception status information is a second value;
[0689] The switching unit is specifically configured to: determine that the initial logical path failure is recovered if a predetermined number of receiving status information received continuously are all second values.
[0690] Optionally, the switching unit is specifically used for:
[0691] If the target message has not been sent in the target logical path, obtain the initial position of the first index of the initial logical path in the original index queue;
[0692] Replace the index of the initial position in the target index queue with the first index of the initial logical path to obtain an updated index queue;
[0693] In the updated target index queue, an index at the position of the target remainder is selected as the updated index, and the target message waiting to be sent on the target logical path is sent on the initial logical path corresponding to the updated index.
[0694] Optionally, the message transmission device 5700 further includes a replacement unit, and the replacement unit is specifically configured to:
[0695] For each non-faulty candidate logical path, obtain the index number corresponding to the candidate logical path in the updated index queue;
[0696] Determine an average value of the index numbers of each non-faulty candidate logic path;
[0697] determining the difference between the average and the number of indices of the candidate logic paths;
[0698] In the updated index queue, other indexes other than the first index are replaced with the first index of the initial logical path.
[0699] Fig.58 The schematic diagram of the structure of the message transmission device 5800 provided in the embodiment of the present disclosure. The message transmission device 5800 is arranged in the destination node, and the message transmission device 5800 includes:
[0700] The first receiving unit 5810 is configured to receive a receiving state request sent by a source node through a candidate logical path in a current cycle;
[0701] A first saving unit 5820 is used to save the current to-be-processed bitmap as a receiving bitmap of a previous cycle of the current cycle, wherein the multiple bits of the current to-be-processed bitmap correspond to the multiple candidate logical paths respectively, and the current to-be-processed bitmap is used to indicate the candidate logical path for which the receiving status request is received;
[0702] A first resetting unit 5830, configured to reset each bit in the current to-be-processed bitmap to a first value, and to set the bit in the current to-be-processed bitmap corresponding to the candidate logical path for which the receiving status request is received to a second value;
[0703] The second sending unit 5840 is used to send the receiving bitmap of the previous cycle to the source node, so that the source node determines the path status of each candidate logical path based on the receiving bitmap and the sending bitmap of the previous cycle, and determines the target logical path for sending the target message based on the path status of each candidate logical path.
[0704] Reference Fig.59 , Fig.59 The structural block diagram of the terminal part for implementing the message transmission method of the embodiment of the present disclosure includes: a radio frequency (RF) circuit 5910, a memory 5915, an input unit 5930, a display unit 5940, a sensor 5950, an audio circuit 5960, a wireless fidelity (WiFi) module 5970, a processor 5980, and a power supply 5990. Those skilled in the art can understand that Fig.59 The terminal structure shown does not constitute a limitation on the mobile phone or computer, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.
[0705] RF circuit 5910 can be used for receiving and sending signals during information transmission or calls. In particular, after receiving the downlink information from the base station, it is sent to processor 5980 for processing; in addition, the designed uplink data is sent to the base station.
[0706] The memory 5915 may be used to store software programs and modules. The processor 5980 executes various functional applications and data processing of the content terminal by running the software programs and modules stored in the memory 5915 .
[0707] The input unit 5930 may be used to receive input digital or character information and generate key signal input related to the setting and function control of the content terminal. Specifically, the input unit 5930 may include a touch panel 5931 and other input devices 5932.
[0708] The display unit 5940 may be used to display input information or provided information and various menus of the content terminal. The display unit 5940 may include a display panel 5941.
[0709] The audio circuit 5960, the speaker 5961, and the microphone 5962 can provide an audio interface.
[0710] In this embodiment, the processor 5980 included in the terminal can execute the message transmission method of the previous embodiment.
[0711] The terminals of the embodiments of the present disclosure include but are not limited to mobile phones, computers, intelligent voice interaction devices, smart home appliances, vehicle terminals, aircraft, etc. The embodiments of the present invention can be applied to various scenarios, including but not limited to cloud service transmission, large model training data storage, etc.
[0712] Fig.60 A block diagram of the structure of a portion of a server for implementing the message transmission method of an embodiment of the present disclosure. The server may have relatively large differences due to different configurations or performances, and may include one or more central processing units (Central Processing Units, referred to as CPU) 6022 (for example, one or more processors) and a memory 6032, and one or more storage media 6030 (for example, one or more mass storage devices) storing application programs 6042 or data 6044. Among them, the memory 6032 and the storage medium 6030 can be short-term storage or permanent storage. The program stored in the storage medium 6030 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations on the server. Furthermore, the central processing unit 6022 can be configured to communicate with the storage medium 6030 and execute a series of instruction operations in the storage medium 6030 on the server.
[0713] The server may also include one or more power supplies 6026, one or more wired or wireless network interfaces 6050, one or more input and output interfaces 6058, and / or one or more operating systems 6041, such as Windows ServerTM, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.
[0714] The central processor 6022 in the server can be used to execute the message transmission method of the embodiment of the present disclosure.
[0715] The embodiments of the present disclosure also provide a computer-readable storage medium, which is used to store program codes, and the program codes are used to execute the message transmission methods of the aforementioned embodiments.
[0716] The embodiment of the present disclosure further provides a computer program product, which includes a computer program. A processor of a computer device reads and executes the computer program, so that the computer device executes and implements the above-mentioned message transmission method.
[0717] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present disclosure and the above-mentioned drawings are used to distinguish similar contents, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can, for example, be implemented in an order other than those illustrated or described herein. In addition, the terms "comprises" and "comprising" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0718] It should be understood that in the present disclosure, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated content, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the associated content before and after is in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.
[0719] It should be understood that in the description of the embodiments of the present disclosure, the meaning of multiple (or multiple items) is more than two, greater than, less than, exceed, etc. are understood to not include the number, and above, below, within, etc. are understood to include the number.
[0720] In the several embodiments provided in the present disclosure, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. The mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.
[0721] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0722] In addition, each functional unit in each embodiment of the present disclosure may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0723] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present disclosure is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, server 130, or network device, etc.) to perform all or part of the steps of the various embodiments of the present disclosure. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), disk or optical disk and other media that can store program codes.
[0724] It should also be understood that the various implementations provided in the embodiments of the present disclosure can be combined arbitrarily to achieve different technical effects.
[0725] The above is a specific description of the implementation methods of the present disclosure, but the present disclosure is not limited to the above implementation methods. Technical personnel familiar with the art can also make various equivalent modifications or substitutions without violating the spirit of the present disclosure. These equivalent modifications or substitutions are all included in the scope defined by the claims of the present disclosure.
Claims
1. A message transmission method, characterized in that: Applied to a source node, the message transmission method includes: Determining an initial logical path among a plurality of candidate logical paths to a destination node based on addressing information of the target message; Acquire a sending bitmap of the source node, where the sending bitmap indicates a message sending status of the source node for each of the candidate logical paths; Sending a reception status request to the destination node, and receiving a reception bitmap of the destination node, wherein the reception bitmap indicates a message reception status of the destination node for each of the candidate logical paths; Determining the path status of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap; If the path status of the initial logical path is faulty, a non-faulty target logical path is determined from among the multiple candidate logical paths, and the target message is transferred to the target logical path.
2. The message transmission method according to claim 1, characterized in that: The sending bitmap and the receiving bitmap are generated periodically; The obtaining of the sending bitmap of the source node comprises: obtaining, in the current cycle, the sending bitmap of the source node in the previous cycle; The sending of the reception status request to the destination node and receiving the reception bitmap of the destination node includes: sending the reception status request to the destination node in a current cycle and receiving the reception bitmap of the destination node in a previous cycle.
3. The message transmission method according to claim 2, characterized in that: The sending the receiving status request to the destination node in the current cycle and receiving the receiving bitmap of the destination node in the previous cycle includes: adding the receive status request to a first tunnel encapsulation field of a first data message, and sending the first data message to the destination node; A second data packet sent by the destination node is received, wherein a second tunnel encapsulation field of the second data packet carries the reception bitmap of the destination node in a previous cycle.
4. The message transmission method according to claim 3, characterized in that: The adding the receiving status request to the first tunnel encapsulation field of the first data message and sending the first data message to the destination node comprises: acquiring the first number of forward data messages sent by the source node through the candidate logical path in the current cycle; adding the receiving status request to the first tunnel encapsulation field of the first number of forward data messages to generate the first data message; and sending the first data message to the destination node; The second data message is generated in the following manner: obtaining the first number of reverse data messages sent by the destination node through the candidate logical path in the current period; adding the receiving bitmap to the second tunnel encapsulation field of the first number of reverse data messages to generate the second data message.
5. The message transmission method according to claim 1, characterized in that: The determining the path status of each of the candidate logical paths based on the comparison between the sending bitmap and the receiving bitmap includes: If a bit corresponding to a candidate logical path in the sending bitmap is a second value, and a bit corresponding to the candidate logical path in the receiving bitmap is a second value, determining that the path state of the candidate logical path is normal; If a bit corresponding to a candidate logical path in the sending bitmap is a second value, but a bit corresponding to the candidate logical path in the receiving bitmap is a first value, determining that the path state of the candidate logical path is a fault; If the bit corresponding to a candidate logical path in the sending bitmap is the first value, it is determined that the path state of the candidate logical path is inactive.
6. The message transmission method according to claim 5, characterized in that: The sending bitmap and the receiving bitmap are sent periodically; If a bit corresponding to a candidate logical path in the sending bitmap is a second value, but a bit corresponding to the candidate logical path in the receiving bitmap is a first value, determining that the path state of the candidate logical path is a fault includes: If the bits corresponding to a candidate logical path in the sending bitmap sent in multiple consecutive cycles are all the second value, but the bits corresponding to the candidate logical path in the receiving bitmap received in the multiple consecutive cycles are all the first value, it is determined that the path state of the candidate logical path is faulty.
7. The message transmission method according to claim 1, characterized in that: The addressing information is five-tuple information of the target message; The determining, based on the addressing information of the target message, an initial logical path from a plurality of candidate logical paths to the destination node comprises: Performing a hash operation on the five-tuple information to obtain a target hash value; Performing a modulo operation on the target hash value and the number of the plurality of candidate logical paths to obtain a target remainder; Based on the target remainder, the initial logic path is determined among the plurality of candidate logic paths.
8. The message transmission method according to claim 7, characterized in that: The step of determining the initial logic path from among the plurality of candidate logic paths based on the target remainder comprises: Assigning an index to each of the candidate logical paths; Arranging the indexes of the candidate logical paths into an index group, and repeating the index group a third number of times to obtain an original index queue; In the original index queue, an index at the rank of the target remainder is selected as an initial index, and the candidate logical path corresponding to the initial index is determined to be the initial logical path.
9. The message transmission method according to claim 8, characterized in that: The third number is determined by: Obtaining a hash algorithm for the hash operation; Determining a maximum hash value generated by the hash algorithm; Obtaining the storage space size of the source node; Obtaining the computing capacity of the source node; The third number is determined based on the maximum hash value, the storage space size, and the computing power.
10. The message transmission method according to claim 8, characterized in that: If the path status of the initial logical path is a fault, determining a non-faulty target logical path from the plurality of candidate logical paths comprises: If the path status of the initial logical path is faulty, searching for the first index of the initial logical path in the original index queue; According to the order of the non-faulty candidate logical paths among the multiple candidate logical paths, the first index is replaced with the second index of the non-faulty candidate logical path, so that the original index queue becomes a target index queue; In the target index queue, an index at the rank of the target remainder is selected as the target index, and the candidate logical path corresponding to the target index is determined to be the target logical path.
11. The message transmission method according to claim 10, characterized in that: When the path state of the initial logical path is faulty, after determining a non-faulty target logical path among the multiple candidate logical paths and transferring the target message to the target logical path, the message transmission method further includes: Determining failure recovery of the initial logical path; If the target message has not been sent in the target logical path, the target message is switched back to the initial logical path for sending.
12. The message transmission method according to claim 11, characterized in that: The determining of the initial logical path failure recovery comprises: Sending a probe request to the destination node at predetermined intervals; receiving reception status information of the destination node on the initial logical path, the reception status information being sent by the destination node in response to the probe request; Based on the reception status information, the initial logical path failure recovery is determined.
13. The message transmission method according to claim 11, characterized in that: If the target message has not been sent in the target logical path, switching the target message back to the initial logical path for sending includes: If the target message has not been sent in the target logical path, obtaining an initial position of the first index of the initial logical path in the original index queue; Replacing the index of the initial position in the target index queue with the first index of the initial logical path to obtain an updated index queue; In the updated target index queue, an index at the rank of the target remainder is selected as the updated index, and the target message waiting to be sent on the target logical path is sent on the initial logical path corresponding to the updated index.
14. A message transmission method, characterized in that: Applied to a destination node, the message transmission is performed periodically, and the message transmission method includes: In the current cycle, receiving a receiving state request sent by the source node through the candidate logical path; Saving a current bitmap to be processed as a reception bitmap of a previous cycle of the current cycle, wherein a plurality of bits of the current bitmap to be processed respectively correspond to a plurality of candidate logical paths, and the current bitmap to be processed is used to indicate the candidate logical path for which the reception status request has been received; Reset each bit in the current to-be-processed bitmap to a first value, and set the bit in the current to-be-processed bitmap corresponding to the candidate logical path that has received the receive status request to a second value; The receiving bitmap of the previous cycle is sent to the source node, so that the source node determines the path status of each candidate logical path based on the receiving bitmap of the previous cycle and the sending bitmap, and determines the target logical path for sending the target message based on the path status of each candidate logical path.
15. A message transmission method, characterized in that: Applied to a source node, the message transmission method includes: Determining an initial logical path among a plurality of candidate logical paths to a destination node based on addressing information of the target message; Acquire a sending bitmap of the source node, where the sending bitmap indicates a message sending status of the source node for each of the candidate logical paths; Sending the sending bitmap to the destination node so that the destination node determines the path status of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap of the destination node; receiving the path status of each of the candidate logical paths returned by the destination node; If the path status of the initial logical path is faulty, a non-faulty target logical path is determined from the multiple candidate logical paths, and the target message is transferred from the initial logical path to the target logical path for transmission.
16. A message transmission method, characterized in that: Applied to a destination node, the message transmission method comprises: receiving a sending bitmap sent by a source node, wherein the sending bitmap indicates a message sending status of the source node for each candidate logical path to the destination node; Acquire a reception bitmap of the destination node, wherein the reception bitmap indicates a message reception status of the destination node for each of the candidate logical paths; Determine the path status of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap; The path status of each of the candidate logical paths is sent to the source node, so that the source node determines a target logical path for sending a target message based on the path status of each of the candidate logical paths.
17. A message transmission device, characterized in that: Set in the source node, the message transmission device includes: a first determining unit, configured to determine an initial logical path among a plurality of candidate logical paths to a destination node based on addressing information of a target message; A first acquisition unit, configured to acquire a sending bitmap of the source node, wherein the sending bitmap indicates a message sending status of the source node for each of the candidate logical paths; a first sending unit, configured to send a receiving status request to the destination node, and receive a receiving bitmap of the destination node, wherein the receiving bitmap indicates a message receiving status of the destination node for each of the candidate logical paths; A first comparing unit, configured to determine a path state of each of the candidate logical paths based on a comparison between the sending bitmap and the receiving bitmap; The first transfer unit is configured to determine a non-faulty target logical path from among the multiple candidate logical paths and transfer the target message to the target logical path if the path status of the initial logical path is faulty.
18. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the message transmission method according to any one of claims 1 to 16 is implemented.
19. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the message transmission method according to any one of claims 1 to 16 is implemented.
20. A computer program product, comprising a computer program, wherein the computer program is read and executed by a processor of a computer device, so that the computer device executes the message transmission method according to any one of claims 1 to 16.
Citation Information
Patent Citations
Path detection method and device
CN106559325A
Data packet transmission method and device, equipment, storage medium and program product
CN116980344A
Method and apparatus for determining packet transmission path fault
WO2023050817A1
Cited By
Packet transmission method and apparatus, and electronic device and medium
WO2026045626A1
