WO2021203985A1 - Procédé de synchronisation d'informations de congestion et appareil associé - Google Patents

Procédé de synchronisation d'informations de congestion et appareil associé Download PDF

Info

Publication number
WO2021203985A1
WO2021203985A1 PCT/CN2021/083150 CN2021083150W WO2021203985A1 WO 2021203985 A1 WO2021203985 A1 WO 2021203985A1 CN 2021083150 W CN2021083150 W CN 2021083150W WO 2021203985 A1 WO2021203985 A1 WO 2021203985A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
message
congestion
bit
network computing
Prior art date
Application number
PCT/CN2021/083150
Other languages
English (en)
Chinese (zh)
Inventor
林钦亮
王巧灵
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2021203985A1 publication Critical patent/WO2021203985A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/11—Identifying congestion
    • H04L47/115—Identifying congestion using a dedicated packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]

Definitions

  • the embodiments of the present application relate to the field of communication technologies, and in particular to a method and related devices for synchronizing congestion information.
  • More and more network applications rely on large-scale computing, such as artificial intelligence, Internet of Things, cloud computing, and so on.
  • large-scale computing it is not feasible to rely on a single training node. Only through the collaborative computing of multiple training nodes in distributed computing can high-performance computing be provided for network applications.
  • the in-net computing network makes full use of network computing resources, allocates some key calculations for distributed computing nodes, and provides aggregated calculations, so that multiple pieces of data are aggregated into one, thereby reducing network bandwidth usage and speeding up network transmission , Speed up distributed computing.
  • congestion control is an important means to improve network resource utilization and optimize transmission quality.
  • the quality of congestion handling directly affects the performance of the system.
  • standard remote direct memory access (RDMA) protocols use congestion control algorithms based on explicit congestion notification (ECN) flags, and more and more are based on transmission control protocols (transmission control protocols).
  • ECN explicit congestion notification
  • TCP transmission control protocols
  • the control protocol (TCP) protocol and applications have also begun to enable the ECN flag in the standard TCP protocol and the corresponding congestion control method.
  • the congestion control method based on the ECN flag bit can be understood as: if the data flow is sent from node A to node B, when the switch in the network detects that the port is congested, it will pass the forward ECN position in all the packets of the port The bit is 1.
  • node B receives a message with forward ECN set to 1 (indicating that the route from node A to node B is congested), then the backward ECN bit in the message of node A will be set to 1. Or reply to a congestion notification packet (CNP), so that node A performs congestion control when it receives a packet with the ECN set or a CNP packet.
  • CNP congestion notification packet
  • the current congestion control method based on the ECN flag is only suitable for point-to-point unicast communication.
  • the current congestion control method based on the ECN flag is easy to work
  • the data message sent by the node is discarded by the network computing switch in the process of aggregation processing; in addition, the communication mode becomes a many-to-many communication mode due to the process of providing aggregation calculation by the computing network within the network.
  • the traditional point-to-point congestion control method is likely to cause the transmission rate of each working node in the many-to-many communication mode to be unable to synchronize, so that multiple working nodes cannot synchronize congestion control.
  • the embodiments of the present application provide a method and related devices for synchronization of congestion information, which are used to synchronously send congestion information to N working nodes, which fills in the gap of the lack of applicable congestion information synchronization in the intranet computing network, and further enables N
  • the sending rate of each of the working nodes tends to be smooth.
  • an embodiment of the present application provides a method for synchronizing congestion information, and the method may include:
  • the in-network computing switch acquires congestion information, where the congestion information is used to indicate that the first communication link is congested, and the first communication link is the link between the first working node and the in-network computing switch, and
  • the first working node is any one of N working nodes, and the N is an integer greater than 2;
  • the computing switch in the network sends N packets with the same sequence number to the N working nodes, and the N packets with the same sequence number all carry the congestion information, so that the N working nodes are based on The congestion information performs congestion control.
  • the computing switch in the network sends N packets with the same sequence number that all carry congestion information to N working nodes, so that the congestion information can be synchronized to these N working nodes, which fills in the lack of the computing network in the network.
  • the applicable congestion information synchronization is blank, and the N working nodes can perform synchronous congestion control according to the congestion information carried in the message, so that the sending rate of each working node tends to be smooth.
  • the in-network computing switch acquiring congestion information may include:
  • the in-network computing switch obtains the first message sent by the first working node, the first message carries the congestion information, and the congestion information includes the display congestion notification ECN flag bit of the first message
  • the congestion information includes the display congestion notification ECN flag bit of the first message
  • the in-network computing switch sends N packets with the same sequence number to the N working nodes, and the N packets with the same sequence number all carry the congestion information, including:
  • the in-network computing switch sends N packets with the same sequence number to the N working nodes, and the N packets with the same sequence number all carry the Congestion information.
  • the network computing switch will carry the congestion information in N packets with the same sequence number, and send the N messages to N working nodes.
  • a message with the same sequence number not only realizes that the congestion information can be synchronized to these N working nodes, and fills the gap of the lack of applicable congestion information synchronization in the intranet computing network, but also enables the N working nodes to be able to synchronize according to the report.
  • the congestion information carried in the text performs synchronous congestion control, and further solves the failure problem of the congestion information in the in-network computing network based on the first value being within the time limit.
  • the in-network computing switch sends N reports with the same sequence number to the N working nodes.
  • N reports with the same sequence number to the N working nodes.
  • the in-network computing switch modifies the value of the ECN flag bit of the second packet to the first value to obtain a third packet, and the second packet is the first aggregation within the validity period.
  • the sequence number of the second message is the same as the sequence number of the third message;
  • the in-network computing switch sending N packets with the same sequence number to the N working nodes includes:
  • the computing switch in the network sends N third messages to the N working nodes, the first value in each third message indicates that the corresponding working node performs congestion control, and the N The sequence numbers in the third message are the same.
  • the computing switch in the network realizes synchronization of congestion information by sending N third messages with the same sequence number to N working nodes, and further makes the first value in each third message indicate the corresponding The working nodes perform congestion control so that the sending rate of each working node tends to be smooth.
  • the third possible implementation manner it may further include:
  • the in-network computing switch receives the fourth packet sent by the first working node within the congestion indicator aging period of the first value, the value on the ECN flag bit in the fourth packet Is the first value;
  • the in-network computing switch ignores the first value in the fourth packet.
  • the in-network computing switch modifies the value of the ECN flag bit of the second packet to the first A value, which can include:
  • the in-network computing switch When the ECN flag bit of the first packet includes the first ECN field, and the ECN flag bit of the second packet includes the second ECN field, the in-network computing switch will set the value in the second ECN field The value is modified to the first value in the first ECN field; or,
  • the in-network computing switch When the ECN flag bit of the first message includes the first forward display congestion notification FECN bit, and the ECN flag bit of the second message includes the second FECN bit, the in-network computing switch will The value in the second FECN bit is modified to the first value in the first FECN bit; or,
  • the in-network computing switch When the ECN flag bit of the first message includes the first backward display congestion notification BECN bit, and the ECN flag bit of the second message includes the second BECN bit, the in-network computing switch will The value in the second BECN bit is modified to the first value on the first BECN bit.
  • the way that the calculation switch in the network modifies the value on the ECN flag bit of the second packet to the first value is also There can be multiple types, and through the above-mentioned modification, multiple application possibilities are provided for the subsequent synchronization of congestion information.
  • the in-network computing switch acquiring congestion information may include:
  • the in-network computing switch modifies the value of the ECN flag bit in the N data messages to be broadcast to Obtain congestion information, where the N data messages to be broadcast are messages with the same sequence number among the N working nodes;
  • the in-network computing switch sends N packets with the same sequence number to the N working nodes, and the N packets with the same sequence number all carry the congestion information, which may include:
  • the in-network computing switch sends the modified N data messages to be broadcast to the N working nodes, and the values on the ECN flag bits in the modified N data messages to be broadcast are used respectively Instruct the N working nodes to perform congestion control.
  • the computing switch in the network can send these N modified data messages to be broadcast to N working nodes, so that each modified data message to be broadcast carries congestion information, so that the congestion information can be Synchronize to these N working nodes, filling the gap of the lack of applicable congestion information synchronization in the intranet computing network; and enabling the N working nodes to synchronize according to the congestion information carried in the modified data message to be broadcast Congestion control further smoothes the sending rate of each of the N working nodes.
  • the in-network computing switch calculates the value on the ECN flag bit in the N data packets to be broadcast Modifications include:
  • the in-network computing switch sets the value in the third ECN field; or,
  • the in-network computing switch sets the value in the third FECN bit.
  • the way that the calculation switch in the network modifies the value on the ECN flag bit of the second packet to the first value is also There can be multiple types, and through the above-mentioned modification, multiple application possibilities are provided for the subsequent synchronization of congestion information.
  • the embodiments of the present application provide an in-network computing switch, and the in-network computing switch may include:
  • the acquiring unit is configured to acquire congestion information, where the congestion information is used to indicate that the first communication link is congested, and the first communication link is the link between the first working node and the computing switch in the network, so
  • the first working node is any one of N working nodes, and the N is an integer greater than 2;
  • the sending unit is configured to send N messages with the same sequence number to the N working nodes, and the N messages with the same sequence number all carry the congestion information, so that the N working nodes are based on all the messages.
  • the congestion information is described for congestion control.
  • the acquiring unit may include:
  • the first obtaining module is configured to obtain a first message sent by the first working node, the first message carrying the congestion information, and the congestion information includes the display congestion notification ECN flag of the first message A first value on the bit, where the first value is used to indicate that the first communication link is congested;
  • the sending unit includes:
  • the first sending module is configured to send N packets with the same sequence number to the N working nodes within the congestion indication time period of the first value obtained by the first obtaining module, and the N All packets with the same sequence number carry the congestion information.
  • the in-network computing switch may further include:
  • the modifying unit is configured to modify the value of the ECN flag bit of the second message to the first value before the first sending module sends N messages with the same sequence number to the N working nodes, To obtain a third message, where the second message is the first message to be aggregated within the validity period, and the sequence number of the second message is the same as the sequence number of the third message;
  • the first sending module includes:
  • the first sending submodule is configured to send the N third messages obtained by the modifying unit to the N working nodes, and the first value in each third message indicates the corresponding work
  • the node performs congestion control, and the sequence numbers in the N third messages are the same.
  • the in-network computing switch further includes:
  • the acquiring unit is configured to receive a fourth message sent by the first working node within the congestion indication aging period of the first value, and the value on the ECN flag bit in the fourth message Is the first value;
  • the ignoring unit is configured to ignore the first value in the fourth message obtained by the obtaining unit.
  • the modification unit is configured to, when the ECN flag bit of the first packet includes a first ECN field, and the ECN flag bit of the second packet includes a second ECN field, add the second ECN field to The value of is modified to the first value in the first ECN field; or,
  • the modification unit is configured to: when the ECN flag bit of the first message includes the first forward display congestion notification FECN bit, and the ECN flag bit of the second message includes the second FECN bit, then the The value in the second FECN bit is modified to the first value in the first FECN bit; or,
  • the modification unit is configured to: when the ECN flag bit of the first message includes the first backward display congestion notification BECN bit, and the ECN flag bit of the second message includes the second BECN bit, then the The value in the second BECN bit is modified to the first value on the first BECN bit.
  • the acquiring unit may include:
  • the second acquisition module is configured to modify the value of the ECN flag bit in the N data packets to be broadcast when the port status between the first working node and the in-network computing switch shows congestion, To obtain congestion information, where the N data messages to be broadcast are messages with the same sequence number among the N working nodes;
  • the sending unit includes:
  • the second sending module is configured to send the modified N data messages to be broadcast to the N working nodes, and the values on the ECN flag bits in the modified N data messages to be broadcast are respectively used Instruct the N working nodes to perform congestion control.
  • the second acquisition module is configured to include the ECN flag bit in the data message to be broadcast When the third ECN field is used, the calculation switch in the network sets the value in the third ECN field; or,
  • the second acquiring module is configured to, when the ECN flag bit in the data message to be broadcast includes the third FECN bit, the in-network computing switch sets the value in the third FECN bit.
  • an embodiment of the present application provides a computer device, including: a processor and a memory; the memory is used to store program instructions, and when the computer device is running, the processor executes the program instructions stored in the memory to enable The computer device executes the congestion information synchronization method as described in the first aspect or any one of the possible implementation manners of the first aspect.
  • embodiments of the present application provide a computer-readable storage medium, including instructions, which when run on a computer, cause the computer to execute a method as in the first aspect or any one of the possible implementation manners of the first aspect.
  • the embodiments of the present application provide a computer program product containing instructions, which when run on a computer, cause the computer to execute the method as in the first aspect or any one of the possible implementation manners of the first aspect.
  • an embodiment of the present application provides a chip system, which includes a processor, and is used to support the in-network computing switch to implement the functions involved in the first aspect or any one of the possible implementation manners of the first aspect.
  • the chip system also includes a memory, and the memory is used to store the program instructions and data necessary for calculating the switch in the network.
  • the chip system can be composed of chips, or include chips and other discrete devices.
  • the congestion information can indicate that the first communication link between any working node and the computing switch in the network is congested
  • the congestion information is all It is carried in N messages with the same sequence number, so that the N messages with the same sequence number are sent to N working nodes.
  • the computing switch in the network sends N packets with the same sequence number that all carry congestion information to N working nodes, which not only realizes that the congestion information can be synchronized to these N working nodes, so that N working nodes
  • the congestion control can be performed synchronously according to the congestion information carried in the message, which fills in the gap of the lack of applicable congestion information synchronization in the computing network in the network, and further makes the N working nodes
  • the sending rate of each working node tends to be smooth.
  • FIG. 1 is a schematic diagram of a system architecture provided by an embodiment of the present application.
  • FIG. 2 is a schematic diagram of an embodiment of a method for synchronization of congestion information provided by this embodiment
  • FIG. 3 is a schematic diagram of aggregation calculation performed by the in-network computing switch provided by this embodiment
  • FIG. 4 is a schematic diagram of another embodiment of a method for synchronization of congestion information provided by this embodiment
  • FIG. 5 is a schematic diagram of the state of the ECN flag bit of the RoCE v2 protocol or the TCP protocol proposed in the embodiment of the present application;
  • FIG. 6 is a schematic diagram of another embodiment of the method for synchronization of congestion information provided by this embodiment.
  • FIG. 7 is a schematic diagram of an embodiment of an in-network computing switch provided by an embodiment of the present application.
  • FIG. 8 is a schematic diagram of another embodiment of an in-network computing switch provided by an embodiment of the present application.
  • FIG. 9 is a schematic diagram of another embodiment of an in-network computing switch provided by an embodiment of the present application.
  • FIG. 10 is a schematic diagram of another embodiment of an in-network computing switch provided by an embodiment of the present application.
  • FIG. 11 is a schematic diagram of the hardware structure of a communication device in an embodiment of the present application.
  • the embodiments of the present application provide a method and related devices for synchronization of congestion information, which are used to synchronously send congestion information to N working nodes, which fills in the gap of the lack of applicable congestion information synchronization in the intranet computing network, and further enables N
  • the sending rate of each of the working nodes tends to be smooth.
  • Congestion control is an important means to improve network resource utilization and optimize transmission quality.
  • the quality of congestion handling directly affects the performance of the system. Since the in-network computing network can make full use of network computing resources, it can allocate part of the key calculations for distributed computing nodes, and can provide aggregate calculations, so that multiple pieces of data can be aggregated into one, thereby reducing network bandwidth usage and speeding up network transmission. In-network computing networks that can provide aggregated computing are becoming more and more popular. And the intranet computing network has corresponding flow control features, namely: 1.
  • the intranet computing switch performs aggregation calculation on packets with the same sequence number (index value) sent by N working nodes (N is an integer greater than 2), After calculating the parameters in the data message with the same serial number sent by N working nodes, it will be sent out, otherwise the packet will be lost; 2.
  • N working nodes are required to send data Synchronize the sending rate at the time; the sending rate of 3.N working nodes depends on the slowest link in the topology.
  • the traditional congestion control method based on the ECN flag bit is only suitable for point-to-point unicast communication, and cannot be applied to the many-to-many synchronous communication mode of intranet computing network, that is, the congestion control method in point-to-point unicast communication is adopted. , It cannot solve that when any working node is congested and the sending rate is reduced, the sending rate of the other N-1 working nodes can also be reduced accordingly.
  • the method proposed in the embodiment of the present application is mainly applied to the application scenario of the in-network computing network that performs congestion control based on the ECN flag.
  • the foregoing application scenarios of the in-network computing network include, but are not limited to, artificial intelligence (AI) distributed training, a mapping reduction model (MapReduce), or a distributed database, and so on.
  • AI artificial intelligence
  • MapReduce mapping reduction model
  • FIG. 1 An embodiment of the present application provides a schematic diagram of a system architecture.
  • the system can include an in-network computing switch and N working nodes; among them, the in-network computing switch is mainly used to obtain congestion information, and because the congestion information can indicate any of the N working nodes
  • the first communication link between a working node and the computing switch in the network is congested (the black dot in Figure 1). Therefore, when the first communication link is congested, the computing switch in the network can be in N All packets with the same sequence number carry the congestion information, so that the computing switch in the network can send N packets with the same sequence number to N working nodes.
  • congestion control can be performed synchronously according to the congestion information carried in the message, so as to avoid the situation that the working node corresponding to the communication link that is not congested causes transmission interruption or even timeout due to the excessively fast sending rate.
  • the first communication link that is congested shown in Figure 1 is the link between the computing switch in the network and the working node 0, which is only a schematic description. In actual applications, congestion occurs.
  • the first communication link may also be a link between a working node such as a working node 1 or a working node 2 and a computing switch in the network, which will not be specifically limited in the embodiment of the present application.
  • the aforementioned intra-network computing switches also have certain programmability and computing capabilities, and can calculate and modify the fields in the message, such as modifying the ECN field and the The calculation result is substituted into the load of the message and so on.
  • the aforementioned intra-network computing switches include but are not limited to Bareboot Wedge 100B switches, Cisco N3400 switches, etc., which will not be specifically limited in the embodiments of the present application.
  • the aforementioned N working nodes may be servers with graphics processing units (GPUs), training nodes, etc., which will not be specifically limited in the embodiments of the present application.
  • the method for synchronizing congestion information in this embodiment is not only applicable to the system architecture shown in FIG. 1 above, but also applicable to other system architectures, which is not specifically limited here.
  • FIG. 2 is a schematic diagram of an embodiment of the method for synchronization of congestion information provided by this embodiment.
  • Methods can include:
  • the computing switch in the network obtains congestion information, the congestion information is used to indicate that the first communication link is congested, the first communication link is the link between the first working node and the computing switch in the network, and the first working node is N Any one of the working nodes, N is an integer greater than 2.
  • the computing switches in the network will obtain congestion information, and then determine the occurrence of congestion based on the congestion information.
  • the congestion information can be that the computing switch in the network detects that any communication port leading to these N working nodes is in a congested state, and thus obtains the congestion information based on the communication port in the congested state; or The first working node corresponding to the first communication link where the congestion occurs notifies the congestion information to the in-network computing switch. It should be understood that the method for obtaining congestion information will not be specifically limited in the embodiment of the present application.
  • the computing switch in the network sends N packets with the same sequence number to N working nodes, and the N packets with the same sequence number all carry congestion information, so that the N working nodes respectively perform congestion control based on the congestion information.
  • the serial number can indicate the serial number of the message, and for the messages with the same serial number, it indicates that the data messages sent by the N working nodes to the computing switch in the network belong to the same batch.
  • the internal computing switch can distinguish the data packets sent by N working nodes based on the serial number, and correspond the parameters of the data packets from N different working nodes with the same serial number to the same batch of data packets. The aggregate calculation.
  • the foregoing aggregation calculation can be understood as that N working nodes synchronously send data packets carrying data to be calculated to the computing switches in the network, and different working nodes send different data packets that are numbered with serial numbers, and the computing switches in the network are After receiving N data packets, the parameters in the data packets with the same sequence number are aggregated accordingly. When all the data packets with a certain sequence number sent by N working nodes are calculated, the network The computing switch will send the aggregation result to N working nodes in the form of packets.
  • Figure 3 a schematic diagram of an in-network computing switch performing aggregation calculation. It can be seen from Figure 3 that the parameters in the data packets sent by the working node 0 to the computing switch in the network are “1", “2", and “3” respectively; The parameters in the data message are “4", “5", and “6”; the parameters in the data message sent by the working node 2 to the computing switch in the network are “7", “8", and “9” respectively. .
  • serial numbers of the data messages corresponding to the parameters "1", “4", and “7” are the same, while the data corresponding to the parameters "2", “5", and “8”
  • the serial numbers of the messages (assuming index1) are the same, and the serial numbers of the data messages corresponding to the parameters "3", “6", and “9” (assuming index2) are the same.
  • the computing switch in the network will sum and average the parameters in the data packets with the same sequence number sent from working node 0, working node 1, and working node 2, for example, the parameters in the data packet corresponding to index 0 "1", "4", and "7" are averaged, and the polymerization result is 4.
  • the calculation switch in the network will only send the aggregation result corresponding to the sequence number to the corresponding working node after calculating the parameters in the data message with the same sequence number sent by the three working nodes.
  • the working node 0, working node 1 and working node 2 in Fig. 3 are only a schematic description for the aggregation calculation. In practical applications, the number of working nodes involved in the aggregation calculation The number is not limited, as long as N is an integer greater than 2.
  • the network computing switch needs to carry the congestion information in N packets with the same sequence number, so that these N packets with the same sequence number can be transferred.
  • Send to N working nodes That is to say, the computing switch in the network needs to carry the congestion information in the message obtained after the aggregation is completed, and send the message that carries the congestion information after the aggregation is completed to N working nodes, because only to N working nodes All messages with the same sequence number can be sent to the N working nodes to obtain the congestion information in the same batch of messages, which means that the congestion information sent to the N working nodes is synchronized, so that These N working nodes can perform synchronous congestion control based on the congestion information in the received message, avoiding the situation that the working node corresponding to the communication link that is not congested causes the transmission to be interrupted or even timed out due to the excessively fast transmission rate. .
  • the N working nodes respectively perform congestion control based on the congestion information, which can be understood as the N working nodes synchronously reducing the rate of sending messages corresponding to each other, etc., which will not be specifically done in this embodiment of the application. Limited description.
  • the in-network computing switch can obtain congestion information in a variety of ways, and realize the synchronization of congestion information in different ways, which will be described in detail in the following embodiments:
  • Case 1 The working node corresponding to the congested communication link informs the computing switch in the network.
  • Case 2 Active detection by the computing switch in the network.
  • FIG. 4 is a schematic diagram of another embodiment of the method for synchronizing congestion information provided by the embodiment of this application.
  • another embodiment of the method for synchronizing congestion information provided by the embodiment of the present application may include:
  • the in-network computing switch obtains the first message sent by the first working node, the first message carries congestion information, and the congestion information includes the first value on the ECN flag bit of the display congestion notification of the first message, and the first value is used To indicate that the first communication link is congested.
  • the communication port of the computing switch in the network is not congested, but it is congested with any communication port of other switches connected to the computing switch in the network.
  • the first working node here can be understood as passing the first working node.
  • a communication link is indirectly connected to the computing switch in the network, then the first working node corresponding to the first communication link that is congested will carry the congestion information in the first message and send it to the computing switch in the network. .
  • the congestion information may include the first value on the ECN flag bit of the first packet, and the ECN flag bit in the first packet is a field with a length of 2 bits located in the header of the packet.
  • the aforementioned ECN flag is located in the fourth version of the Internet communication protocol (Internet protocol version 4, IPv4) or Internet protocol version 6 (Internet protocol version 6, IPv6) in the 2bit field of the packet header; while in the wireless broadband technology (InfiniBand, IB) protocol, the ECN flag is located in the basic transmission
  • the 2-bit field of the header (base transport header, BTH) can be specifically composed of forward explicit congestion notification (FECN) or backward explicit congestion notification (BECN), that is, the first The one bit is the FECN bit, and the latter bit is the BECN bit, which will not be specifically limited in the embodiment of the present
  • the first value is the value on the ECN flag bit of the aforementioned first message, which can be used to indicate that the first communication link is congested.
  • FIG. 5 is a schematic diagram of the state of the ECN flag bit of the RoCE v2 protocol or the TCP protocol proposed in the embodiment of this application. It can be seen from Figure 5 that when the value of the ECN field in the IPv4 or IPv6 packet header is 11, the corresponding state is the forward congestion flag, indicating that congestion occurs. Therefore, the ECN in the RoCE v2 protocol or the TCP protocol The first value on the flag bit may take a value of 11, which is used to indicate that the first communication link between the first working node and the computing switch in the network is congested.
  • the value of the FECN bit is 1 indicating that congestion occurs, and the value of the BECN bit is 1 also indicating congestion.
  • the value of the FECN bit is 1, which means that A is experiencing congestion in the process of sending data stream to B; if the data stream flows from the working node B to the working node A, and the value of the BECN bit is 1, it means that B is sending to A Congestion is encountered in the process of data flow. Therefore, the first value on the ECN flag bit in the InfiniBand protocol may include: the value of the first bit is 1, or the value of the second bit is 1.
  • the value of the ECN field, the FECN bit, or the BECN bit may also use other values to indicate the occurrence of congestion in practical applications, which will not be specifically limited in the embodiment of the present application.
  • the in-network computing switch sends N packets with the same sequence number to N working nodes, and the N packets with the same sequence number all carry congestion information.
  • Working node 1 and working node 2 that are not in congestion will continuously send data packets to the computing switch in the network, which can easily cause the buffer area of the computing switch in the network to overflow and be exhausted. Based on the calculation in the network, the transmission rate in the network often depends on the flow control characteristics of the slowest link in the topology. Before the aggregation of a data message with a certain sequence number is completed, the data message sent by the working node will be cached. Up or being discarded, causing the congestion information to become outdated and invalid.
  • the in-network computing switch detects that the first message obtained from the first working node carries congestion information, it will pass a timer, a message timer, etc. Monitor the aging period of the congestion information in the first message.
  • the computing switch in the network will carry the congestion information in the N packets with the same sequence number, and send the same N sequence numbers to the N working nodes.
  • the message not only realizes that the congestion information can be synchronized to these N working nodes, so that after receiving these N messages with the same sequence number, the N working nodes can synchronize according to the congestion information carried in the message
  • Local congestion control fills the gap in the lack of applicable congestion information synchronization in the intranet computing network, and can also solve the problem of failure of congestion information in the intranet computing network based on the first value being within the time limit.
  • the method for synchronizing congestion information may further include:
  • the calculation switch in the network modifies the value of the ECN flag bit of the second packet to the first value to obtain the third packet.
  • the second packet is the first packet to be aggregated within the validity period.
  • the serial number of the message is the same as the serial number of the third message;
  • the computing switch in the network sends N packets with the same sequence number to N working nodes, including:
  • the computing switch in the network sends N third messages to N working nodes, and the first value in each third message indicates that the corresponding working node performs congestion control, and the sequence numbers in the N third messages are the same.
  • the in-network computing switch first parses the first message, and based on the flow control feature that the in-network computing switch will only send the message out after completing the aggregation calculation. Therefore, regardless of whether the first packet obtained after parsing is a packet of the first type or a packet of the second type, the computing switch in the network needs to wait for the first aggregation within the congestion indicator aging period of the first value.
  • the completed message that is, the second message, and then modify the value of the ECN flag bit of the second message to the first value.
  • the purpose is to carry the congestion information in the second message, so that it can be
  • the modified second message is taken as the third message carrying congestion information.
  • the computing switch in the network can send N third messages to N working nodes to synchronize the congestion information, so that the first value in each third message indicates that the corresponding working node performs congestion control, and further The ground makes the sending rate of each working node tend to be smooth.
  • distinguishing whether the first message belongs to the first type of message or the second type of message can be determined by the message length of the first message. For example: when the message length of the first message is within the first preset message length, it can be determined that the first message belongs to the first type of message; when the message length of the first message is in the first 2. When the message length is within the preset message length, it can be determined that the first message belongs to the message of the second type.
  • the aforementioned first preset message length is greater than the second preset message length, and the first type of message can be understood to be able to perform aggregation calculations, or directly broadcast data messages; and the second type of messages It can be understood that neither aggregate calculations nor broadcast data packets can be performed.
  • the in-network computing switch modifies the value on the ECN flag bit of the second packet to There can also be multiple ways of the first value, which can be understood with reference to the following ways:
  • Method 1 When the ECN flag bit of the first packet includes the first ECN field and the ECN flag bit of the second packet includes the second ECN field, the in-network computing switch will modify the value in the second ECN field to the first The first value in the ECN field.
  • the ECN flag bit in the first message received is the first ECN field
  • the value in the second ECN field in the second message is modified to Same as the first value, such as: modified to "11", so that the congestion information carried in the first message can be copied to the second message, which provides multiple application possibilities for subsequent synchronization of congestion information sex.
  • Method 3 When the ECN flag bit of the first message includes the first backward display congestion notification BECN bit, and the ECN flag bit of the second message includes the second BECN bit, the on-net computing switch will set the value in the second BECN bit The value is modified to the first value on the first BECN bit.
  • the ECN flag in the InfiniBand protocol is located in the 2bit field in the BTH header, and the 2bit field is composed of FECN and BECN, and the value on the FECN bit is "1", or the value "1" on the BECN bit can indicate congestion.
  • the ECN flag bit in the first message received is the first FECN bit
  • the value in the second FECN bit in the second message is modified to be the same as the first value.
  • modify to "1” if the ECN flag bit in the first message received is the first BECN bit, then the value in the second BECN bit in the second message is modified to be the same as the first value, such as: 1", so that the congestion information carried in the first message can be copied to the second message, which provides multiple application possibilities for subsequent synchronization of congestion information.
  • the value of the second FECN bit is set to “1” or the value of the second BECN bit is set to "1" to indicate that congestion occurs. This is only a schematic description, and in practical applications It is also possible to define the value on the second FECN bit or the value on the second BECN bit as other numerical values to indicate the occurrence of congestion, which will not be specifically limited in the embodiment of this application.
  • the method of congestion information synchronization may further include:
  • the in-network computing switch receives the fourth message sent by the first working node during the congestion indication aging period of the first value, the value on the ECN flag bit in the fourth message is the first value;
  • the calculation switch in the network ignores the first value in the fourth packet.
  • the network computing switch receives the fourth message sent by the first working node, at this time, because the value on the ECN flag bit in the fourth message is the same as that of the first working node.
  • the first value in the congestion information carried in one message is the same, it means that the fourth message also carries the congestion information.
  • the network computing switch has started a timer to monitor the aging of the first value when it receives the first message, and in order to avoid repeated copying and sending of congestion information, if the congestion indication is at the first value at this time
  • the fourth packet that also carries congestion information is also received within the validity period.
  • the calculation switch in the network does not need to restart another timer when the fourth packet is received, but ignores the fourth packet.
  • the first value That is to say, the computing switch in the network can ignore the congestion information in the fourth packet, and forward the fourth packet to the destination according to the original forwarding rules, that is, only need to perform the congestion information carried in the first packet. Just send it synchronously, saving network resources.
  • the in-network computing switch ignores the congestion information.
  • the congestion indication aging at the first value has expired, then the congestion information corresponding to the first value has expired.
  • the network computing switch will synchronize the invalid congestion information and it will not be able to make N
  • Each working node performs congestion control synchronously, so the computing switch in the network can ignore the congestion information in the first message, send the first message to the destination according to the original forwarding rules, and re-transmit the congested communication link Obtain other congestion information that has not failed from the corresponding working node.
  • FIG. 6 is a schematic diagram of another embodiment of a method for synchronization of congestion information provided in an embodiment of this application.
  • another embodiment of the method for synchronizing congestion information provided by the embodiment of the present application may include:
  • the computing switch in the network modifies the value of the ECN flag in the N data packets to be broadcast to obtain congestion information.
  • the N data messages to be broadcast are messages with the same sequence number among the N working nodes.
  • the in-network computing switch can monitor the cache queue information where the messages sent by N working nodes are located. When the cache queue information has exceeded the cache threshold, the in-network computing switch can determine among the N working nodes. The port status between any of the working nodes and the computing switch in the network has shown congestion, that is, the port status between the first working node and the computing switch in the network shows congestion.
  • the first working node here can be understood as a working node that is directly connected to the computing switch in the network through the first communication link.
  • the first working node is only any one of the N working nodes. It is not limited in the embodiment of this application; secondly, in addition to the way that the in-network computing switch judges whether the port is congested by caching queue information, in practical applications, it can also determine the port by other judgment methods such as port utilization. It is in a congested state, which will not be specifically limited in the embodiment of the present application.
  • N data messages to be broadcast are messages with the same sequence number obtained after the calculation switch in the network completes the aggregation calculation of the data messages with the same sequence number sent by the N working nodes. .
  • the description of the serial number can be understood with reference to step 202 in FIG. 2, and details will not be repeated here.
  • the computing switch in the network sends the modified N data messages to be broadcast to N working nodes, and the values on the ECN flag bits in the modified N data messages to be broadcast are used to instruct the N working nodes to perform Congestion control.
  • the obtained N modified data messages to be broadcast all carry congestion information, so the network calculation switch Then the N modified data messages to be broadcast can be sent to N working nodes, which not only realizes that the congestion information can be synchronized to these N working nodes, but also fills the gap of the lack of applicable congestion information synchronization in the intranet computing network.
  • the N working nodes can perform synchronous congestion control according to the congestion information carried in the modified data message to be broadcast, and further make the N working nodes
  • the sending rate of each working node in the network tends to be smooth, so as to avoid the situation that the working node corresponding to the communication link that is not congested causes transmission interruption or even timeout because the sending rate is too fast.
  • the in-network computing switch modifies the value on the ECN flag bit of the second packet to There can also be multiple ways of the first value. Therefore, the calculation switch in the network can modify the value of the ECN flag in the N data messages to be broadcast, which can be understood by referring to the following ways:
  • the second method when the ECN flag bit in the data message to be broadcast includes the third FECN bit, the in-network computing switch sets the value in the third FECN bit.
  • the ECN flag bit in the InfiniBand protocol is located in the 2bit field in the BTH header, and the 2bit field is composed of the FECN bit and the BECN bit, and the value of the FECN bit is "1", or BECN
  • the value "1" in the bit can indicate that congestion occurs.
  • the computing switch in the network sends N packets with the same sequence number that all carry congestion information to N working nodes, which not only realizes that the congestion information can be synchronized to these N working nodes, so that N
  • the working nodes can perform synchronous congestion control according to the congestion information carried in the message, filling in the gap of the lack of applicable congestion information synchronization in the computing network in the network, and further making the N working nodes
  • the sending rate of each working node tends to be smooth.
  • the foregoing mainly introduces the congestion information synchronization method provided by the embodiment of the present application from the perspective of the method. It can be understood that in order to realize the above-mentioned functions, corresponding hardware structures and/or software modules for performing each function are included. Those skilled in the art should easily realize that in combination with the modules and algorithm steps of the examples described in the embodiments disclosed in the present application, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software-driven hardware depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.
  • the embodiments of the present application may divide the device into functional modules according to the foregoing method examples.
  • each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module.
  • the above-mentioned integrated modules can be implemented in the form of hardware or software functional modules. It should be noted that the division of modules in the embodiments of the present application is illustrative, and is only a logical function division, and there may be other division methods in actual implementation.
  • an embodiment of the in-network computing switch in the embodiment of the present application includes:
  • the obtaining unit 701 is configured to obtain congestion information, and the congestion information is used to indicate that a first communication link is congested, and the first communication link is a link between a first working node and the computing switch in the network, and The first working node is any one of N working nodes, and N is an integer greater than 2;
  • the sending unit 702 is configured to send N messages with the same sequence number to N working nodes.
  • the N messages with the same sequence number all carry the congestion information obtained by the obtaining unit 701, so that the N working nodes are based on congestion. Information is used for congestion control.
  • the sending unit 702 sends to N working nodes N packets with the same sequence numbers that all carry the congestion information obtained by the obtaining unit 701, so that the congestion information can be synchronized to the N working nodes, filling the network.
  • N working nodes can synchronize congestion control according to the congestion information carried in the message, so that the sending rate of each working node tends to be smooth.
  • the obtaining unit 701 may include:
  • the first obtaining module 7011 is configured to obtain the first message sent by the first working node, the first message carries congestion information, and the congestion information includes the first value on the ECN flag bit of the display congestion notification of the first message. The value is used to indicate that the first communication link is congested, where the first working node is any one of the N working nodes;
  • the sending unit 702 may include:
  • the first sending module 7021 is configured to send N packets with the same sequence number and N packets with the same sequence number to N working nodes within the congestion indication aging period of the first value obtained by the first acquisition module 7011 Both carry congestion information.
  • the first sending module 7021 carries the congestion information obtained by the first obtaining module 7011 in all N packets with the same sequence number, and Sending these N messages with the same sequence number to N working nodes, not only realizes that congestion information can be synchronized to these N working nodes, and fills the gap in the lack of applicable congestion information synchronization in the intranet computing network, but also It can enable N working nodes to perform synchronous congestion control according to the congestion information carried in the message, and further solve the failure problem of the congestion information in the in-network computing network based on the first value being within the validity period.
  • the in-network computing switch may further include:
  • the modifying unit 703 is configured to modify the value of the ECN flag bit of the second message to the first value before the first sending module 7021 sends N messages with the same sequence number to the N working nodes to obtain the third Message, the second message is the first message to be aggregated within the validity period, and the sequence number of the second message is the same as the sequence number of the third message;
  • the first sending module 7021 includes:
  • the first sending sub-module 70211 is configured to send N third messages obtained by the modification unit 703 to N working nodes.
  • the first value in each third message indicates that the corresponding working node performs congestion control.
  • the sequence numbers in the three messages are the same.
  • the in-network computing switch further includes:
  • the acquiring unit 701 is configured to receive a fourth message sent by the first working node within the congestion indication aging period of the first value, and the value on the ECN flag bit in the fourth message is the first value;
  • the ignoring unit is used to ignore the first value in the fourth message obtained by the obtaining unit 701.
  • the modifying unit 703 is configured to include the ECN flag bit of the first packet When the first ECN field and the ECN flag bit of the second packet include the second ECN field, modify the value in the second ECN field to the first value in the first ECN field; or,
  • the modification unit 703 is configured to: when the ECN flag bit of the first message includes the first forward display congestion notification FECN bit, and the ECN flag bit of the second message includes the second FECN bit, change the value in the second FECN bit Modify to the first value in the first FECN bit; or,
  • the modifying unit 703 is configured to: when the ECN flag bit of the first message includes the first backward display congestion notification BECN bit, and the ECN flag bit of the second message includes the second BECN bit, the value in the second BECN bit is changed Modified to the first value on the first BECN bit.
  • the obtaining unit 701 may include:
  • the second acquisition module 7012 is used to modify the value of the ECN flag bit in the N data packets to be broadcast when the port status between the first working node and the in-network computing switch shows congestion to obtain the congestion Information, where the N data messages to be broadcast are messages with the same sequence number among the N working nodes, and the second working node is any one of the N working nodes;
  • the sending unit 702 includes:
  • the second sending module 7022 is used to send modified N data messages to be broadcast to N working nodes, and the values on the ECN flag bits in the modified N data messages to be broadcast are used to indicate N jobs respectively The node performs congestion control.
  • the second sending module 7022 may send the N modified data messages to be broadcast to N working nodes, so that each modified data message to be broadcast carries the data obtained by the second obtaining module 7012 Congestion information, so that the congestion information can be synchronized to these N working nodes, filling the gap of the lack of applicable congestion information synchronization in the computing network in the network; and allowing the N working nodes to be based on the modified data message to be broadcast
  • the congestion information carried in the congestion control is performed synchronously, which further makes the sending rate of each of the N working nodes tend to be smooth.
  • the second obtaining module 7012 is used for the ECN flag in the data message to be broadcast
  • the calculation switch in the network sets the value in the third ECN field
  • the second acquisition module 7012 is configured to set the value in the third FECN bit by the in-network computing switch when the ECN flag bit in the data message to be broadcast includes the third FECN bit.
  • FIG. 11 is a schematic diagram of the hardware structure of a communication device in an embodiment of the present application. As shown in FIG. 11, the communication device may include:
  • the communication device includes at least one processor 1101, a communication line 1107, a memory 1103, and at least one communication interface 1104.
  • the processor 1101 may be a general-purpose central processing unit (central processing unit, CPU), a microprocessor, an application-specific integrated circuit (server IC), or one or more programs for controlling the execution of the program of this application Integrated circuits.
  • CPU central processing unit
  • server IC application-specific integrated circuit
  • the communication line 1107 may include a path to transmit information between the aforementioned components.
  • Communication interface 1104 which uses any device such as a transceiver to communicate with other devices or communication networks, such as Ethernet, radio access network (RAN), wireless local area networks (WLAN), etc. .
  • RAN radio access network
  • WLAN wireless local area networks
  • the memory 1103 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, random access memory (RAM), or other types that can store information and instructions
  • ROM read-only memory
  • RAM random access memory
  • the dynamic storage device, the memory can exist independently, and is connected to the processor through the communication line 1107.
  • the memory can also be integrated with the processor.
  • the memory 1103 is used to store computer-executed instructions for executing the solution of the present application, and the processor 1101 controls the execution.
  • the processor 1101 is configured to execute computer-executable instructions stored in the memory 1103, so as to implement the congestion information synchronization method provided in the foregoing embodiment of the present application.
  • the computer-executable instructions in the embodiments of the present application may also be referred to as application program codes, which are not specifically limited in the embodiments of the present application.
  • the communication device may include multiple processors, such as the processor 1101 and the processor 1102 in FIG. 11.
  • processors can be a single-CPU (single-CPU) processor or a multi-core (multi-CPU) processor.
  • the processor here may refer to one or more devices, circuits, and/or processing cores for processing data (for example, computer program instructions).
  • the communication apparatus may further include an output device 1105 and an input device 1106.
  • the output device 1105 communicates with the processor 1101 and can display information in a variety of ways.
  • the input device 1106 communicates with the processor 1101 and can receive user input in a variety of ways.
  • the input device 1106 may be a mouse, a touch screen device, a sensor device, or the like.
  • the aforementioned communication device may be a general-purpose device or a dedicated device.
  • the communication device may be a router, an in-network computing switch, or a device with a similar structure in FIG. 11.
  • the embodiment of the present application does not limit the type of the communication device.
  • the above-mentioned acquisition unit 701, first acquisition module 7011, and second acquisition module 7012 can all be implemented by the input device 1106, and the sending unit 702, the first sending module 7021, the first sending sub-module 70211, and the second sending module 7022 can all be implemented through the input device 1106.
  • the output device 1105 is implemented, and both the modification unit 703 and the ignoring unit can be implemented by the processor 1101 or the processor 1102.
  • the disclosed system, device, and method can be implemented in other ways.
  • the device embodiment described above is only illustrative.
  • the division of the unit is only a logical function division, and there may be other division methods in actual implementation, for example, multiple units or components may be combined or may be Integrate into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
  • the unit described as a separate component may or may not be physically separated, and the component displayed as a unit may or may not be a physical unit, that is, it may be located in one place, or may also be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the above-mentioned integrated unit can be implemented in the form of hardware or software functional unit.
  • 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.
  • the technical solution of the present application essentially or the part that contributes to the existing technology 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 several instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method in each embodiment of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disks or optical disks and other media that can store program codes. .

