摘要
In this paper we introduce a routing algorithm for commuication networks with multiple QoS metrics. This algorithm can be used for QoS-based route computaion for ATM PNNI and Internet protocols such as QoS OSPF. Acommunication network containing links with multiple QoS metrics is modeled as a graph with multiple weights associated with its edges. This method takes a metric(e. g. cost)as the optmization target and another metric(e. g. delay)as a constraint. This algorithm is guaranteed to find a nearly optimal path satisfying the given comstraint if such a path exists. The algorithm is very efficient and its computational complexity is O(n2).
In this paper we introduce a routing algorithm for commuication networks with multiple QoS metrics- This algorithm can be used for QoS-based route computaion for ATM PNNI and Internet protocols such as QoS OSPF. Acommunication network containing links with multiple QoS metrics is modeled as a graph with multiple weights associated with its edges. This method takes a metricCe. g. cost)as the optmization target and another metric (e. g. delay)as a constraint- This algorithm is guaranteed to find a nearly optimal path satisfying the given comstraint if such a path exists. The algorithm is very efficient and its computational complexity is O(n2).
出处
《计算机科学》
CSCD
北大核心
2001年第9期55-57,共3页
Computer Science
