摘要： 随着网络应用的日趋复杂，多度量的网络描述也在增多。针对网络的二度量单播最短路径问题，结合适当的路径长度判定函数，该文提出了一种能保持路径计算过程中的真实状态的新算法，不必预先进行处理，计算过程中通过判定函数来减少搜索空间，从而减少计算量，具有良好的可扩展性，可扩展到多度量模式。

关键词: 最短路径, 二度量单播最短路径问题, 路径长度

Abstract: With the increased complexity of network applications, the demand for multi-metric network description is increased too. Combined with a suitable path-length decision function, a new algorithm is proposed for the two-metric unicast shortest path (TWUSP) problem. The functions of this algorithm include: keeping the real state during computing, without any pretreatment; reducing the search space by decision function, and reducing computation load; having good scalability to multi-metric.

Key words: Shortest path, Two-metric unicast shortest path (TWUSP) problem, Path-length