Abstract: A network device may define a container LSP that includes multiple member LSPs. Each of the multiple member LSPs defines a path from the network device through a network of a plurality of network devices. The network device may receive traffic that includes multiple packet flows. The network device may identify a first set of packet flows that are intolerant to packet reordering. The network device may identify a second set of packet flows that are tolerant to packet reordering. The network device may distribute each of the first set of packet flows to a corresponding one of the multiple member LSPs. The network device may process the second set of packet flows to determine a distribution sequence for the second set of packet flows. The network device may distribute the second set of packet flows among the multiple member LSPs based on the distribution sequence.

Abstract: A network device may define a container LSP that includes multiple member LSPs. Each of the multiple member LSPs defines a path from the network device through a network of a plurality of network devices. The network device may receive traffic that includes multiple packet flows. The network device may identify a first set of packet flows that are intolerant to packet reordering. The network device may identify a second set of packet flows that are tolerant to packet reordering. The network device may distribute each of the first set of packet flows to a corresponding one of the multiple member LSPs. The network device may process the second set of packet flows to determine a distribution sequence for the second set of packet flows. The network device may distribute the second set of packet flows among the multiple member LSPs based on the distribution sequence.

Abstract: Techniques are described for dynamically mapping hash indices to member interfaces of an aggregated interface in a hash data structure. As one example, a network device may compute net weights for the member links of a link aggregation group (LAG) and respective utilization values of hash indices in a hash map for the LAG. The network device may generate binary trees based on the net weights and utilization values of the member links of the LAG, and may map values, e.g., median values, of one or more nodes of the binary trees to member interfaces, and update the hash data structure based on the mapping.

Abstract: The techniques described herein may optimize a set of ordered rules of a security device through the removal of one or more anomalies. For example, a security management system or other configuration management system or component may detect and remove one or more anomalies from a set (e.g., list) of one or more ordered rules to be enforced by the network security device, such as shadowing anomalies, redundancy anomalies, and/or correlation anomalies, among others, as described herein. Security management system may transform the set of ordered rules to replace at least a subset of the rules within one or more mutually exclusive rules. In some instances, the security management system may optimize the transformed rule set, for example, by using redundancy removal and/or join/merge policies.

Abstract: A network device may receive information associated with a set of member links of the network device. The network device may determine a set of weight values, for the set of member links, based on the information associated with the set of member links. The network device may determine a set of multiplier values, for the set of member links, based on the set of weight values. The network device may generate a set of multiplier tables, for the set of member links, based on the set of multiplier values. The network device may generate an allocation table based on the set of multiplier tables. The network device may generate a resolution table based on the allocation table. The network device may provide, to another network device, network traffic via the set of member links based on the resolution table.

Abstract: A device may generate a frame including data to be provided to a client device. The data may be associated with a rate corresponding to the client device. The device may determine rate information, associated with a set of client devices, that identifies the rate and one or more other rates. The device may determine a relative frame transmission time (RFTT) associated with the frame. The device may determine a frame scheduling number (FSN), associated with the frame, based on the RFTT. The device may schedule the frame for provision to the client device based on the FSN. The device may provide the frame to the client device based on scheduling the FSN. The frame may be provided to cause relative airtime fairness between a first group of frames, corresponding to the rate, and a second group of frames, corresponding to the one or more other rates, to be achieved.

Abstract: A device may include one or more processors. The one or more processors may receive a request for one or more parameters associated with the device. The one or more processors may determine, as a response, the one or more parameters associated with the device. The one or more processors may generate a set of logical units associated with encapsulating the one or more parameters. The set of logical units may be associated with a particular communications protocol. The one or more processors may fragment the set of logical units into a set of segments based on a maximum transmission unit (MTU) size for a network path. The set of logical units may be fragmented without fragmenting any logical units of the set of logical units. The one or more processors may transmit the set of segments to a destination network device.