摘要

Analysing the topology of TMN and the target of QoS routing, this paper proposes a new model of QoS routing algorithm (QRA), which includes the precomputation and searching procedures. The precomputation is able to create and update the routing tables in each node. Then, the searching procedure could select an optimal path satisfying several constraints in the hierarchical architecture. The results of extensive simulation show that QRA achieves satisfactory performance and efficiently solves the problem of multi-constrained QoS routing in TMN.