Managing congestion and potential traffic growth in an information network
First Claim
1. A method of managing traffic flow across links of an information network, comprising:
- monitoring traffic demands from a source node of an information network to a destination node of the network, including bandwidths associated with each of the traffic demands;
determining for each traffic demand and for a given link of the network, that portion of the bandwidth associated with each traffic demand which portion is provided by the given link;
determining a maximum value of link utilization among all links of the network, where link utilization is defined as the amount of bandwidth used by all traffic demands routed trough a given link with respect to a total capacity of the link;
calculating a cost metric for each link of the network based on information comprising the traffic demand and maximum value of link utilization;
selecting a path that minimizes the maximum value of link utilization based on each cost metric; and
routing the traffic demands across the path.
5 Assignments
0 Petitions
Accused Products
Abstract
Traffic demands are routed across links of an information network so as to avoid congestion and allow for future traffic growth. Traffic demands from a source node to a destination node of the network are monitored, including bandwidths associated with each of the demands. For each demand, and for a given link of the network, that portion of the bandwidth associated with each traffic demand which is provided by the given link, is determined. A maximum value of link utilization among all links of the network is then determined, wherein link utilization is defined as the amount of bandwidth used by all traffic demands routed through a given link with respect to a total capacity of the link. Traffic demands are then routed across the links of the network in such a manner as to minimize the maximum value of link utilization.
112 Citations
26 Claims
-
1. A method of managing traffic flow across links of an information network, comprising:
-
monitoring traffic demands from a source node of an information network to a destination node of the network, including bandwidths associated with each of the traffic demands;
determining for each traffic demand and for a given link of the network, that portion of the bandwidth associated with each traffic demand which portion is provided by the given link;
determining a maximum value of link utilization among all links of the network, where link utilization is defined as the amount of bandwidth used by all traffic demands routed trough a given link with respect to a total capacity of the link;
calculating a cost metric for each link of the network based on information comprising the traffic demand and maximum value of link utilization;
selecting a path that minimizes the maximum value of link utilization based on each cost metric; and
routing the traffic demands across the path. - View Dependent Claims (2, 3)
-
-
4. A method of managing traffic flow across links of an information network comprising:
-
receiving a demand to route network traffic;
determining a demand size of the demand;
determining a routing procedure associated with the demand;
calculating a cost metric for each of a plurality of links of a network;
the cost metric for each link being associated with information comprising the routing procedure and a link utilization, the link utilization being a ratio of link capacities; and
selecting a path to route network traffic based on the calculated cost metric for each of the plurality of links. - View Dependent Claims (5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computer readable medium including computing instructions for managing traffic flow across links of an information network, the instructions comprising:
-
monitoring traffic demands from a source node of an information network to a destination node of the network, including bandwidths associated with each of the traffic demands;
determining for each traffic demand and for a given link of the network, that portion of the bandwidth associated with each traffic demand which portion is provided by the given link;
determining a maximum value of link utilization among all links of the network, where link utilization is defined as the amount of bandwidth used by all traffic demands routed trough a given link with respect to a total capacity of the link;
calculating a cost metric for each link of the network based on information comprising the traffic demand and maximum value of link utilization;
selecting a path that minimizes the maximum value of link utilization based on each cost metric; and
routing the traffic demands across the path. - View Dependent Claims (15, 16)
-
-
17. A computer readable medium including computing instructions for managing traffic flow across links of an information network, the instructions comprising:
-
receiving a demand to route network traffic;
determining a demand size of the demand;
determining a routing procedure associated with the demand;
calculating a cost metric for each of a plurality of links of a network;
the cost metric for each link being associated with information comprising the routing procedure and a link utilization, the link utilization being a ratio of link capacities; and
selecting a path to route network traffic based on the calculated cost metric for each of the plurality of links. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25, 26)
-
Specification