资料下载
×
目的驱动最短路径树的快速算法
消耗积分:3 |
格式:rar |
大小:193 |
2009-06-10
李军
分享资料个
通过分析目的驱动最短路径生成树算法DDSP(Destination-driven Shortest Path) 的节点搜索过程，提出一种以较小的存储空间为代价，减少DDSP 算法在搜索当前节点、父节点和待处理节点时搜索空间的快速算法FDDSP( Fast destination-driven shortest path)。随机网络模型的仿真结果表明，FDDSP 算法生成的多播树与DDSP 算法相同，但FDDSP 算法的效率更高。
关键词：多播树 最短路径树 最小生成树 DDSP
AAbstract: Based on the low-cost shortest path tree(LSPT) algorithm DDSP(Destination-driven Short -est Path and through reducing it’s search space while searching current node,father node and rema -inder nodes ,we gain a FDDSP (Fast Destination-driven Shortest Path) algorithm that has high computing efciency paying out a few srorage space.The simulation result shows that the broadcast tree coming from FDDSP as same as the tree coming from DDSP,othermore,FDDSP is more effect -ive.
Key words: broadcast tree; shortest path tree; minimum spanning tree; DDSP(Destination-driven sho -rtest parh)
关键词：多播树 最短路径树 最小生成树 DDSP
AAbstract: Based on the low-cost shortest path tree(LSPT) algorithm DDSP(Destination-driven Short -est Path and through reducing it’s search space while searching current node,father node and rema -inder nodes ,we gain a FDDSP (Fast Destination-driven Shortest Path) algorithm that has high computing efciency paying out a few srorage space.The simulation result shows that the broadcast tree coming from FDDSP as same as the tree coming from DDSP,othermore,FDDSP is more effect -ive.
Key words: broadcast tree; shortest path tree; minimum spanning tree; DDSP(Destination-driven sho -rtest parh)
声明：本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人，不代表电子发烧友网立场。文章及其配图仅供工程师学习之用，如有内容侵权或者其他违规问题，请联系本站处理。 举报投诉
评论(0)
发评论
- 相关下载
- 相关文章
