带度约束的组播路由算法

在多媒体通信网的实际应用中 ,组播 (multicasting)技术日益重要 ,但由于节点处理信息的能力不同 ,有些节点并不具备组播能力 ,同时为保证网络负载平衡 ,有些节点的组播能力应有所限制 ,用节点的度约束来表示每个节点应具备的组播能力 ,研究在网络节点具有不同度约束情况下的组播路由问题 ,提出了一种解决这个问题的简单有效的启发式算法 ,该算法对实验的大多数网络能够找到解

Degree-Constrained Multicasting Algorithm

In communication networks, the multicasting is of great importance. Because of the different ability of the network nodes some nodes do not support multicasting. And in order to balance the node load , the nodes need not send message to all of its adjacent nodes. By using the degree of the node to represent the multicasting ability, the degree constrained multicasting is dealt with and a efficient and simple heuristic algorithm is presented, and our experimental results show that the proposed algorithm can find the solution in most experimental cases.