节点文献
带度约束和时延约束的多点传送路由算法
Multicast Routing Algorithm with Degree and Delay Constraints
【摘要】 在多媒体通信网的实际应用中,多点传送(multicasting)技术日益重要,由于网络节点处理信息的能力不同,有些节点并不具备多点传送能力,而为保证网络速度和节点负载平衡,有些节点的多点传送能力应有所限制,本文用节点的度约束来表示节点不同的多点传送能力:同时网络中的很多业务要求信息从源节点传送到目的节点的时延不能超过时延限制:为此本文研究带度约束且时延受限的多点传送路由问题.提出了一种解决此问题的Lagrange松弛法。
【Abstract】 In communication networks, the multicasting is of great importance. But in networks some nodes do not have 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 can 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.
【Key words】 Multicast routing; Degree constraint; Delay constraint; Lagrange relaxation method;
- 【文献出处】 计算机工程 ,Computer Engineering , 编辑部邮箱 ,2000年S1期
- 【分类号】TP393.03
- 【被引频次】1
- 【下载频次】30