Patent ID: 6122283
Filing Date: 2000-09-19
Classification: H04L

Abstract:
A method for providing a substantially lossless compressed aggregation of a non-compressed topology representing a predetermined plurality of switching nodes interconnected by communication links in a data communication network, wherein the non-compressed topology has a plurality of paths each of which is formed by a tandem of communication links and wherein each communication link has a predetermined topology characteristic, said method comprising the steps of:A) identifying border vertices among the predetermined plurality of switching nodes as those having communications links to switching nodes outside the predetermined plurality of switching nodes, and designating those remaining switching nodes among the predetermined plurality of switching nodes as interior vertices;B) reducing the plurality of paths in the non-compressed topology by identifying an optimal path between each unique pair of said border vertices based upon the predetermined topology characteristic to create a plurality of optimal paths; andC) aggregating the plurality of optimal paths to provide for storage of, in at least one of the predetermined plurality of switching nodes, the substantially lossless compressed aggregation of the non-compressed topology spanning the border vertices of the non-compressed topology.