Systems and methods for dynamic congestion management in communications networks
First Claim
Patent Images
1. A method for dynamic congestion management in a communications network, the method comprising:
- determining traffic statistics of at least one node in a communications network;
determining whether the at least one node is congested based on the traffic statistics;
in response to determining that the at least one node is congested, dynamically changing or provisioning a set of at least one traffic shaping rule for application to the at least one node;
in response to determining that the at least one node is congested, determining whether the at least one node does not have a congested child node; and
in response to determining that the congested at least one node does not have a congested child node, applying the traffic shaping rule to the congested at least one node.
10 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods for dynamic congestion management in communications networks are disclosed herein. According to an aspect, a method can include determining traffic statistics of at least one node in a communications network. The method can also include determining whether the at least one node is congested based on the traffic statistics. Further, the method can include dynamically changing or provisioning a set of at least one traffic shaping rule for application to the at least one node in response to determining that the at least one node is congested.
17 Citations
28 Claims
-
1. A method for dynamic congestion management in a communications network, the method comprising:
-
determining traffic statistics of at least one node in a communications network; determining whether the at least one node is congested based on the traffic statistics; in response to determining that the at least one node is congested, dynamically changing or provisioning a set of at least one traffic shaping rule for application to the at least one node; in response to determining that the at least one node is congested, determining whether the at least one node does not have a congested child node; and in response to determining that the congested at least one node does not have a congested child node, applying the traffic shaping rule to the congested at least one node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A system for dynamic congestion management in a communications network, the system comprising:
-
at least a processor and memory configured to; determine traffic statistics of at least one node in a communications network; determine whether the at least one node is congested based on the traffic statistics; dynamically change or provision a set of at least one traffic shaping rule for application to the at least one node in response to determining that the at least one node is congested; in response to determining that the at least one node is congested, determining whether the at least one node does not have a congested child node; and in response to determining that the congested at least one node does not have a congested child node, applying the traffic shaping rule to the congested at least one node. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
-
-
27. A computer program product for dynamic congestion management in a communications network, the computer program product comprising:
-
a non-transitory computer readable storage medium having computer readable program code for execution by a processor, the computer readable program code comprising; computer readable program code configured to determine traffic statistics of at least one node in a communications network; computer readable program code configured to determine whether the at least one node is congested based on the traffic statistics; and computer readable program code configured to dynamically change or provision a set of at least one traffic shaping rule for application to the at least one node in response to determining that the at least one node is congested; computer readable program code configured to, in response to determining that the at least one node is congested, determining whether the at least one node has does not have a congested child node; and computer readable program code configured to, in response to determining that the congested at least one node does not have a congested child node, applying the dynamic traffic shaping rule to the congested at least one node. - View Dependent Claims (28)
-
Specification