Abstract: This application discloses: collecting statistics about a target parameter of a first data flow, where a target queue of a switching device is used to buffer a data packet in at least one data flow, the first data flow is one of the at least one data flow, and the target parameter is used to reflect an amount of data in the first data flow; when a length of the target queue meets a first length condition, determining, based on at least one of the target parameter and an auxiliary parameter of the first data flow, a marking probability corresponding to the first data flow; and performing congestion marking on a data packet in the first data flow based on the marking probability corresponding to the first data flow.

Abstract: Example packet control methods and apparatus are described. One example method includes detecting, by a network node, a packet in a packet flow causing a congestion from an upstream node. The network node reduces a scheduling priority of the packet in the packet flow and generates a congestion isolation message, where the congestion isolation message includes description information of the packet flow. The congestion isolation message is sent to the upstream node to instruct the upstream node to reduce the scheduling priority of the packet in the packet flow.

Abstract: This application discloses a link-state advertisement LSA sending method, an apparatus, and a system, to reduce a quantity of LSA sending times. The method includes: generating, by a first router, a first path table based on level location information of the first router, level location information of a second router, and level location information of at least one third router; sending, by the first router, a first link state update LSU message to the second router; receiving, by the second router, the first link state update LSU message from the first router; updating, by the second router, a link state database LSDB of the second router based on a first LSA; and sending, by the second router, the first LSA to a router corresponding to an identifier in the first path table.

Abstract: This application provides a flow control method, including: sending, by a first device, a first data packet to a second device in a first sending mode; determining, by the first device, a network congestion status; and sending, by the first device, a second data packet to the second device in the second sending mode, where the second sending mode is a sending mode determined by the first device based on the network congestion status, and the second data packet is a data packet to be sent after the first data packet.

Abstract: Example packet control methods and apparatus are described. One example method includes detecting, by a network node, a packet in a packet flow causing a congestion from an upstream node. The network node reduces a scheduling priority of the packet in the packet flow and generates a congestion isolation message, where the congestion isolation message includes description information of the packet flow. The congestion isolation message is sent to the upstream node to instruct the upstream node to reduce the scheduling priority of the packet in the packet flow.

Abstract: This application discloses: collecting statistics about a target parameter of a first data flow, where a target queue of a switching device is used to buffer a data packet in at least one data flow, the first data flow is one of the at least one data flow, and the target parameter is used to reflect an amount of data in the first data flow; when a length of the target queue meets a first length condition, determining, based on at least one of the target parameter and an auxiliary parameter of the first data flow, a marking probability corresponding to the first data flow; and performing congestion marking on a data packet in the first data flow based on the marking probability corresponding to the first data flow.

Abstract: Embodiments of this application provide a method, includes: receiving a first data flow that includes a plurality of data units; inputting N1 data units of the plurality of data units and a first source marking unit into the first source queue; inputting M1 data units of the plurality of data units and a first target marking unit into the first target queue, wherein the N1 data units and the M1 data units are different data units; scheduling the N1 data units and the first source marking unit based on the first source marking unit and the first target marking unit; and scheduling the first target marking unit and the M1 data units, wherein the first target marking unit and the M1 data units are scheduled later than the N1 data units and the first source marking unit are scheduled.

Abstract: Example packet control methods and apparatus are described. One example method includes detecting a packet flow causing a congestion status change. A congestion isolation message is generated and is used to change a priority of a packet in the packet flow. The congestion isolation message includes description information of the packet flow. The congestion isolation message is sent to at least one node.

Abstract: Embodiments of the invention disclose a data transmission method, a device, and a computer storage medium to perform data transmission. A congestion status of a transmission port is obtained by a first device. The transmission port is a communications port used by the first device when a second device transmits data to the first device. The congestion status is used to indicate whether data congestion occurs on the transmission port. Indication information is sent to the second device when a mode switching condition is met. The indication information is used to instruct the second device to switch a transmission mode used when the second device transmits the data, so that the second device transmits the data to the first device in a switched transmission mode, and the mode switching condition is associated with the congestion status of the transmission port.

Abstract: The present disclosure relates to congestion flow identification methods. One example method includes obtaining, by a network device, a queue length of a non-congestion flow queue, where the non-congestion flow queue includes a data packet or description information of the data packet, determining, by the network device, a target output port of a target data packet when the length of the non-congestion flow queue is greater than or equal to a first threshold, where the target data packet is a data packet waiting to enter the non-congestion flow queue or a next data packet waiting to be output from the non-congestion flow queue, and when utilization of the target output port is greater than or equal to a second threshold, determining, by the network device, that a flow corresponding to the target data packet is a congestion flow.

