Destination-Driven Routing for Low-Cost Multicast
Destination-Driven Routing for Low-Cost Multicast
复制标题
DOI：
10.1109/49.564135
复制
发表时间：
1997-04
期刊：
影响因子：
--
通讯作者：
A. Shaikh;K. Shin
中科院分区：
文献类型：
--
作者：
A. Shaikh;K. Shin
我们提出了一种目的地驱动的算法，可以针对需要低总成本的组播树的应用程序进行优化，例如群组视频或电话会议。目的地驱动算法使用基于最短路径树和最小生成树的贪婪策略，但会偏向通过目的地的路线。通过广泛的仿真分析了该算法的性能，并与几种斯坦纳树启发式算法和流行的最短路径树（SPT）方法进行了比较。研究发现，该算法生成的树的总体成本显着低于 SPT，同时保持合理的每个目的地性能。其性能也与其他已知的 Steiner 启发法相媲美。此外，该算法不会遇到大多数斯坦纳树启发式算法常见的高复杂性，并且通过仅查询事件链接来获取成本信息来构建路线。
We present a destination-driven algorithm that optimizes for applications, such as group video or teleconferencing, that require multicast trees with low total cost. The destination-driven algorithm uses a greedy strategy based on shortest-path trees and minimal spanning trees but biases routes through destinations. The performance of the algorithm is analyzed through extensive simulation and compared with several Steiner tree heuristics and the popular shortest-path tree (SPT) method. The algorithm is found to produce trees with significantly lower overall cost than the SPT while maintaining reasonable per-destination performance. Its performance also compares well with other known Steiner heuristics. Moreover, the algorithm does not suffer from high complexity common to most Steiner tree heuristics and builds a route by querying only incident links for cost information.