检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:胡光岷[1] CHANG Rocky
机构地区:[1]电子科技大学通信与信息工程学院,四川成都610054 [2]香港理工大学计算科学系,中国香港
出 处:《软件学报》2008年第6期1546-1554,共9页Journal of Software
基 金:Supported by the Grant of the Hong Kong Polytechnic University of China under Grant No.COMP-H-ZJ83(香港理工大学基金)
摘 要:提出了一种提高多播可扩展性的新思路——将多播可扩展性作为一个最优化目标引入到多播路由算法的设计中,采用多目标最优化路由算法,提高现有多播可扩展性方法的效率.采用多目标最优化路由设计方法对AM(aggregated multicasc)和DTM(dynamic tunnel multicast)两种方法进行改进,给出了相应的最优化目标、启发式多目标最优化多播路由算法和多目标最优化多播路由遗传算法.对于AM方法,使用该算法可以有效地减少汇聚多播树的数量;对于DTM方法,使用该算法可以有效地增加非分枝节点的数量,减少多播状态.The approach is to include forwarding state scalability as one of the optimal objective when constructing new multicast trees. This multi-objective optimization approach can be applied to many existing multicast state reduction methods. In this paper, the approach is illustrated by applying it to aggregated multicast (AM) and dynamic tunnel multicast (DTM). Both AM and DTM routing problems are formulated as multiobjective optimization problems, and both heuristic and genetic algorithms are proposed for solving them. Based on the experimental results, the approach can further improve the forwarding state scalability of both approaches by reducing the number of aggregated trees required by the AM method, and by increasing the number of non-branching nodes for the DTM method.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117