通过LSDB，每个节点可以用Dijkstra 算法，求出最小树(Shortest Path Tree)通过最小树它 可以建立或修改路由表(routing table)，路由表包含目的地(destination)，下一跳(next hop)， 花费(metric)，发送连...
基于24个网页-相关网页
SPT Shortest Path Tree 最短路径树
dual shortest path tree 对偶最短路径树
local shortest path tree 局部最短路径树
shortest path tree routing 最短路径树路由
multicast shortest path tree 组播转发最短路径树
shortest-path tree coverage 最短路径树覆盖
Shortest Path First Tree 最短路径优先树
redundant shortest path multicast tree 冗余最短路径组播树
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.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
应用推荐