CN116319568A - Message transmission method and system based on equivalent multipath - Google Patents

Message transmission method and system based on equivalent multipath Download PDF

Info

Publication number
CN116319568A
CN116319568A CN202310225335.2A CN202310225335A CN116319568A CN 116319568 A CN116319568 A CN 116319568A CN 202310225335 A CN202310225335 A CN 202310225335A CN 116319568 A CN116319568 A CN 116319568A
Authority
CN
China
Prior art keywords
node
congestion
message
path
target message
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310225335.2A
Other languages
Chinese (zh)
Inventor
林彦竹
陈振华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhuanxin Semiconductor Nanjing Co ltd
Original Assignee
Zhuanxin Semiconductor Nanjing Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhuanxin Semiconductor Nanjing Co ltd filed Critical Zhuanxin Semiconductor Nanjing Co ltd
Priority to CN202310225335.2A priority Critical patent/CN116319568A/en
Publication of CN116319568A publication Critical patent/CN116319568A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/125Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to a message transmission method and a system based on equal cost multipath, wherein the method comprises the following steps: responding to a message sending instruction and sending a target message; the second node determines congestion state information of the equal-cost multi-path network according to the received target message; and controlling the transmission path of the target message according to the congestion state information. The method can quickly sense network congestion.

Description

Message transmission method and system based on equivalent multipath
Technical Field
The invention relates to the field of test communication, in particular to a message transmission method and system based on equivalent multipath.
Background
The Equal-Cost Multi-Path Routing (ECMP) technology enables a plurality of reachable paths to exist between the server A and the server B, thereby increasing the transmission bandwidth and further improving the network transmission efficiency. However, in the actual network operation process, the occurrence of network congestion conditions may not be found in time, so that the problems of network congestion, delay, packet loss and the like may occur.
In order to solve the above problem, in the existing remote direct data access ECMP scheme based on ethernet, if a node having a certain path between the server a and the server B is found to be congested, an ECN tag (i.e. a congestion notification tag is displayed, explicit Congestion Notification) is added to a message passing through the node, and the ECN tag can be obtained by the server B only when the message is forwarded to the server B, and at this time, the server B sends a congestion notification message (Congestion Notification Packet, CNP) to the server a, and the server a slows down the congestion flow in the congestion path after receiving the congestion notification message CNP.
Therefore, the scheme that congestion occurs can only be found when the message is transmitted to the server B, and the congestion node cannot be found in time due to the increase of the time for transmitting the message to the server B, and the congestion of the data center network affects the network delay, so that it is very important how to reduce the congestion.
Disclosure of Invention
Based on the above, it is necessary to provide a message transmission method and system based on equal cost multipath capable of rapidly sensing network congestion.
The first aspect provides a method for transmitting a message based on equal cost multi-path, wherein a target message in an equal cost multi-path network is transmitted from a first service end to a second service end, a plurality of equal cost paths are provided between the first service end and the second service end, each equal cost path includes a first node and a second node, the first node is configured to receive the target message from the first service end, and the second node is configured to send the target message to the second service end, and the method for transmitting the target message is characterized in that:
responding to a message sending instruction and sending the target message;
the second node determines congestion state information of the equal cost multi-path network according to the received target message;
and controlling the transmission path of the target message according to the congestion state information.
In some embodiments, the determining, by the second node, congestion state information of the equal cost multi-path network according to the received target packet includes:
determining congestion state information of a node through which the target message passes in the process of transmitting the target message from the first node to the second node;
generating corresponding metadata according to the congestion state information, and adding the metadata to the target message;
and the second node determines congestion state information of the equal cost multi-path network according to the metadata.
In some embodiments, the metadata includes a timestamp of each node through which the target message passed;
the second node determines congestion state information of the equal cost multi-path network according to the metadata, and the method comprises the following steps:
the second node determines congestion state information of each node between the first server and the second server according to the time stamp of each node through which each target message passes;
and determining the congestion state information of the equal cost multi-path network according to the congestion state information of the node.
In some embodiments, the generating corresponding metadata according to the congestion status information, adding the metadata to the target packet, further includes:
if congestion occurs in a node, adding a congestion identifier in the target message, wherein the congestion identifier is used for identifying that all equivalent multipaths between the first node and the second node are congested;
after determining the congestion state information of each node between the first service end and the second service end, the method further comprises the following steps:
determining whether at least one equivalent path in the multiple equivalent paths of the target message is free from congestion;
if at least one equivalent path is not congested, changing the congestion occurrence identification in the target message into the congestion non-occurrence identification;
if all equivalent paths are congested, no processing is performed.
In some embodiments, the controlling the transmission path of the target packet in the equal cost multi-path network according to the congestion status information includes:
the second node generates a congestion state message according to the congestion state information and sends the congestion state message to the first node;
and the first node controls the transmission path of the target message being transmitted and/or the target message to be transmitted according to the congestion state message.
In some embodiments, after determining congestion status information for each of the plurality of equal cost paths, the method further comprises:
if congestion occurs in paths in the equivalent paths, the first node periodically sends a detection message reaching the second node along the congested paths;
determining congestion state updating information of the congestion path according to the detection message;
and feeding back the congestion state update information to the first node.
In some embodiments, the controlling the transmission path of the target packet according to the congestion status information includes:
when congestion occurs to the current transmission path of the target message, determining whether congestion occurs to all equivalent paths of the current transmission path,
and if at least one equivalent path is not congested, determining equivalent paths meeting preset conditions in the equivalent paths without congestion as candidate paths, wherein the preset conditions comprise that the congestion state of the candidate paths is smaller than a preset congestion threshold value and/or the number of the candidate paths is smaller than a preset number, and the congestion state of any candidate path is smaller than the congestion states of other paths except the candidate paths in the equivalent paths of the current transmission path.
In some embodiments, the first node and the second node are both message forwarding chips.
In some embodiments, the method is applied to a RoCE data flow network in a data center network.
The second aspect provides a message transmission system based on equal cost multi-path, wherein a target message in an equal cost multi-path network is transmitted from a first service end to a second service end, a plurality of equal cost paths are arranged between the first service end and the second service end, each equal cost path includes a first node and a second node, the first node is used for receiving the target message from the first service end, and the second node is used for transmitting the target message to the second service end, and the transmission system is characterized in that:
the first chip is used for responding to a message sending instruction and sending the target message;
the second chip is used for determining congestion state information of the equal cost multi-path network according to the received target message by the second node;
the first chip is further configured to control a transmission path of the target packet according to the congestion status information
According to the message transmission method and system based on the equivalent multipath, the target message is sent by responding to the message sending instruction; the second node determines congestion state information of the equal cost multi-path network according to the received target message; and controlling the transmission path of the target message according to the congestion state information. Therefore, the congestion problem caused by different paths and unbalanced path loads among different paths existing among network nodes in the network is solved. Can react in a very short time and can still be implemented in different topologies according to the principles described above.
Drawings
FIG. 1 is a schematic diagram of the level 2 clos network of the method of message transmission based on equal cost multipaths provided in one embodiment;
FIG. 2 is a flow chart of a message transmission method based on equal cost multi-path according to an embodiment of the invention;
fig. 3 is a flow chart of a message transmission method based on equal cost multi-path according to an embodiment of the invention.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
It will be understood that the terms "first," "second," and the like, as used herein, may be used to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish one element from another element. For example, a first equal cost multi-path based messaging script may be referred to as a second equal cost multi-path based messaging script, and similarly, a second equal cost multi-path based messaging script may be referred to as a second equal cost multi-path based messaging script, without departing from the scope of the present application.
Fig. 1 is an environmental diagram of an implementation of a message transmission method based on equal cost multipath provided in an embodiment, taking the level 2 closed network in fig. 1 as an example, in the current remote direct data access ECMP scheme based on the ethernet of RoCEv2 (RDMA (Remote Direct Memory Access) over Converged Ethernet version), multiple reachable paths may exist from the server a to the server B, and traffic may be shared to these paths, so as to fully utilize the link. The selection of the sharing path may adopt a method of a relevant domain Duan Haxi of the convection, and may adopt a policy such as a certain Weight (WCMP), the granularity of the sharing may adopt per flow or per flowlet, and in addition, if the receiving network card or the application layer may process disorder, the sharing granularity may also be per packet (the specific method may be set according to a specific case and will not be described herein). Assume that there are a first path that is defined by node Leaf 0-node Spine 0-node Leaf2 and a second path that is defined by node Leaf 0-node Spine 1-node Leaf2. If the p1 output port of the node Leaf0 in the first path is congested, the node Leaf0 can avoid sharing traffic to p1 so as to relieve the congestion of the p1 port until the congestion state of the p1 port is relieved. For example, if the sharing granularity is per packet, leaf0 may switch subsequent traffic to p0 immediately after p1 is congested, if the granularity is per flow, a new incoming flow may be switched to the flow, and if the granularity is per flow, a new flow may be switched when it arrives.
As shown in fig. 2, in one embodiment, a message transmission method based on equal cost multi-path is provided, a target message in an equal cost multi-path network is transmitted from a first service end to a second service end, a plurality of equal cost paths are provided between the first service end and the second service end, each equal cost path includes a first node and a second node, the first node is used for receiving the target message from the first service end, the second node is used for sending the target message to the second service end, and the transmission method includes:
s10, responding to a message sending instruction and sending a target message;
s20, the second node determines congestion state information of the equal-cost multi-path network according to the received target message;
s30, controlling the transmission path of the target message according to the congestion state information.
It will be appreciated that, taking the equal-cost multi-path in fig. 1 as an example, in the process from the first service end (server a) to the second service end (server B), there may be multiple equal-cost paths, where the first node of the target packet is node Leaf0, the second node is node Leaf2, the intermediate passing node may be node Spine0 or Spine1, there are multiple groups of packets being transmitted between the first node and the second node, when each packet jumps to the second node, each packet may ascertain the congestion status of the node through which it passes, that is, when the packet arrives at the second node, the second node may gather the congestion status of the node through which it passes, so, according to the packet transmitted from the first node to the second node, congestion status information of each equal-cost path in the multiple equal-cost paths may be determined.
Compared with the related art, in the related art, if a node congestion occurs in a message in an ECMP scheme, an ECN label is added to the message, and the ECN label is only used for forwarding one path of the message to a server side B, then the server side B responds to send a congestion notification message CNP to a server side A, and the server side A slows down a congestion flow in the first path after receiving the CNP message. Therefore, although no congestion occurs in the second path at this time, the congestion flow in the first path cannot switch the flow to the second path, and only the speed is reduced without a second effect, so that the waste of bandwidth is caused; the additional congestion handling increases the risk of congestion being spread from node spin 1 to other network nodes.
In the invention, a plurality of equivalent paths from a first node to a second node in a network are determined, and congestion state information of each equivalent path in the plurality of equivalent paths is determined according to a target message transmitted from the first node to the second node; and controlling the transmission path of the message according to the congestion state information. The invention solves the congestion problem caused by different paths and unbalanced path loads among different paths among network nodes in the network. Can react in a very short time and can still be implemented in different topologies according to the principles described above.
In some embodiments, the first node and the second node are both message forwarding chips. Of course, the node between the first node and the second node is also a forwarding chip, that is, the path of the target message from the first service end to the second service end passes through multiple forwarding chips.
In some embodiments, the inventive method is applied to a RoCE data flow network in a data center network.
It can be understood that congestion may cause packet loss, and packet loss of a RoCE data stream may cause a drastic decrease in transmission efficiency, so that no packet loss should be ensured as much as possible, and thus, network congestion is found in time to be an important guarantee for safe and efficient transmission of a RoCE data stream.
In some embodiments, the determining, by the second node, congestion status information of the equal cost multi-path network according to the received target packet may include:
s201, determining congestion state information of a node through which a target message passes in the process of transmitting the target message from a first node to a second node;
s202, generating corresponding metadata according to congestion state information, and adding the metadata to a target message;
and S203, the second node determines congestion state information of the equal cost multi-path network according to the metadata.
It can be understood that in the process of transmitting the message through the node, the congestion state of the message is recorded by the node, and the congestion state of the message is added into the message, so that when the message is transmitted to the node Leaf2, the node Leaf2 can sense the congestion state of the message transmission path.
In some embodiments, the metadata includes a timestamp of the message passing through each node;
the determining, by the second node, congestion status information of the equal cost multi-path network according to the metadata in S203 may include:
s203a, the second node determines congestion state information of each node between the first service end and the second service end according to the time stamp of each node through which each target message passes;
and S203b, determining congestion state information of the equal cost multi-path network according to the congestion state information of the nodes.
In some application scenarios, in-band network telemetry (INT) is a hybrid measurement method, and network state collection is completed by sequentially inserting metadata (measurement metadata) into a data packet by a path intermediate switching node. Metadata (metadata information) in the message is also called intermediate data and relay data, and is data (data about data) describing data, mainly describing data attribute (property) information, and is used for supporting functions such as indicating storage location, history data, resource searching, file recording and the like. For example, the larger the time stamp (timestamp) difference across a certain network node, the more severe the congestion is known. A great advantage of using a time stamp (timestamp) difference is that a change of way can be initiated before intervention and is independent of the ECN waterline, with greater flexibility. The metadata also includes along-the-way network nodes and queue information for use in the implementation.
In some application scenarios, a path state table is detected and maintained at node Leaf2 to record all path states for a certain data flow (e.g., for normal RoCE traffic flows, non-TCP flows or high priority RoCE control messages), the state table format is exemplified as follows:
node Leaf0 Node Spine0 Whether or not to congestion (or congestion degree 1-10)
Node Leaf0 Node spin 1 Whether or not to congestion (or congestion degree 1-10)
Node Leaf1 Node Spine0 Whether or not to congestion (or congestion degree 1-10)
Node Leaf1 Node spin 1 Whether or not to congestion (or congestion degree 1-10)
……
Correspondingly, a congestion status table of a transmission path is also maintained on the node Leaf0, and the format of the congestion status table is as follows:
node Spine0 Node Leaf1 Whether or not to congestion (or congestion degree 1-10)
Node Spine0 Node Leaf2 Whether or not to congestion (or congestion degree 1-10)
Node spin 1 Node Leaf1 Whether or not to congestion (or congestion degree 1-10)
Node spin 1 Node Leaf2 Whether or not to congestion (or congestion degree 1-10)
……
In some embodiments, the step S202 generates corresponding metadata according to the congestion status information, adds the metadata to the target packet, and further includes:
s202a, if a node is congested, adding a congestion identifier in a target message, wherein the congestion identifier is used for identifying that all equivalent multipaths between a first node and a second node are congested;
it is understood that the ECN (Explicit Congestion Notification, displaying congestion notification) identifies, through which congestion information is directly obtained.
After determining congestion status information of each node between the first service end and the second service end in S203a, the method further includes:
s203a1, determining whether at least one equivalent path in a plurality of equivalent paths of a target message is not congested;
s203a2, if at least one equivalent path is not congested, changing the congestion occurrence identification in the target message into the congestion non-occurrence identification;
s203a3, if congestion occurs in all the equivalent paths, no processing is performed.
In some embodiments, the controlling, by S30, the transmission path of the target packet in the equal cost multipath network according to the congestion status information may include:
s31, the second node generates a congestion state message according to the congestion state information and sends the congestion state message to the first node;
s32, the first node controls the transmission path of the target message being transmitted and/or the target message to be transmitted according to the congestion state message.
It will be appreciated that when node Leaf2 first perceives congestion to a message of a first flow, in addition to changing the path state to congestion, an immediate notification of an event that congestion occurs to the flow is required to node Leaf0 to let node Leaf0 execute an appropriate path switching policy. Specifically, for example, the node Leaf2 may construct a special message addressed to the node Leaf0, and notify the node Leaf0 of information about the congestion flow, such as whether the congestion (or the congestion degree), the destination ip or the quintuple, the network node (and the specific congestion node) passed through, and the like, through the constructed message.
After receiving the congestion state message sent by the node Leaf2, the node Leaf0 needs to update the maintained path state table, and if the congestion state is relieved (or the congestion degree is smaller than a certain threshold value), the node Leaf0 can share the subsequent traffic reload to the path; in addition, leaf0 also terminates all congestion status messages.
In some embodiments, controlling a transmission path of a message according to congestion status information includes:
when the current transmission path of the message is congested, determining whether the equivalent paths of the current transmission path are congested,
and if at least one equivalent path is not congested, determining equivalent paths meeting preset conditions in the equivalent paths without congestion as candidate paths, wherein the preset conditions comprise that the congestion state of the candidate paths is smaller than a preset congestion threshold value and/or the number of the candidate paths is smaller than a preset number, and the congestion state of any candidate path is smaller than the congestion states of other paths except the candidate paths in the equivalent paths of the current transmission path.
It should be understood that the sequence number of each step in the foregoing embodiment does not mean that the execution sequence of each process should be determined by the function and the internal logic, and should not limit the implementation process of the embodiment of the present invention.
In an embodiment, a message transmission system based on equal cost multi-path is provided, a target message in an equal cost multi-path network is transmitted from a first service end to a second service end, a plurality of equal cost paths are provided between the first service end and the second service end, each equal cost path includes a first node and a second node, the first node is used for receiving the target message from the first service end, the second node is used for transmitting the target message to the second service end, and the transmission system includes:
the first chip is used for responding to the message sending instruction and sending a target message;
the second chip is used for determining congestion state information of the equal-cost multi-path network according to the received target message by the second node;
the first chip is also used for controlling the transmission path of the target message according to the congestion state information.
Those skilled in the art will appreciate that implementing all or part of the above-described methods in accordance with the embodiments may be accomplished by way of a computer program stored in a computer-readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. The storage medium may be a nonvolatile storage medium such as a magnetic disk, an optical disk, a Read-only memory (ROM), or a random access memory (RandomAccessMemory, RAM).
The technical features of the above-described embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above-described embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples illustrate only a few embodiments of the invention and are described in detail herein without thereby limiting the scope of the invention. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the invention, which are all within the scope of the invention. Accordingly, the scope of protection of the present invention is to be determined by the appended claims.

