A Multi-QoS Constraints Based Routing Algorithm for Anycast Messages

摘要：

Use of anycast service can considerably simplify many communication applications. Three approaches can be used for routing anycast packets. However, these routing algorithms for anycast messages are single QoS constraint.In this paper we develop a route computation algorithm for anycast packets with multiple QoS metrics. This algorithm can be used for QoS-based route computation for Internet protocols. A communication network containing links with QoS metrics is modeled as a graph with multiple weights associated with its edges. This method takes a metric as the optimization target and another metric as a constraint. The method is guaranteed to find a nearly optimal path satisfying the given constraint if such a path exits. The algorithm is very efficient and its computational complexity is O(n2).

关键词： IP Qos Routing Route Computation Multiple Constraints

作者: Yaping Deng Huilian Wu

作者单位: Chongqing University of Posts and Telecommunications, Chongqing,400065,China

会议类型: 国际会议

会议名称: Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

会议地点: 成都

会议语种:英文

页码: 52-54

在线出版日期: 2003-08-27（万方平台首次上网日期，不代表论文的发表时间）