期刊文献+

可扩展的多目标最优化多播路由(英文)

Multi-Objective Optimization Multicast Routing for Forwarding State Scalability
下载PDF
导出
摘要 提出了一种提高多播可扩展性的新思路——将多播可扩展性作为一个最优化目标引入到多播路由算法的设计中,采用多目标最优化路由算法,提高现有多播可扩展性方法的效率.采用多目标最优化路由设计方法对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.
出处 《软件学报》 EI CSCD 北大核心 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(香港理工大学基金)
关键词 多目标最优化 多播路由 可扩展性 multi-objective optimization multieast routing sealability
  • 相关文献

参考文献10

  • 1Tian JN, Neufeld G. Forwarding state reduction for sparse mode multicast communication. In: Proc. of the IEEE INFOCOM. 1998.
  • 2Stoica I, Eugene Ng T, Zhang H. Reunite: A recursive unicast approach to multicast. In: Proc. of the IEEE INFOCOM. 2000.
  • 3Thaler D, Handley M. On the aggregatability of multicast forwarding state. In: Proc. of the IEEE INFOCOM. 2000.
  • 4Boudani A, Cousin B. A new approach to construct multicast trees in MPLS networks. In: Proc. of the IEEE ISCC. 2002.
  • 5Radoslavov PI, Govindan R, Estrin D. Exploiting the bandwidth-memory tradeoff in multicast state aggregation. Technical Report, USC, 1999.99-697.
  • 6Cui JH, Maggiorini D, Kim JY, Boussetta K, Gerla M. A protocol to improve the state scalability of source specific multicast. In: Proc. of the IEEE Globecom. 2002.
  • 7Eppstein D. Finding the k shortest paths. SIAM Journal on Computing, 1999,28(2):652-673.
  • 8Garey T, Johnson D. Computers and Intractability-A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
  • 9Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. on Computation, 2002,6(2): 182-197.
  • 10Waxman BM. Routing of multipoint connections. IEEE Journal Selected Areas in Communications, 1988,6(9): 1617-1622.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部