Claims (10)

1. The method for transmitting the message based on the equivalent multipath comprises the steps that a first service end transmits a target message to a second service end, a plurality of equivalent paths are arranged between the first service end and the second service end, each equivalent path comprises a first node and a second node, the first node is used for receiving the target message from the first service end, and the second node is used for transmitting the target message to the second service end, and the method is characterized in that:
responding to a message sending instruction and sending the target message;
the second node determines congestion state information of the equal cost multi-path network according to the received target message;
and controlling the transmission path of the target message according to the congestion state information.
2. The equal-cost multi-path based message transmission method according to claim 1, wherein the second node determines congestion status information of the equal-cost multi-path network according to the received target message, comprising:
determining congestion state information of a node through which the target message passes in the process of transmitting the target message from the first node to the second node;
generating corresponding metadata according to the congestion state information, and adding the metadata to the target message;
and the second node determines congestion state information of the equal cost multi-path network according to the metadata.
3. The equal cost multi path based message transmission method according to claim 2, wherein the metadata includes a time stamp of each node through which the target message passes;
the second node determines congestion state information of the equal cost multi-path network according to the metadata, and the method comprises the following steps:
the second node determines congestion state information of each node between the first server and the second server according to the time stamp of each node through which each target message passes;
and determining the congestion state information of the equal cost multi-path network according to the congestion state information of the node.
4. The method for equal cost multi-path based packet transmission according to claim 3, wherein said generating corresponding metadata according to said congestion status information, adding said metadata to said target packet, further comprises:
if congestion occurs in a node, adding a congestion identifier in the target message, wherein the congestion identifier is used for identifying that all equivalent multipaths between the first node and the second node are congested;
after determining the congestion state information of each node between the first service end and the second service end, the method further comprises the following steps:
determining whether at least one equivalent path in the multiple equivalent paths of the target message is free from congestion;
if at least one equivalent path is not congested, changing the congestion occurrence identification in the target message into the congestion non-occurrence identification;
if all equivalent paths are congested, no processing is performed.
5. The method for transmitting a message based on equal cost multi-path according to claim 1, wherein said controlling the transmission path of the target message in the equal cost multi-path network according to the congestion status information comprises:
the second node generates a congestion state message according to the congestion state information and sends the congestion state message to the first node;
and the first node controls the transmission path of the target message being transmitted and/or the target message to be transmitted according to the congestion state message.
6. The method for transmitting packets based on equal cost multipaths according to claim 1, wherein after determining congestion status information of each of the plurality of equal cost paths, further comprising:
if congestion occurs in paths in the equivalent paths, the first node periodically sends a detection message reaching the second node along the congested paths;
determining congestion state updating information of the congestion path according to the detection message;
and feeding back the congestion state update information to the first node.
7. The method for transmitting a message based on equal cost multiple paths according to claim 1, wherein said controlling the transmission path of the target message according to the congestion status information comprises:
when congestion occurs to the current transmission path of the target message, determining whether congestion occurs to all equivalent paths of the current transmission path,
and if at least one equivalent path is not congested, determining equivalent paths meeting preset conditions in the equivalent paths without congestion as candidate paths, wherein the preset conditions comprise that the congestion state of the candidate paths is smaller than a preset congestion threshold value and/or the number of the candidate paths is smaller than a preset number, and the congestion state of any candidate path is smaller than the congestion states of other paths except the candidate paths in the equivalent paths of the current transmission path.
8. The method for transmitting messages based on equal cost multiple paths according to claim 1, wherein said first node and said second node are both message forwarding chips.
9. The method for equal cost multipath based message transmission as claimed in claim 1, wherein the method is applied to a RoCE data flow network in a data center network.
10. A message transmission system based on equal cost multi-path, wherein a target message in an equal cost multi-path network is transmitted from a first service end to a second service end, a plurality of equal cost paths are arranged between the first service end and the second service end, each equal cost path comprises a first node and a second node, the first node is used for receiving the target message from the first service end, and the second node is used for transmitting the target message to the second service end, the transmission system is characterized in that:
the first chip is used for responding to a message sending instruction and sending the target message;
the second chip is used for determining congestion state information of the equal cost multi-path network according to the received target message by the second node;
the first chip is further configured to control a transmission path of the target packet according to the congestion status information.
CN202310225335.2A 2023-03-08 2023-03-08 Message transmission method and system based on equivalent multipath Pending CN116319568A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310225335.2A CN116319568A (en) 2023-03-08 2023-03-08 Message transmission method and system based on equivalent multipath

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310225335.2A CN116319568A (en) 2023-03-08 2023-03-08 Message transmission method and system based on equivalent multipath

