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

Internet中的多播路由选择算法
引用本文:崔烽,吴新余,刘陈,叶章钊. Internet中的多播路由选择算法[J]. 南京邮电大学学报(自然科学版), 1999, 0(2)
作者姓名:崔烽  吴新余  刘陈  叶章钊
作者单位:南京邮电学院电子工程系!江苏南京210003(崔烽,吴新余),南京邮电学院教务处!江苏南京210003(刘陈),南京邮电学院院长办公室!江苏南京210003(叶章钊)
摘    要:Internet 中多播路由选择问题可归化为最小 Steiner 树问题,而该问题是一个 N P 难题,当前只存在若干种启发式算法。基于遗传算法和最小树算法,提出并实现了一种新的自适应路由选择算法,经编程运行发现,此算法具有良好的实际应用前景。

关 键 词:遗传算法  因特网  多播  最小Steiner树

Optimal Multicast Routing Algorithm in the Internet
CUI Feng ,WU Xin yu ,LIU Chen ,YE Zhang zhao. Optimal Multicast Routing Algorithm in the Internet[J]. JJournal of Nanjing University of Posts and Telecommunications, 1999, 0(2)
Authors:CUI Feng   WU Xin yu   LIU Chen   YE Zhang zhao
Affiliation:CUI Feng 1,WU Xin yu 1,LIU Chen 2,YE Zhang zhao 3 1.Department of Electronic Engineering,Nanjing University of Posts and Telecommunications,210003,Nanjing,PRC 2.Department of Educational Administration,Nanjing University of Posts and
Abstract:In the Internet, optimal multicast routing is a NP hard problem, there exists several heuristic algorithms at present. This paper proposes a new adaptive routing algorithm based on genetic algorithm and minimum tree algorithm. Computer simulations demonstrate this algorithm possesses a good property of practicality over Internet multicast routing.
Keywords:Genetic algorithm  Internet  Multicast  Minimum Steiner tree
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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