This paper studies the problem of multicast routing with end-to-end delay constraint in packet-switched computer networks.
该文探讨了包交换计算机网络中，具有端到端时延限制的多播路由问题。
This algorithm was based on MPH algorithm. It added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least.
该算法基于MPH算法的基本思想进行扩展，在满足时延限制条件和多播树代价增加最小的基础上，逐步将目的节点添加到多播树上。
The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
应用推荐