Abstract: A data exchange method and apparatus. The method includes: A source node receives flow indication information from a first switching node, where the flow indication information indicates that congestion occurs in a target data flow, and the first switching node is a node in a switching path of the target data flow. The source node sends multiple pieces of write data information and multiple data blocks of the target data flow to multiple switching nodes, where the multiple pieces of write data information indicate the multiple switching nodes to store the multiple data blocks and stop forwarding the multiple data blocks. The multiple switching nodes store the multiple data blocks. The multiple switching nodes receive multiple pieces of scheduling information from a destination node, where the multiple pieces of scheduling information are used to schedule the multiple data blocks.

Abstract: A data transmission method comprises receiving a first data flow; splitting the first data flow into a plurality of data segments, and sending the plurality of data segments along at least two paths, where a first data segment in the plurality of data segments is sent along a first path, the first data segment carries first indication information, and the first indication information indicates at least one node on the first path to cache the first data segment after the at least one node receives the first data segment; and indicating at least one node that is on the first path and that is caching the first data segment to send the first data segment.

Abstract: This application provides a data exchange method and apparatus. The method includes: A source node receives flow indication information from a first switching node, where the flow indication information indicates that congestion occurs in a target data flow, and the first switching node is a node in a switching path of the target data flow. The source node sends multiple pieces of write data information and multiple data blocks of the target data flow to multiple switching nodes, where the multiple pieces of write data information indicate the multiple switching nodes to store the multiple data blocks and stop forwarding the multiple data blocks. The multiple switching nodes store the multiple data blocks. The multiple switching nodes receive multiple pieces of scheduling information from a destination node, where the multiple pieces of scheduling information are used to schedule the multiple data blocks.

Abstract: This application provides a data switching apparatus and a data switching method. The data switching apparatus includes a plurality of dies, the plurality of dies include a plurality of die sets. Each die in the plurality of die sets is coupled to a die in a same die set and a die in a different die set through corresponding interfaces.

Abstract: This application provides a networking processor. The networking processor is provided with a plurality of ports, and the networking processor further includes a plurality of buses and a plurality of switch units. The switch unit is bound to at least one of the ports, and is configured to receive data from outside of the networking processor and send the data to the outside of the networking processor through the bound port. Each of the plurality of buses is bound to at least two of the switch units, each of the switch units is bound to at least one of the plurality of buses, and the switch unit forwards the data between different switch units through a network formed by the plurality of buses. In this application, latency of data switching is reduced.

Abstract: A method for load balancing and packet re-sequencing on a network includes an ingress node that determines an identifier of a destination chip based on a destination address of a packet flow and a forwarding table, allocates, based on the identifier of the destination chip, a channel identifier and a sequence number of each packet that is in the packet flow and that enters a channel, to generate an updated packet flow, where each packet in the updated packet flow includes a packet in a corresponding packet flow, a sequence number of the packet, and the channel identifier, and the updated packet flow is sent in a per-packet load sharing manner.

Abstract: The invention provides a data communication method, including: sending, by the first electrical node, request information to an electrical node, where the request information is used to request an expected data volume quota of a first VOQ, and the first VOQ stores at least one first data packet to be sent to the electrical node; receiving response information, where the response information includes a target data volume quota; and sending the at least one first data packet to the electrical node via the at least one optical node based on the target data volume quota.

Abstract: This application provides example traffic balancing methods, network devices, and electronic devices, and relates to the field of communications technologies. An example electronic device can create or maintain a first flowpac, and classify a packet that uses a first node as a destination into the first flowpac. When a network balancing parameter meets a preset condition, a second flowpac is created or maintained. A subsequent packet that uses the first node as a destination is classified into the second flowpac, where packets belonging to a same flowpac have a same destination node and a same sending path, and a sending path of a packet in the second flowpac is different from a sending path of a packet in the first flowpac.

Abstract: Embodiments of the invention provide a data communication method, including: sending, by a first aggregation node in a first pod, data packets of a first data flow to at least one core node in a core layer in a packet based balancing manner; receiving, by the at least one core node, the data packets of the first data flow, and sending the received data packets to a second aggregation node in a second pod; and receiving, by the second aggregation node, the data packets of the first data flow, and sorting the data packets of the first data flow to obtain the first data flow.

Abstract: A buffer module includes N queues configured to buffer M data streams, where N is less than M. A counting module includes M counters, the M counters are in a one-to-one correspondence with the M data streams, and the M counters are configured to count buffer quantities for the M data streams in the N queues. The control module is configured to, when a count value on a first counter exceeds a corresponding threshold, discard a to-be-enqueued data packet of a data stream corresponding to the first counter, or control the sending module to send pause indication information to an upper-level control module.

Abstract: A method for load balancing and packet re-sequencing on a network includes an ingress node that determines an identifier of a destination chip based on a destination address of a packet flow and a forwarding table, allocates, based on the identifier of the destination chip, a channel identifier and a sequence number of each packet that is in the packet flow and that enters a channel, to generate an updated packet flow, where each packet in the updated packet flow includes a packet in a corresponding packet flow, a sequence number of the packet, and the channel identifier, and the updated packet flow is sent in a per-packet load sharing manner.

