Abstract: One aspect of the instant application provides a system and method for managing a switch buffer. During operation, the system establishes a hierarchical accounting structure to determine utilizations of different elements of a buffer on the switch. The hierarchical accounting structure comprises one or more parent elements, and each parent element is associated with one or more child elements. The system determines a base utilization of a child element based on an amount of buffer space allocated to the child element and an amount of buffer space used by the child element, and determines an adaptive utilization of the child element based at least on the base utilization of the child element and a congestion state of a corresponding parent element. Determining the adaptive utilization of the child element comprises performing a table lookup operation.

Abstract: One aspect of the instant application provides a system and method for managing a switch buffer. During operation, the system establishes a hierarchical accounting structure to determine utilizations of different elements of a buffer on the switch. The hierarchical accounting structure comprises one or more parent elements, and each parent element is associated with one or more child elements. The system determines a base utilization of a child element based on an amount of buffer space allocated to the child element and an amount of buffer space used by the child element, and determines an adaptive utilization of the child element based at least on the base utilization of the child element and a congestion state of a corresponding parent element. Determining the adaptive utilization of the child element comprises performing a table lookup operation.

Abstract: A method for handling of conflicts in a multicast routing election in a multicast network is described herein. The multicast network includes a plurality of multicast network devices. A conflict is detected in a Designated Forwarder (DF) election for a link.

Abstract: According to an example, a counter update determination module may receive a counter address for a local counter and map the counter address to a specific forwarding mode of a plurality of forwarding modes. In addition, a remote processing module may receive a posted value associated with the local counter. The remote processing module may include a plurality of forwarding engines respectively associated with a mapped forwarding mode. A forwarding engine of the plurality of forwarding engines may be selected based on the mapped forwarding mode, and the selected forwarding engine may forward the posted value to a remote device for remote processing.

Abstract: A forward counter block may include at least one of a plurality of local counter storage elements for counting events. The forward counter block may also include an update engine, the update engine configured to update an external memory by forwarding a value stored in any of said at lease one of a plurality of local counter storage elements and return a zero value to that local counter storage element, when the value stored in that local counter storage element reaches or surpasses a threshold value.

Abstract: Techniques are provided for determining if an element is contained in a set of elements. In one aspect, an element may be received and inserted into a bloom filter. The element may also be inserted into a memory associative on the bloom filter indexes. In another aspect, a search element may be received and compared to a bloom filter. If the search element is included in the bloom filter, a memory may be used to determine if the search element is included in the set of elements.

Abstract: Techniques are provided for determining if an element is contained in a set of elements. In one aspect, an element may be received and inserted into a bloom filter. The element may also be inserted into a memory associative on the bloom filter indexes. In another aspect, a search element may be received and compared to a bloom filter. If the search element is included in the bloom filter, a memory may be used to determine if the search element is included in the set of elements.

Abstract: Techniques are provided for sending request messages to destination nodes. Destination nodes may be indicated as unresolved. Request messages are sent to destination nodes indicated as unresolved.

Abstract: Methods for controlling a Designated Forwarder (DF) election in a multicast network are described herein. The multicast network includes a plurality of multicast network devices, including a first network device and a second network device. A Designated Forwarder is determined. It is determined whether to initiate a Designated Forwarder election based on a comparison of a metric measuring a distance to a Rendezvous Point Address from a first network device and a metric measuring the distance to the Rendezvous Point Address from the second network device.

Abstract: Techniques for reducing a number of physical counters are provided. Logical counters may be associated with physical counters. The number of physical counters may be less than the number of logical counters. It may be determined if an association of a logical counter to a physical counter exists already. If not, a new association may be created. The physical counter associated with the logical counter may then be updated.

Abstract: A method for sliding window processing of a datagram split into packets, may include processing entire strings of adjacent consecutive packets of the datagram regardless the order of the packets using parallel processors. The method may also include processing adjacent ends of the strings of the adjacent consecutive packets while maintaining the order of the adjacent ends to correspond to the order of the consecutive packets.

Abstract: A network, network devices, and methods are described for packet processing indication. A method includes tunneling a packet from a first network device to a second network device associated with a first checking functionality. The second network device has an address different than an original destination address of the packet. The method also includes return-tunneling the packet from the second network device to the first network device with an indication of whether the packet was processed by the first checking functionality. The method includes tunneling the packet from the first network device to a third network device associated with a second checking functionality in response to the indication being that the packet was not processed by the first checking functionality. The third network device has an address different from the original destination address of the packet.

Abstract: According to an example, a counter update determination module may receive a counter address for a local counter and map the counter address to a specific forwarding mode of a plurality of forwarding modes. In addition, a remote processing module may receive a posted value associated with the local counter. The remote processing module may include a plurality of forwarding engines respectively associated with a mapped forwarding mode. A forwarding engine of the plurality of forwarding engines may be selected based on the mapped forwarding mode, and the selected forwarding engine may forward the posted value to a remote device for remote processing.

Abstract: According to an example, a counter policy implementation apparatus may include a policy determination module to receive a counter address for a local counter and to map the counter address to a specific policy of a plurality of policies, and a policy application module to receive a posted value and a double data rate (DDR) value associated with the local counter. The policy application module may include a comparator to compare the posted value or the DDR value with a maximum value associated with the local counter specified in the mapped policy, and an action block to perform an action specified by the mapped policy based on the comparison.

Abstract: Techniques are provided for determining if an element is contained in a set of elements. In one aspect, an element may be received and inserted into a bloom filter. The element may also be inserted into a memory associative on the bloom filter indexes. In another aspect, a search element may be received and compared to a bloom filter. If the search element is included in the bloom filter, a memory may be used to determine if the search element is included in the set of elements.

Abstract: Techniques for reducing a number of physical counters are provided. Logical counters may be associated with physical counters. The number of logical counters may be less than the number of physical counters. It may be determined if an association of a logical counter to a physical counter exists already. If not, a new association may be created. The physical counter associated with the logical counter may then be updated.

Abstract: Methods for controlling a Designated Forwarder (DF) election in a multicast network are described herein. The multicast network includes a plurality of multicast network devices, including a first network device and a second network device. A Designated Forwarder is determined. It is determined whether to initiate a Designated Forwarder election based on a comparison of a metric measuring a distance to a Rendezvous Point Address from a first network device and a metric measuring the distance to the Rendezvous Point Address from the second network device.

Abstract: A method for handling of conflicts in a multicast routing election in a multicast network is described herein. The multicast network includes a plurality of multicast network devices. A conflict is detected in a Designated Forwarder (DF) election for a link.

Abstract: A forward counter block may include at least one of a plurality of local counter storage elements for counting events. The forward counter block may also include an update engine, the update engine configured to update an external memory by forwarding a value stored in any of said at lease one of a plurality of local counter storage elements and return a zero value to that local counter storage element, when the value stored in that local counter storage element reaches or surpasses a threshold value.

Abstract: A method for sliding window processing of a datagram split into packets, may include processing entire strings of adjacent consecutive packets of the datagram regardless the order of the packets using parallel processors. The method may also include processing adjacent ends of the strings of the adjacent consecutive packets while maintaining the order of the adjacent ends to correspond to the order of the consecutive packets.