Method and apparatus for eliminating unprotectable paths from consideration during computation of a protectable shortest path tree

摘要: The invention comprises a method for computing the shortest protectable paths in communication networks, and establishing defining protected paths. utilizes new algorithm to exclude from consideration as “shortest path” between two network elements, path which adequate protection cannot be established. Such an unprotectable will contain one or more links. These links can identified excluded based upon whether not link is member of loop. Because there are several computational steps paths, after has been found, initial exclusion segments eliminates potential waste resources leading rapid efficient routing provisioning reliable circuits.