Publications (1)

Publication Number Publication Date
CN116319568A true CN116319568A (en) 2023-06-23

Family

ID=86821829

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310225335.2A Pending CN116319568A (en) 2023-03-08 2023-03-08 Message transmission method and system based on equivalent multipath

Country Status (1)

Country Link
CN (1) CN116319568A (en)

Similar Documents

Publication Publication Date Title
CN109412964B (en) Message control method and network device
US9270598B1 (en) Congestion control using congestion prefix information in a named data networking environment
US11870754B2 (en) Packet analysis and filtering
CN113132225B (en) Path selection method, path selection device, computer equipment and computer readable medium
JP5884892B2 (en) Network system, controller, and load balancing method
AU2020201904B2 (en) Packet transmission method and apparatus
CN109088822B (en) Data flow forwarding method, device, system, computer equipment and storage medium
US20150236867A1 (en) Network, network node, distribution method and network node program
US20230198895A1 (en) Methods and systems for adaptive stochastic-based load balancing
CN105763463B (en) Method and device for transmitting link detection message
CN112737940A (en) Data transmission method and device
EP4164187A1 (en) Load balancing method, apparatus and system
CN101371531A (en) Improved route determining methods for a network
CN112187635B (en) Message forwarding method and device
Isyaku et al. Path selection with critical switch-aware for software defined networking
CN116319568A (en) Message transmission method and system based on equivalent multipath
CN107547452B (en) Distributed communication equipment and message forwarding method and device thereof
CN116318554A (en) Network transmission method and device
CN102801562B (en) Transmission link switching method and device and network equipment
US11012378B2 (en) Methods and apparatus for shared buffer allocation in a transport node
CN111491334B (en) Load sharing method, device, system, single board and storage medium
CN107070787B (en) Default route revocation method and device
CN111726291A (en) Path switching method and network equipment
KR100947602B1 (en) Apparatus and method for multiplexing of control function in network system
GB2580181A (en) Packet analysis and filtering

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination