Minimum coding nodes multicast tree for two-channel all-optical network coding scheme

A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented.To minimize the coding nodes,the heuri...     

基于粒子群优化的ad hoc网络最小能耗多播路由算法

在无线ad hoc网络中,设备使用电池提供能量,随着多播应用日益广泛,如何构造最小能耗多播树是一个重要问题。针对选择不同的中继节点集对构造最小能耗多播树的影响,提出了一种优化最小能耗多播树构造的离散粒子群算法。为了避免离散粒子群算法早熟收敛,引入惯性权重策略,以平衡算法的全局搜索能力和局部搜索能力。模拟实验结果表明改进后的离散粒子群算法具有较强的优化能力,有效地优化了最小能耗多播树的构造。     

Distributed multicast routing for delay-sensitive applications

A distributed multicast algorithm for constructing minimum cost multicast trees with delay constraints is proposed. The proposed algorithm can always construct a delay-constrained multicast tree, if one exists, and exhibits superior tree cost performance compared to existing algorithms     

一种新的QoS组播路由算法

针对现有的求解多约束QoS组播路由中存在的问题,结合BP神经网络局部搜索的优势和蚁群算法全局搜索的优势的特点,进行QoS组播路由算法的设计,提出了一种新型的NNAC算法。该算法通过BP神经网络寻找路径的更优解,改善了QoS组播路由路径寻找的方法。通过实验仿真表明,NNAC算法得到最优组播树的总延时为35,总代价费用为21,在完成150个度约束组播路由路径时,NNAC算法在进行最优组播树的寻找成功率上高于AC算法,同时该算法还克服了AC算法易陷入局部最小点的不足。     

Minimizing the Number of Multicast Transmissions in Single-Hop WDM Networks

The problem of minimizing the number of transmissions for a multicast transmission under the condition that the packet delay is minimum in single-hop wavelength division multiplexing (WDM) networks is studied in this paper. This problem is proved to be NP-complete. A heuristic multicast scheduling algorithm is proposed for this problem. Extensive simulations are performed to compare the performance of the proposed heuristic algorithm with two other multicast scheduling algorithms, namely, the greedy and no-partition scheduling algorithms. The greedy algorithm schedules as many destination nodes as possible in the earliest data slot. The no-partition algorithm schedules the destination nodes of a multicast packet to receive the packet in the same data slot without partitioning the multicast transmission into multiple unicast or multicast transmissions. Our simulation results show that (i) an algorithm which partitions a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than the no-partition algorithm when the number of data channels in the system is limited and (ii) the proposed heuristic algorithm always produces lower mean packet delay than the greedy and the no-partition algorithms because this algorithm not only partitions a multicast transmission into multiple unicast or multicast transmissions to keep the packet delay low but also reduces the number of transmissions to conserve resources.     

A new heuristic algorithm for finding minimum‐cost multicast trees with bounded path delay

This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum‐cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dynamic multicast tree status which is maintained by updating the existing multicast tree when nodes in the network request to join or leave. Copyright © 1999 John Wiley & Sons, Ltd.     

高稳定的可扩展覆盖网多播算法

提出了一种高稳定的可扩展覆盖网多播（SOM-HS, scalable overlay multicast with high stability）算法。SOM-HS算法定义了节点稳定度因子以及链路权重,能保证高稳定的节点位于多播树骨干网中。在分层分簇构造过程中,SOM-HS算法限制节点出度,保证节点负载均衡。实验结论表明,与现有其他算法相比,在不同组规模下,使用SOM-HS算法时的最大多播延时都最小。     

Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network

Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3m2n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.     

基于遗传算法的路由选择问题的研究

为了在一个通信网络中,找到多源点到多目的点的路由总代价最小的符合带宽-时延约束的路由集,根据服务质量组播路由的特点,结合遗传算法的寻优特性,采用一种求解带宽-时延约束的两层遗传算法的方法,进行了理论分析和实验验证,取得了多源点到多目的点组播路由集的代价数据。结果表明,所提出的算法可以有效找到多组播路由问题的优化解。     

组播路由调度的神经网络方法

本文探讨了在高速包交换计算机网络中，具有端到端时延及时延抖动限制的组播路由问题。首先给出了此类问题的网络模型及其数学描述，然后提出了基于Ｈｏｐｆｉｅｌｄ神经网络的组播路由优化算法。实验表明，本算法能根据组播应用对时延的要求，快速、有效地构造最优组播树，有较强的实时性。