Landscapes

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

Abstract

Sont divulgués dans les modes de réalisation de la présente demande un procédé de synchronisation d'informations de congestion et un appareil associé, appliqués à un scénario d'un réseau informatique en réseau, et utilisés pour combler l'espace lié à l'absence de synchronisation d'informations de congestion applicable dans le réseau informatique en réseau et pour amener le débit de transmission de chacun de N nœuds de travail à être fluide afin d'éviter l'interruption ou même l'expiration de transmission provoquée par des débits de transmission excessivement rapides des nœuds de travail correspondant à des liaisons de communication dans lesquelles une congestion ne se produit pas. Le procédé de synchronisation d'informations de congestion consiste à : obtenir des informations de congestion, les informations de congestion étant utilisées pour indiquer qu'une congestion se produit dans une première liaison de communication, la première liaison de communication étant une liaison entre un premier nœud de travail et un commutateur informatique en réseau, le premier nœud de travail étant l'un quelconque parmi N nœuds de travail, et N représentant un nombre entier supérieur à 2 ; et envoyer aux N nœuds de travail N paquets ayant le même numéro de séquence, tous les N paquets ayant le même numéro de séquence transportant les informations de congestion, de sorte que les N nœuds de travail effectuent séparément une commande de congestion sur la base des informations de congestion.
PCT/CN2021/083150 2020-04-09 2021-03-26 Procédé de synchronisation d'informations de congestion et appareil associé WO2021203985A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010273713.0 2020-04-09
CN202010273713.0A CN113518037A (zh) 2020-04-09 2020-04-09 一种拥塞信息同步的方法以及相关装置

