SYSTEMS AND METHODS FOR DYNAMIC CONGESTION MANAGEMENT IN COMMUNICATIONS NETWORKS
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.
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 has a congested child node; and
in response to determining that the congested at least one node has a congested child node, applying the dynamic traffic shaping rule to the child node.
2 . The method of claim 1 , further comprising backing out a last dynamic rule-set change or provisioning in response to determining that the at least one node is not congested.
3 . The method of claim 1 , further comprising automatically implementing each of the steps.
4 . The method of claim 1 , wherein the steps are periodically implemented.
5 . The method of claim 1 , wherein the steps are iteratively implemented.
6 . The method of claim 1 , further comprising logging the change or provisioning of the set of at least one traffic shaping rule.
7 . The method of claim 6 , further comprising using the logged change or provisioning of the set of at least one traffic shaping rule to tune congestion management in the communications network.
8 . The method of claim 7 , wherein using the logged change or provisioning comprises assessing at least one of persistent patterns and effectiveness of congestion management resulting from dynamic changes to traffic shaping rules, in order to inform any provisioning of static rules.
9 . The method of claim 1 , further comprising implementing a statically provisioned traffic shaping policy for the at least one node.
10 . The method of claim 1 , wherein determining whether the at least one node is congested comprises using one or both of a Quality of Experience (QoE) score and a throughput-capacity utilization threshold of the at least one node to determine congestion.
11 . The method of claim 1 , further comprising:
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.
12 . The method of claim 1 , wherein changing or provisioning a traffic shaping rule comprises using a usage fairness technique.
13 . The method of claim 1 , wherein the communications network is a mobile network, wherein the method further comprises:
determining whether a user served by the at least one node uses a disproportionate share of bandwidth compared to other users and has moved between congested cells; and
in response to determining that the user served by the at least one node uses a disproportionate share of bandwidth and has moved between congested cells, provisioning a set of at least one global traffic shaping rule for application to the user.
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, determine whether the at least one node has a congested child node; and
in response to determining that the congested at least one node has a congested child node, apply the dynamic traffic shaping rule to the child node.
15 . The system of claim 14 , wherein the at least a processor and memory are configured to back out a last dynamic rule-set change or provisioning in response to determining that the at least one node is not congested.
16 . The system of claim 14 , wherein the at least a processor and memory arc configured to automatically determine traffic statistics, determine whether the at least one node is congested, and dynamically change or provision the set of at least one traffic shaping rule.
17 . The system of claim 14 , wherein the at least a processor and memory are configured to periodically determine traffic statistics, determine whether the at least one node is congested, and dynamically change or provision the set of at least one traffic shaping rule.
18 . 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, determine whether the at least one node has a congested child node; and
computer readable program code configured to, in response to determining that the congested at least one node has a congested child node, apply the dynamic traffic shaping rule to the child node.
19 . The computer program product of claim 18 , further comprising:
computer readable program code configured to, in response to determining that the at least one node is congested, determine whether the at least one node 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, apply the traffic shaping rule to the congested at least one node.
20 . The computer program product of claim 18 , further comprising:
computer readable program code configured to determine whether a user served by the at least one node uses a disproportionate share of bandwidth compared to other users and has moved between congested cells; and
computer readable program code configured to, in response to determining that the user served by the at least one node uses a disproportionate share of bandwidth and has moved between congested cells, provision a set of at least one global traffic shaping rule for application to the user.