Abstract: A network path measurement method. The method includes: obtaining a first aggregate available bandwidth of a path from the first switching node to a second switching node; obtaining a first available bandwidth of a path from a first target port of a third switching node to the first switching node, where the third switching node is a next-stage switching node connected to the first switching node; obtaining, a second available bandwidth of a path from the second switching node to a fourth switching node, where the fourth switching node is a next-stage switching node connected to the second switching node; and determining a second aggregate available bandwidth of a path from the first target port of the third switching node to the fourth switching node, the second aggregate available bandwidth is a smallest available bandwidth among the first aggregate available bandwidth, the first available bandwidth, and the second available bandwidth.

Abstract: This application provides a method for transmitting path load information and a network node. The method includes: obtaining, by the network node, M pieces of path load information; aggregating, by the network node into one load metric based on the M pieces of path load information, load of all shortest paths that are from the network node to the destination node and that pass through M adjacent nodes corresponding to the M pieces of path load information, where the load metric indicates total load of all the shortest paths from the network node to the destination node; and sending, by the network node, information about the load metric to another adjacent node other than the M adjacent nodes of all adjacent nodes of the network node.

Abstract: Embodiments of this application provide a method, includes: receiving N1 data units from a first data flow; inputting the N1 data units into a first source queue; determining that the first data flow is switched from the first source queue to a first target queue, where the first source queue and the first target queue belong to a first queue pair; inputting a first source marking unit into the first source queue, and inputting a first target marking unit into the first target queue; receiving M1 data units from the first data flow; inputting the M1 data units into the first target queue; and scheduling the N1 data units and the first source marking unit from the first source queue based on the first source marking unit and the first target marking unit, and scheduling the first target marking unit and the M1 data units from the first target queue.

Abstract: Embodiments of the present invention disclose a data transmission method, a device, and a computer storage medium, where the method includes: obtaining, by a first device, a congestion status of a transmission port, where the transmission port is a communications port used by the first device when a second device transmits data to the first device, and the congestion status is used to indicate whether data congestion occurs on the transmission port; and sending indication information to the second device when a mode switching condition is met, where the indication information is used to instruct the second device to switch a transmission mode used when the second device transmits the data, so that the second device transmits the data to the first device in a switched transmission mode, and the mode switching condition is associated with the congestion status of the transmission port.

Abstract: The present disclosure relates to congestion flow identification methods. One example method includes obtaining, by a network device, a queue length of a non-congestion flow queue, where the non-congestion flow queue includes a data packet or description information of the data packet, determining, by the network device, a target output port of a target data packet when the length of the non-congestion flow queue is greater than or equal to a first threshold, where the target data packet is a data packet waiting to enter the non-congestion flow queue or a next data packet waiting to be output from the non-congestion flow queue, and when utilization of the target output port is greater than or equal to a second threshold, determining, by the network device, that a flow corresponding to the target data packet is a congestion flow.

Abstract: This application provides a flow control method, including: sending, by a first device, a first data packet to a second device in a first sending mode; determining, by the first device, a network congestion status; and sending, by the first device, a second data packet to the second device in the second sending mode, where the second sending mode is a sending mode determined by the first device based on the network congestion status, and the second data packet is a data packet to be sent after the first data packet.

Abstract: This application discloses a link-state advertisement LSA sending method, an apparatus, and a system, to reduce a quantity of LSA sending times. The method includes: generating, by a first router, a first path table based on level location information of the first router, level location information of a second router, and level location information of at least one third router; sending, by the first router, a first link state update LSU message to the second router; receiving, by the second router, the first link state update LSU message from the first router; updating, by the second router, a link state database LSDB of the second router based on a first LSA; and sending, by the second router, the first LSA to a router corresponding to an identifier in the first path table.

Abstract: Example packet control methods and apparatus are described. One example method includes detecting a packet flow causing a congestion status change. A congestion isolation message is generated and is used to change a priority of a packet in the packet flow. The congestion isolation message includes description information of the packet flow. The congestion isolation message is sent to at least one node.

Abstract: Embodiments of the present disclosure disclose a Clos network load balancing method and apparatus. In certain embodiments, the method includes receiving, by a first switch, a first packet and determining, by the first switch, a third switch. The third switch is a switch in a second group of switches. The method includes performing, by the first switch, tunnel encapsulation on the first packet, a destination Internet Protocol (IP) address in a tunnel-encapsulated IP header being an IP address of a second switch. The method includes performing, by the first switch, Internet Protocol in Internet Protocol (IP-in-IP) encapsulation on the tunnel-encapsulated first packet and sending, by the first switch, the IP-in-IP encapsulated first packet.

Abstract: A network path measurement method. The method includes: obtaining a first aggregate available bandwidth of a path from the first switching node to a second switching node; obtaining a first available bandwidth of a path from a first target port of a third switching node to the first switching node, where the third switching node is a next-stage switching node connected to the first switching node; obtaining, a second available bandwidth of a path from the second switching node to a fourth switching node, where the fourth switching node is a next-stage switching node connected to the second switching node; and determining a second aggregate available bandwidth of a path from the first target port of the third switching node to the fourth switching node, the second aggregate available bandwidth is a smallest available bandwidth among the first aggregate available bandwidth, the first available bandwidth, and the second available bandwidth.