Abstract: The present invention includes a method and system for determining link weights that when utilized will optimize the performance of a network in the event of a link failure without the need to alter the link weights. The method includes determining two sets of links, one that includes links with a significant amount of loading and one that includes links with a modest amount of loading. A set of permissible solutions is generated utilizing one randomly chosen link from each set. After omitting recent best permissible solutions, the remaining permissible solutions are evaluated by analyzing for the complete network topology and for the topologies corresponding to all single-link failure states and the best permissible solution is found. If the best permissible solution is better than the current optimal solution, then the best permissible solution is made the optimal solution. These steps are repeated until a predetermined number of iterations have been evaluated without a change in the optimal solution.

Abstract: A system and method for identifying optimal mapping of logical links to the physical topology of a network is provided. Upon obtaining one or more mapping options for mapping multiple logical links between one or more pairs of network nodes onto physical paths that are at least relatively disjoint and obtaining a maximum time delay allowed between the each pair of network nodes, the mapping options are correlated with the maximum time delay to identify optimal mapping of logical links to the physical topology of a network.

Abstract: The present invention provides methods for deflecting the routing data packets in an IP network to avoid overloaded links and to alleviate link congestion. One method in accordance with the present invention is, when the next link on the shortest route path is congested, to deflect a data packet to an adjacent node with a decreasing cost to the destination that is not the next hop on the shortest route path to the destination. A further method in accordance with the present invention deflects a data packet to an intra-PoP node with a small increase in cost to the destination to avoid a congested link. These and other methods in accordance with the present invention may be used alone or in combination as a method for deflection routing data packets to alleviate and avoid link congestion in an IP network.

Abstract: The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.

Abstract: The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.

Abstract: The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.

Abstract: The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.

Abstract: The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.