Abstract: Embodiments of methods and systems for managing traffic across a WAN are disclosed. A method for managing traffic across a WAN involves identifying incoming traffic as Direct Internet Access (DIA) traffic at a first node, identifying incoming traffic as SD-WAN traffic at the first node, policing the DIA traffic at the first node, and adapting the policing of the DIA traffic at the first node in response to a comparison between the SD-WAN traffic and an SD-WAN traffic threshold.

Abstract: Embodiments of methods and systems for managing traffic across a WAN are disclosed. A method involves advertising an input rate limit across a WAN from a first node, advertising an input distribution array across the WAN from the first node, wherein the input distribution array includes forwarding class-specific weights, and adapting at least one of the input rate limit and the input distribution array in response to an error between a target forwarding class distribution and an observed input traffic distribution.

Abstract: Embodiments of methods and systems for managing traffic across a WAN are disclosed. A method for managing traffic across a WAN involves identifying incoming traffic as Direct Internet Access (DIA) traffic at a first node, identifying incoming traffic as SD-WAN traffic at the first node, policing the DIA traffic at the first node, and adapting the policing of the DIA traffic at the first node in response to a comparison between the SD-WAN traffic and an SD-WAN traffic threshold.

Abstract: Embodiments of methods and systems for managing traffic across a WAN are disclosed. A method involves advertising an input rate limit across a WAN from a first node, advertising an input distribution array across the WAN from the first node, wherein the input distribution array includes forwarding class-specific weights, and adapting at least one of the input rate limit and the input distribution array in response to an error between a target forwarding class distribution and an observed input traffic distribution.

Abstract: Embodiments herein disclose methods for selecting one or more paths for routing application traffic based on application performance metrics for hosted applications. In an embodiment, to select the best path, the available paths can be monitored to understand the performance of specific applications through those paths. Subsequently, the performance data is used to derive an application link score (ALS) for any given combination of application and path. The ALS is then be used to determine the best path for a given application.

Abstract: Embodiments herein disclose methods for selecting one or more paths for routing application traffic based on application performance metrics for hosted applications. In an embodiment, to select the best path, the available paths can be monitored to understand the performance of specific applications through those paths. Subsequently, the performance data is used to derive an application link score for any given combination of application and path, wherein the application link score is generated as a function of packet delay and packet loss. The ALS is then be used to determine the best path for a given application.

Abstract: Embodiments herein disclose methods for selecting one or more paths for routing application traffic based on application performance metrics for hosted applications. In an embodiment, to select the best path, the available paths can be monitored to understand the performance of specific applications through those paths. Subsequently, the performance data is used to derive an application link score for any given combination of application and path, wherein the application link score is generated as a function of packet delay and packet loss. The ALS is then be used to determine the best path for a given application.

Abstract: Embodiments herein disclose methods for selecting one or more paths for routing application traffic based on application performance metrics for hosted applications. In an embodiment, to select the best path, the available paths can be monitored to understand the performance of specific applications through those paths. Subsequently, the performance data is used to derive an application link score (ALS) for any given combination of application and path. The ALS is then be used to determine the best path for a given application.

Abstract: A first and second thread-local counter is allocated to a first and second thread respectively, where the first thread-local counter is updatable only by or on behalf of the first thread and the second thread-local counter is updatable only by or on behalf of the second thread. The first and second thread-local counter are updated and the updated values are communicated to a central process. The central process updates a single counter in a central database by a value equal to the sum of the updated counter values.