Patent ID: 7443800
Filing Date: 2008-10-28
Classification: H04L

Abstract:
1. A method of designing a network, comprising the steps of: a) setting a plurality of nodes interconnected by links in a tree topology, a link of said links being a direct connection between two nodes of said plurality of nodes and a path is course across any number of said links to connect any two nodes of said plurality of nodes; b) determining a plurality of link costs of said links; c) determining, from said plurality of link costs, at least one of a plurality of least cost unicast paths by using a shortest path algorithm; d) making a search through said unicast paths for detecting a loop; e) if at least one loop is detected by said search, blocking a link of the detected loop and reestablishing any unicast paths that passed through the blocked link via concatenated links which circumvent the blocked link; and f) establishing a spanning tree with all links which accommodate said least cost unicast paths.