Abstract: A data processing apparatus includes N apparatus input ends, an input switch, K buffer areas, a first output switch, a second output switch, and M apparatus output ends. N input ends of the input switch are coupled to the N apparatus input ends, and K output ends of the input switch correspond to the K buffer areas. K1 input ends of the first output switch correspond to K1 buffer areas in the K buffer areas, and M output ends of the first output switch are coupled to the M apparatus output ends. K2 input ends of the second output switch correspond to K2 buffer areas in the K buffer areas except the K1 buffer areas, and M output ends of the second output switch are coupled to the M apparatus output ends.

Abstract: The invention provides a data communication method, including: sending, by the first electrical node, request information to an electrical node, where the request information is used to request an expected data volume quota of a first VOQ, and the first VOQ stores at least one first data packet to be sent to the electrical node; receiving response information, where the response information includes a target data volume quota; and sending the at least one first data packet to the electrical node via the at least one optical node based on the target data volume quota.

Abstract: This application provides a network device, including a buffer module, a counting module, a control module, and a sending module. The buffer module includes N queues, configured to buffer M data streams, where N is less than M. The counting module includes M counters, the M counters are in a one-to-one correspondence with the M data streams, and the M counters are configured to count buffer quantities for the M data streams in the N queues. The control module is configured to: when a count value on a first counter exceeds a corresponding threshold, discard a to-be-enqueued data packet of a data stream corresponding to the first counter, or control the sending module to send pause indication information to an upper-level control module. On one hand, resource consumption of the network device can be reduced. On the other hand, buffer pressure of the network device can be released.

Abstract: The invention provide a data communication method, including: sending, by a first aggregation node in a first pod, data packets of a first data flow to at least one core node in a core layer in a packet based balancing manner; receiving, by the at least one core node, the data packets of the first data flow, and sending the received data packets to a second aggregation node in a second pod; and receiving, by the second aggregation node, the data packets of the first data flow, and sorting the data packets of the first data flow to obtain the first data flow.

Abstract: The present disclosure provides a switch fabric system, the system including M first crossbar units (CUs) and N second CUs, where each first CU includes L first input ports, a first arbiter, a first crossbar, and N first output ports. Each second CU includes M second input ports, a second arbiter, a second crossbar, and one second output port. M×N first output ports of the M first CUs are respectively coupled to N×M second input ports of the N second CUs, where N first output ports of each first CU are respectively coupled to and in a one-to-one correspondence with one second input port of each second CU in the N second CUs. In the example system, N equals M×L, and M, N, and L are all positive integers.

Abstract: A data processing apparatus includes N apparatus input ends, an input switch, K cache areas, a first output switch, a second output switch, and M apparatus output ends. N input ends of the input switch are coupled to the N apparatus input ends, and K output ends of the input switch correspond to the K cache areas. K1 input ends of the first output switch correspond to K1 cache areas in the K cache areas, and M output ends of the first output switch are coupled to the M apparatus output ends. K2 input ends of the second output switch correspond to K2 cache areas in the K cache areas except the K1 cache areas, and M output ends of the second output switch are coupled to the M apparatus output ends.

Abstract: The present disclosure provides a switch fabric system, the system including M first crossbar units (CUs) and N second CUs, where each first CU includes L first input ports, a first arbiter, a first crossbar, and N first output ports. Each second CU includes M second input ports, a second arbiter, a second crossbar, and one second output port. M×N first output ports of the M first CUs are respectively coupled to N×M second input ports of the N second CUs, where N first output ports of each first CU are respectively coupled to and in a one-to-one correspondence with one second input port of each second CU in the N second CUs. In the example system, N equals M×L, and M, N, and L are all positive integers.

Abstract: Embodiments of the present invention relate to the communications field, and provide a multi-chassis cascading apparatus. The apparatus includes a line card chassis LCC, where a fabric interface chip FIC and a switch element SE 1/3 are deployed in each line card chassis LCC; the fabric interface chip FIC is connected to the switch element SE 1/3 that is located in the same line card chassis LCC as the fabric interface chip FIC is; and a switch element SE 2 is deployed in each line card chassis LCC; the switch element SE 1/3 is connected to the switch element SE 2 that is located in the same line card chassis LCC as the switch element SE 1/3 is; and the switch element SE 1/3 is connected to the switch element SE 2 that is located in another line card chassis LCC.

Abstract: A cell processing method and apparatus are provided. The method includes: obtaining, by a first sending end, a first timestamp compensation time; adding, by the first sending end, the first timestamp compensation time to a first timestamp carried in a first cell, where the first timestamp is a sending time of the first cell; and sending, by the first sending end to a receiving end, the first cell that is added with the first timestamp compensation time, so that the receiving end forwards the first cell according to the first timestamp that is added with the first timestamp compensation time. In the present invention, a first timestamp compensation time is added to a first timestamp carried in a first cell, which improves cell forwarding efficiency of the receiving end and prevents the occurrence of cell accumulation in a link.