Abstract: In one embodiment, a method includes receiving, by a network node, traffic within a hierarchical software-defined wide area network (SD-WAN) network. The method also includes determining, by the network node, a destination region of the traffic. The destination region is within the hierarchical SD-WAN network. The method further includes classifying, by the network node, the traffic based on a destination match condition. The destination match condition is associated with two or more destination regions.

Abstract: According to one aspect, a method includes monitoring traffic between a first network element and a second network element, and determining when no packets have been sent from the first network element towards the second network element within a predetermined amount of time. When it is determined that no packets have been sent from the first network element towards the second network element within the predetermined amount of time, the method includes sending at least one smart probe packet from the first network element to the second network element.

Abstract: In one embodiment, methods are described to measure bandwidth limits through multiple test sites. A testing quantity of network packets is generated, the network packets are sent through a service provider network to a plurality of receivers at a testing transmission rate that exceeds an upstream transmission rate limit of the service provider network, a report indicating a received number of packets is received from each of the plurality of receivers, and an upstream transmission rate limit of the service provider network is determined based on the testing transmission and the reports. By using multiple test sites, potential bottlenecks at any one test site are reduced. A similar method can be used to calculate a downstream transmission rate limit. Once measured, the bandwidth limits may be used to adjust quality of service on an edge router or compared against a known service level agreement of the service provider network.

Abstract: According to one aspect, a method includes monitoring traffic between a first network element and a second network element, and determining when no packets have been sent from the first network element towards the second network element within a predetermined amount of time.

Abstract: In an embodiment, a method comprises receiving a request to obtain network performance data for a plurality of target nodes; determining geo-locations of the plurality of target nodes; based on the geo-locations, determining a set of the plurality of target nodes that are within a specified proximity radius; selecting one particular target node in the set; sending a probe packet, requesting network performance data, to the one particular target node in the set and not to all other target nodes in the set; applying, to all the target nodes in the set, network performance data that is received in response to the probe packet; wherein the method is performed by one or more processors.

Abstract: In one embodiment, methods are described to measure bandwidth limits through multiple test sites. A testing quantity of network packets is generated, the network packets are sent through a service provider network to a plurality of receivers at a testing transmission rate that exceeds an upstream transmission rate limit of the service provider network, a report indicating a received number of packets is received from each of the plurality of receivers, and an upstream transmission rate limit of the service provider network is determined based on the testing transmission and the reports. By using multiple test sites, potential bottlenecks at any one test site are reduced. A similar method can be used to calculate a downstream transmission rate limit. Once measured, the bandwidth limits may be used to adjust quality of service on an edge router or compared against a known service level agreement of the service provider network.

Abstract: In an embodiment, a method comprises receiving a request to obtain network performance data for a plurality of target nodes; determining geo-locations of the plurality of target nodes; based on the geo-locations, determining a set of the plurality of target nodes that are within a specified proximity radius; selecting one particular target node in the set; sending a probe packet, requesting network performance data, to the one particular target node in the set and not to all other target nodes in the set; applying, to all the target nodes in the set, network performance data that is received in response to the probe packet; wherein the method is performed by one or more processors.

Abstract: A method and apparatus for multiple string searching using a ternary content addressable memory. For one embodiment, the method includes selecting character groups from an input text string in a temporal sequence, each character group having more than one character. A first character group of the character groups is compared with a plurality of character fields and a current state of a state machine is compared with a plurality of states of the state machine that correspond to the plurality of character fields to identify information indicative of a subsequent state of the state machine. Comparison of the first character group with the plurality of sets of character fields is repeated if the information indicative of the subsequent state of the state machine indicates that a terminal number of characters of a desired character pattern has been located and that the terminal number of characters is fewer than the number of characters in the first character group.

Abstract: A content search system for determining whether a plurality of input strings each belonging to any one of a number of different process flows matches one or more of a plurality of regular expressions, including a search circuit for searching the input strings for the regular expressions and a data management unit including a control circuit having an input to receive the plurality of input strings, wherein each input string has an associated flow identification (ID) value, a packet queue having a number of storage locations for storing the input strings, and a flow engine that forwards a selected input string from the packet queue to the search circuit.

Abstract: A network system includes a content search system for determining whether an input string matches a regular expression comprising an exact pattern and an inexact pattern, the content search system including a first search circuit dedicated to perform an exact string match operation to determine whether the input string contains a first portion that matches the exact pattern, and a second search circuit dedicated to perform an inexact string match operation to determine whether the input string contains a second portion that matches the inexact pattern.

Abstract: A content search circuit for determining whether an input string matches one or more of a plurality of regular expressions, the content search circuit including an instruction memory for storing a plurality of microprograms, each microprogram embodying a corresponding one of the regular expressions, a control circuit having an input to receive the input string, and having a number of outputs, and a plurality of search engines, each having a first input coupled to a corresponding output of the control circuit and having a second input coupled to the instruction memory, wherein each search engine is selectable to execute any of the microprograms stored in the instruction memory to search the input string for any of the regular expressions embodied in the microprograms.

Abstract: A method of controlling a content addressable memory (CAM) device. A data structure is generated that specifies (i) a prioritized set of rules and (ii) storage locations within the CAM device for one or more match clauses of each of the rules. A new rule having a specified priority is recorded in the data structure. Candidate storage locations within the CAM device are identified within the CAM device for the match clauses of each of the rules having a lower priority than the new rule. The candidate storage locations are compared with the storage locations specified by the data structure. Each match clause for which the candidate storage location does not match the specified storage location is stored in the CAM device.

Abstract: A content search system for determining whether a plurality of input strings each belonging to any one of a number of different process flows matches one or more of a plurality of regular expressions, including a search circuit for searching the input strings for the regular expressions and a data management unit including a control circuit having an input to receive the plurality of input strings, wherein each input string has an associated flow identification (ID) value, a packet queue having a number of storage locations for storing the input strings, and a flow engine that forwards a selected input string from the packet queue to the search circuit.

Abstract: A network system includes a content search system for determining whether an input string matches a regular expression comprising an exact pattern and an inexact pattern, the content search system including a first search circuit dedicated to perform an exact string match operation to determine whether the input string contains a first portion that matches the exact pattern, and a second search circuit dedicated to perform an inexact string match operation to determine whether the input string contains a second portion that matches the inexact pattern.

Abstract: A content search circuit for determining whether an input string matches one or more of a plurality of regular expressions, the content search circuit including an instruction memory for storing a plurality of microprograms, each microprogram embodying a corresponding one of the regular expressions, a control circuit having an input to receive the input string, and having a number of outputs, and a plurality of search engines, each having a first input coupled to a corresponding output of the control circuit and having a second input coupled to the instruction memory, wherein each search engine is selectable to execute any of the microprograms stored in the instruction memory to search the input string for any of the regular expressions embodied in the microprograms.