首页 | 本学科首页   官方微博 | 高级检索  
     

可扩展的多目标最优化多播路由
引用本文:胡光岷,CHANG Rocky.可扩展的多目标最优化多播路由[J].软件学报,2008,19(6):1546-1554.
作者姓名:胡光岷  CHANG Rocky
作者单位:1. 电子科技大学,通信与信息工程学院,四川,成都,610054
2. 香港理工大学,计算科学系,香港
基金项目: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方法,使用该算法可以有效地增加非分枝节点的数量,减少多播状态.

关 键 词:多目标最优化  多播路由  可扩展性
收稿时间:2004/10/3 0:00:00
修稿时间:2004年10月3日

Multi-Objective Optimization Multicast Routing for Forwarding State Scalability
HU Guang-Min and CHANG Rocky.Multi-Objective Optimization Multicast Routing for Forwarding State Scalability[J].Journal of Software,2008,19(6):1546-1554.
Authors:HU Guang-Min and CHANG Rocky
Abstract: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 multi- objective 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.
Keywords:multi-objective optimization  multicast routing  scalability
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号