Optimization method of spanning tree aggregation for hierarchical QoS routing

In hierarchical networks, the topology and QoS parameters of a domain have to be first aggregated before being propagated to other domains. However, topology aggregation may distort useful information. This paper focuses on minimizing the distortion caused by reducing a full-mesh representation to a spanning tree. An optimization method of minimizing the distortion of additive parameters caused by spanning tree aggregation is presented. Based on this new method, two approximation algorithms are proposed. Simulation results show that both algorithms perform much better than the traditional way of decoding the spanning tree with upper or lower bounds