Publications (1)

Publication Number Publication Date
WO2021203985A1 true WO2021203985A1 (fr) 2021-10-14

Family

ID=78022429

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/083150 WO2021203985A1 (fr) 2020-04-09 2021-03-26 Procédé de synchronisation d'informations de congestion et appareil associé

Country Status (2)

Country Link
CN (1) CN113518037A (fr)
WO (1) WO2021203985A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117544567A (zh) * 2024-01-09 2024-02-09 南京邮电大学 存传一体的rdma数据中心拥塞控制方法
WO2023244872A3 (fr) * 2023-09-25 2024-06-06 Huawei Technologies Co., Ltd. Protocole de transport pour informatique en réseau dans la prise en charge d'applications basées sur rpc

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115396372B (zh) * 2022-10-26 2023-02-28 阿里云计算有限公司 数据流的速率控制方法、智能网卡、云端设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101754266A (zh) * 2008-12-15 2010-06-23 中国移动通信集团公司 调整传输速率、重定向路由的方法、系统及装置
CN102196502A (zh) * 2011-04-06 2011-09-21 东南大学 一种面向无线传感器网络的拥塞控制方法
CN102474452A (zh) * 2009-07-02 2012-05-23 高通股份有限公司 跨多个分组的控制信息的传输
CN104581821A (zh) * 2015-01-28 2015-04-29 湘潭大学 基于节点缓存长度公平分配速率的拥塞控制方法
US20150188820A1 (en) * 2013-12-31 2015-07-02 International Business Machines Corporation Quantized congestion notification (qcn) extension to explicit congestion notification (ecn) for transport-based end-to-end congestion notification

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101754266A (zh) * 2008-12-15 2010-06-23 中国移动通信集团公司 调整传输速率、重定向路由的方法、系统及装置
CN102474452A (zh) * 2009-07-02 2012-05-23 高通股份有限公司 跨多个分组的控制信息的传输
CN102196502A (zh) * 2011-04-06 2011-09-21 东南大学 一种面向无线传感器网络的拥塞控制方法
US20150188820A1 (en) * 2013-12-31 2015-07-02 International Business Machines Corporation Quantized congestion notification (qcn) extension to explicit congestion notification (ecn) for transport-based end-to-end congestion notification
CN104581821A (zh) * 2015-01-28 2015-04-29 湘潭大学 基于节点缓存长度公平分配速率的拥塞控制方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023244872A3 (fr) * 2023-09-25 2024-06-06 Huawei Technologies Co., Ltd. Protocole de transport pour informatique en réseau dans la prise en charge d'applications basées sur rpc
CN117544567A (zh) * 2024-01-09 2024-02-09 南京邮电大学 存传一体的rdma数据中心拥塞控制方法
CN117544567B (zh) * 2024-01-09 2024-03-19 南京邮电大学 存传一体的rdma数据中心拥塞控制方法

