带约束的多插路由算法

由于网络节点处理信息的能力不同，有些节点并不具备多播能力，为保证网络速度和节点负载平衡，应限制有些节点的多播能力，为此用节点的度约束来表示节点不同的多播能力，研究了带度约束且时延受限的多播路由问题，提出解决此问题的Lagrange松驰法。

A constrained multicast routing algorithm

By multicasting is meant the sending of the same message from a source node to multiple detination nodes. The multicast routing algorithm aims to determine the minimal cost multicast route. Due to the fact that users require the improvement of the QoS of the services, multicasting must consider many constraints. Fisrt in networks some nodes do not have the multicasting ability, and some nodes should limit their multicast ability for load balance and network speed. We use the degree of the node in this paper to represent its multicasting ability. Furthermore many applications in networks require that the accumulated delay from the source node to every destination node not exceed a pre-specified delay bound. In this paper the multicast routing with degree and delay constraints is proposed, and a Lagrange relaxation method is used to solve this problem.