Patent classifications
H04L47/41
VARIABLE LINK AGGREGATION
A system and method to transmit frames from a first node to a second node over a plurality of radio links comprising a classifier to classify said frames according to one of a plurality of flow and a sequence number within said one of said plurality of flow and adding said flow and sequence number in a header of said classified frame a splitter receiving said classified frames from said classifier and distributing said classified frames on one of said plurality of radio links for transmission to said second node, a joiner receiving said classified frames and reordering them using an indexed sequence queue corresponding to each of said plurality of flows, a timer for waiting for frames missing in the sequence in one of said indexed sequence queue, wherein when said timer expires, if said frame has not arrived it is deemed lost and a forwarder to extract frames from said sequence queue to forward.
LINK AGGREGATION GROUP (LAG) PORT SELECTION
Examples described herein relate to switch circuitry to select a port of a link aggregation group (LAG) based on multiple tables and a multicast group identifier and hash value. In some examples, a first table of the multiple tables comprises indices for indexing into a second table of the multiple tables. In some examples, the second table comprises multiple LAG words to use to construct a LAG entry word.
LINK AGGREGATION GROUP (LAG) PORT SELECTION
Examples described herein relate to switch circuitry to select a port of a link aggregation group (LAG) based on multiple tables and a multicast group identifier and hash value. In some examples, a first table of the multiple tables comprises indices for indexing into a second table of the multiple tables. In some examples, the second table comprises multiple LAG words to use to construct a LAG entry word.
TAGGING PACKETS FOR MONITORING AND ANALYSIS
Some embodiments provide a method for performing data traffic monitoring. The method processes a packet through a packet processing pipeline that includes multiple stages. At a filtering stage, the method tags the packet with a set of monitoring actions for subsequent stages to perform on the packet based on a determination that the packet matches a particular filter. For each stage of a set of packet processing stages subsequent to the filtering stage, the method (i) executes any monitoring actions specified for the stage to perform on the packet and (ii) sends the packet to a next stage in the packet processing pipeline.
FLOW CHARACTERISTIC EXTRACTION METHOD AND APPARATUS
The technology of this application relates to a flow characteristic extraction method and apparatus, and belongs to the field of network technologies. The method includes a network device that determines a burst parameter of a burst traffic segment of a received first packet flow, and determines a burst parameter of the first packet flow based on the burst parameter of the burst traffic segment of the first packet flow. The first packet flow is an elephant flow, the burst traffic segment indicates a burst degree of traffic within one period of time, the burst parameter of the burst traffic segment is a parameter used to describe the burst traffic segment, and the burst parameter of the first packet flow is a parameter used to describe at least one burst traffic segment included in the first packet flow.
FLOW CHARACTERISTIC EXTRACTION METHOD AND APPARATUS
The technology of this application relates to a flow characteristic extraction method and apparatus, and belongs to the field of network technologies. The method includes a network device that determines a burst parameter of a burst traffic segment of a received first packet flow, and determines a burst parameter of the first packet flow based on the burst parameter of the burst traffic segment of the first packet flow. The first packet flow is an elephant flow, the burst traffic segment indicates a burst degree of traffic within one period of time, the burst parameter of the burst traffic segment is a parameter used to describe the burst traffic segment, and the burst parameter of the first packet flow is a parameter used to describe at least one burst traffic segment included in the first packet flow.
ELECTRONIC DEVICE AND METHOD FOR ELECTRONIC DEVICE PROCESSING RECEIVED DATA PACKET
An electronic device is provided. The electronic device includes a network connection device, at least one processor, and a memory operably connected to the at least one processor, wherein the memory store instructions which are configured to, when executed, control the electronic device to receive a data packet from the network connection device, identify an Internet protocol (IP) type of a server, based on header information of the received data packet, identify information related to packet mergence set according to the identified IP type of the server and an IP type of the electronic device, and merge the data packets received from the network connection device or flush the data packets as a network stack, based on the identified information related to the packet mergence.
ELECTRONIC DEVICE AND METHOD FOR ELECTRONIC DEVICE PROCESSING RECEIVED DATA PACKET
An electronic device is provided. The electronic device includes a network connection device, at least one processor, and a memory operably connected to the at least one processor, wherein the memory store instructions which are configured to, when executed, control the electronic device to receive a data packet from the network connection device, identify an Internet protocol (IP) type of a server, based on header information of the received data packet, identify information related to packet mergence set according to the identified IP type of the server and an IP type of the electronic device, and merge the data packets received from the network connection device or flush the data packets as a network stack, based on the identified information related to the packet mergence.
Multi-destination traffic handling optimizations in a network device
When a measure of buffer space queued for garbage collection in a network device grows beyond a certain threshold, one or more actions are taken to decreasing an enqueue rate of certain classes of traffic, such as of multicast traffic, whose reception may have caused and/or be likely to exacerbate garbage-collection-related performance issues. When the amount of buffer space queued for garbage collection shrinks to an acceptable level, these one or more actions may be reversed. In an embodiment, to more optimally handle multi-destination traffic, queue admission control logic for high-priority multi-destination data units, such as mirrored traffic, may be performed for each destination of the data units prior to linking the data units to a replication queue. If a high-priority multi-destination data unit is admitted to any queue, the high-priority multi-destination data unit can no longer be dropped, and is linked to a replication queue for replication.
Multi-destination traffic handling optimizations in a network device
When a measure of buffer space queued for garbage collection in a network device grows beyond a certain threshold, one or more actions are taken to decreasing an enqueue rate of certain classes of traffic, such as of multicast traffic, whose reception may have caused and/or be likely to exacerbate garbage-collection-related performance issues. When the amount of buffer space queued for garbage collection shrinks to an acceptable level, these one or more actions may be reversed. In an embodiment, to more optimally handle multi-destination traffic, queue admission control logic for high-priority multi-destination data units, such as mirrored traffic, may be performed for each destination of the data units prior to linking the data units to a replication queue. If a high-priority multi-destination data unit is admitted to any queue, the high-priority multi-destination data unit can no longer be dropped, and is linked to a replication queue for replication.