Abstract: A piston limiting structure, including: a cylinder, a piston, and a flange provided with a limiting piece, the cylinder has a piston hole perpendicular to an axial direction of the cylinder and penetrating through the cylinder, and a projection of the piston hole in a penetrating direction is circular. The piston is disposed in the piston hole in a form-fit manner and is slid in the piston hole in a reciprocating manner. A side wall of the piston is provided with a thrust groove, a bottom surface of the thrust groove forms a thrust surface on the side wall of the piston, and the thrust groove does not penetrate through two ends of the side wall of the piston along an axial length of the piston. The limiting piece abuts against the thrust surface.

Abstract: This application provides picture or audio encoding and decoding methods and apparatuses, and relates to the field of artificial intelligence (AI)—based picture or audio encoding and decoding technologies, and specifically, to the field of neural network-based picture feature map or audio feature variable encoding and decoding technologies. The encoding method includes: obtaining a to-be-encoded target, where the to-be-encoded target includes a plurality of feature elements, and the plurality of feature elements include a first feature element. The method further includes: obtaining a probability estimation result of the first feature element; determining, based on the probability estimation result of the first feature element, whether to perform entropy encoding on the first feature element; and performing entropy encoding on the first feature element only when it is determined that entropy encoding needs to be performed on the first feature element.

Abstract: A method is applied to a ring link, where the ring link includes a first node, a second node, a third node, and a fourth node in sequence. According to the method, the first node receives first traffic, where the first node is a source node that sends the first traffic on the ring link; and the first node sends the first traffic to the third node, where two reachable paths with equal hop counts are included from the first node to the third node, the first node sends the first traffic to the third node on a preset first transmission path, the first transmission path passes through the second node, and the first transmission path is one of the two reachable paths with equal hop counts. This method can reduce computing load of nodes while implementing non-blocking switching of traffic between the nodes.

Abstract: A method is applied to a ring link, where the ring link includes a first node, a second node, a third node, and a fourth node in sequence. According to the method, the first node receives first traffic, where the first node is a source node that sends the first traffic on the ring link; and the first node sends the first traffic to the third node, where two reachable paths with equal hop counts are included from the first node to the third node, the first node sends the first traffic to the third node on a preset first transmission path, the first transmission path passes through the second node, and the first transmission path is one of the two reachable paths with equal hop counts. This method can reduce computing load of nodes while implementing non-blocking switching of traffic between the nodes.

Abstract: This disclosure belongs to the field of communication technologies, and provides a network chip management method and apparatus, a communication device, and a storage medium. According to the network chip management method provided in this disclosure, an idle target network chip is determined based on at least one of a port status, a configuration status, and a traffic status of a network chip; and a first functional module in the target network chip is controlled to run at a sleep running frequency, so that power consumption of the target network chip can be effectively reduced.

Abstract: A method is applied to a ring link, where the ring link includes a first node, a second node, a third node, and a fourth node in sequence. According to the method, the first node receives first traffic, where the first node is a source node that sends the first traffic on the ring link; and the first node sends the first traffic to the third node, where two reachable paths with equal hop counts are included from the first node to the third node, the first node sends the first traffic to the third node on a preset first transmission path, the first transmission path passes through the second node, and the first transmission path is one of the two reachable paths with equal hop counts. This method can reduce computing load of nodes while implementing non-blocking switching of traffic between the nodes.

Abstract: A method includes a first node obtaining a first target bandwidth of first traffic on a first path, where the first path is a path used to transmit the first traffic from the first node to a second node. The first target bandwidth is not greater than a minimum value in remaining available bandwidths of single-hop links on the first path, and a single-hop link is a link between two directly connected nodes. The first node sends the first traffic on the first path based on the first target bandwidth. Accordingly, before traffic is transmitted in the network device, available bandwidth resources are predetermined for the traffic, and the traffic corresponding to the available bandwidth resources is transmitted on the determined available bandwidth resources.