Algorithm for Two-metric Unicast Shortest Path
Pan Yun · Jisuanji gongcheng · 2007
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.