Topology aggregation method for multiple link parameters

In a hierarchical network, each subnetwork advertises its topology information to the other subnetworks. Many studies have been done to minimize the amount of advertised topology information. The existing works assume a logical link can be represented with only a few parameters. However, for the QoS and policy-based networks, more parameters are used to represent the state of a link (e.g., cost, policies). For these networks, with the existing methods, the amount of advertised information linearly increases to the order of the number of link-state parameters. To solve this problem, this work proposes a new topology aggregation method.