Also Published As

Publication number Publication date
CN113518037A (zh) 2021-10-19

Similar Documents

Publication Publication Date Title
WO2021203985A1 (fr) Procédé de synchronisation d'informations de congestion et appareil associé
US11228534B2 (en) Congestion control method, network device, and network interface controller
WO2021012697A1 (fr) Procédé, dispositif et système d'entraînement faisant appel à un modèle mos
US9571382B2 (en) Method, controller, and system for processing data packet
WO2017070970A1 (fr) Procédé de détermination de route et appareil et système correspondants
WO2017016106A1 (fr) Procédé et système d'établissement de tunnel de communication qos prise en charge basé sur sdn
US20130287038A1 (en) Synchronization of traffic multiplexing in link aggregation
US9025451B2 (en) Positive feedback ethernet link flow control for promoting lossless ethernet
WO2020063339A1 (fr) Procédé, dispositif et système pour réaliser une transmission de données
US20190149475A1 (en) Unified streamlining for data traffic
JP2010518782A (ja) 無線通信システムにおけるストリーミングメディアサービスのためのプロキシベースのシグナリングアーキテクチャ
US9253237B2 (en) Rich media status and feedback for devices and infrastructure components using in path signaling
WO2018213987A1 (fr) Procédé, dispositif et système de distribution de données
CN107454000B (zh) 网络数据传输装置及方法
WO2020147440A1 (fr) Procédé, appareil et système de rapport d'utilisation de données
WO2021238799A1 (fr) Procédé et appareil de transmission de paquet de données
US8787160B2 (en) Method, apparatus, and system for judging path congestion
CN110691379A (zh) 一种适于无线自组网的主动式路由通信方法
WO2023116580A1 (fr) Procédé et appareil de commutation de trajet, dispositif de réseau et système de réseau
CN115766605A (zh) 网络拥塞控制方法、装置及系统
CN114710975A (zh) 多域间传输多传输网络上下文标识
WO2022042386A1 (fr) Procédé de commande d'envoi de messages, dispositif de réseau et système
WO2020108020A1 (fr) Procédé de traitement de contrôle de congestion, appareil de transfert de message, et appareil de réception de message
Yang et al. Improving XCP to achieve max–min fair bandwidth allocation
WO2019119836A1 (fr) Procédé et dispositif de traitement de messages

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21785032

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21785032

Country of ref document: EP

Kind code of ref document: A1