Topology aggregation with multiple QoS parametersfor scalable routing problem

摘要

In this paper, we investigate the problem of topology aggregation in QoS-based routing. We propose a new algorithm to perform full-mesh and modified-star aggregation, which is simple and effective in a network with additive and concave parameters constrained. The time complexity is O(b^2), where b is the number of border nodes. We extend the algorithm to topology aggregation with multi-parameters constrained. The simulation results show that our algorithm has very good performance in terms of success ratio.