一种多点动态路由优化算法  

Algorithm for Dynamic Multicast Routing

作　　者：董庆阳[1] 李毓麟[1] 

机构地区：[1]上海交通大学区域光纤通信网与新型光通信系统国家重点实验室,上海200030

出　　处：《上海交通大学学报》2001年第6期882-885,共4页Journal of Shanghai Jiaotong University

基　　金：上海市科委基金资助项目!(97QD10 )

摘　　要：将具有平稳优化性能的目的地最优算法和具有良好平均优化性能的“贪心”算法相综合 ,提出了一种多点动态路由优化算法 .与已有的“贪心”算法、加权“贪心”算法等相比 ,该算法具有优化性能平稳、平均优化性能好等优点 .Optimization of dynamic routing is a proprietary and general problem in the multipoint communication. This paper proposed an algorithm for optimization of dynamic routing, which synthesizes the shortest path heuristic (naive multicast routing) that has small spikes of inefficiency and greedy algorithm that has low mean inefficiency. Compared with some existing algorithms, this algorithm has stable and good mean performance.

关 键 词：多点动态路由 加权“贪心”算法 衰减“贪心”算法 多点通讯 动态通信组 优化性能 

分 类 号：TN914.5[电子电信—通信与信息系统]