A topology maintenance algorithm based on the shortest path tree is proposed.
提出了基于最短路径树的拓扑维护算法。
It is suitable to calculate the shortest path tree which has large destination nodes.
它因而适合计算目的结点数较多的最短路径树。
This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
In this dissertation, algorithms for generating multicast trees with a trade-off in delay and bandwidth consumption are investigated. The Ameliorated Shortest Path tree (ASPT) is proposed.
在本文中，探讨了平衡延迟和带宽消耗的算法，提出了改进的最短路径树算法(ASPT)。
In this dissertation, algorithms for generating multicast trees with a trade-off in delay and bandwidth consumption are investigated. The Ameliorated Shortest Path tree (ASPT) is proposed.
在本文中，探讨了平衡延迟和带宽消耗的算法，提出了改进的最短路径树算法(ASPT)。
应用推荐