受时延约束的组播路由算法

Delay-constrained multicast routing algorithm

提出了一种新的受时延约束的组播路由算法。算法借鉴了MPH算法的思想,最初的组播树只包含源结点,然后每次将到达组播树的代价最小且满足时延约束的结点及其相应的路径加入到组播树,直到所有的成员加入为止。该算法能够快速地得到一棵满足时延约束的组播树,并且组播树的代价也很小。实验表明:该算法简单,复杂度低,性能良好,易于在分布式环境中实现,可应用于实际的应用系统中。

A new multicast routing algorithm with delay-constrained was proposed. Based on MPH algorithm, this algorithm establishes multicast tree merely with a source node at first and then joined a member to multicast tree every time, till the tree hold all members. When a member wants to join multicast tree, it should satisfy the delay-constrained from source to itself and the cost of path from tree to itself is less than the cost of path from tree to other members that are not on the tree. This heuristics could find the least cost multicast tree with delay-constrained if such a tree exists. Experiment results showed that this algorithm was simplicity and low complexity, and had some good performance, so it could be implemented in the distributed environment, and could be applied to the real system.