The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jul. 01, 2008
Filed:
Jan. 28, 2003
Antonio Nucci, Burlingame, CA (US);
Bianca Schroeder, Pittsburgh, PA (US);
Supratik Bhattacharyya, San Francisco, CA (US);
Nina Taft, San Francisco, CA (US);
Christophe Diot, Millbrae, CA (US);
Antonio Nucci, Burlingame, CA (US);
Bianca Schroeder, Pittsburgh, PA (US);
Supratik Bhattacharyya, San Francisco, CA (US);
Nina Taft, San Francisco, CA (US);
Christophe Diot, Millbrae, CA (US);
Sprint Spectrum L.P., Overland Park, KS (US);
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. When that occurs, the number of links used to generate the set of potential solutions is randomly changed and the above-described steps are repeated. The method is complete after a second predetermined number of iterations have been evaluated no matter how many changes to the optimal solution.