MPLS域中LSP组播树构建方法的研究与仿真

提出了一种基于接收方数据流驱动的标签分配机制构建MPLS域中LSP组播树的方案,给出了MPLS网络中成员加入和退出组播组以及组播包的复制和转发算法。并且对网络仿真工具NS的MPLS模块进行扩展以支持所提出的组播算法。性能分析和仿真实验结果表明：与传统组播相比,MPLS的组播技术能利用MPLS的快速转发能力有效地减少组播包的传输时延。     

多域光网络基于多核点共享树的多点对多点组播

针对多域光网络环境下传统的多点对多点(MP2MP)组播路由和波长分配(RWA)算法未考虑最优化组播域序列选择的问题,以及所导致的网络资源占用量过高和难以满足实时业务服务质量(Qo S)要求的问题,提出了一种面向多域光网络、计算可并行化、基于时延和最小代价约束的多核点共享树RWA启发式算法(MSTDC)。该算法通过构造虚拓扑的方式将多域的问题转化到单域中求解,从而实现了多核点共享树最小化核心点的个数及其所在域的准确计算。在多域间并行地将源和目的节点按照特定的Qo S选择策略和算法加入到不同的共享树中。仿真验证了在网络节点数为50个且均匀地分布在9个域内的多域光网络环境下,MSTDC算法与传统组播树算法相比波长资源占用率降低可达51.1%,路由成功率提高可达24.8%,算法执行时间降低可达64.6%。     

基于多核点共享树的多源光组播路由方法

通过网络编码方法优化多核点选择和组播信息传输,本文提出一种基于多核点共享树和网络编码的光组播路由构造和波长分配方法、减少波长资源消耗和提高网络的负载平衡性能.首先,删除产生源点迂回回路的网络编码备选核点集合,采用启发式矩阵运算方法确定多源共享树的网络编码核点,实现多源共享树以最少的核点覆盖最多的源节点;然后,为减少波长信道消耗数目,在确定的核点到目的节点间加入网络编码方法传输信息;最后,讨论了多核点共享树的波长分配方法和目的节点成功解码的边分离路径方法.仿真结果表明:与单核共享树、基于网络编码的单核共享树相比,基于网络编码的多核点共享树组播路由方法需求最少的波长数目和获得最好的网络负载平衡性能.     

基于平滑高斯半马尔可夫模型的移动无线传感器网络生成树算法

针对以往移动无线传感器网络研究只是单纯地对移动群体进行分簇而没有充分利用组群移动的内部稳定性的问题,结合组移动模型中节点运动的规律和内聚性原理,采用平滑高斯半马尔可夫移动模型刻画组内单个节点移动特征,构建了一种适合移动网络的稳定生成树算法(GM-base stable spanning tree algorithm,简称GSST)。实验证明,该算法从单个节点运动变化入手,在预测未来节点运动情况,选择稳定的链路构建网络结构方面,提高了移动网络的稳定性;同时,利用树的分层特征,简化移动网络的组网过程,并实现网络重组局部化。该算法有效延长节点存活率,均衡数据传输量。     

一种通用的时隙环网时隙调度机制

提出一种新颖的时隙环网公平机制——环分布式时隙调度(DTSR), 该机制是分布式的, 适合所有目的节点剥离业务的时隙环网。DTSR通过在单向信道上循环传输的时隙控制头(TCH)内增加一个简单的域, 实现对环上“饿死”节点信息的动态收集, 协调各个节点占用资源的时间, 确保各节点之间的公平性; 在发现环上有“饿死”节点后, DTSR利用时隙环网空间重用的特性, 调度相关节点向不经过“饿死”节点的其他节点发送数据, 充分利用了环网资源; 此外DTSR机制具有良好的算法收敛性, 且接入时延较传统算法更小。最后,对DTSR的性能进行仿真, 并和几个典型的时隙环网的公平机制进行了比较。     

低数据量环境下物联网密钥管理算法与方案设计

为了提高低数据量环境下物联网密钥的安全性与可靠性,需要对低数据量环境下物联网密钥管理算法以及密钥管理方案进行设计研究。使用当前管理算法对低数据量环境下物联网密钥进行管理时,在物联网网络节点增加到一定数量的情况下,无法保证低数据环境下物联网的安全性与可靠性。为此,提出一种基于LHKE的低数据量环境物联网密钥管理算法与方案设计方法。该算法是由当前算法为基础结合Qoskm算法优点形成的一种新的低数据量环境下物联网密钥算法,此算法将设立两个相同的低数据量密钥树,通过计算组播成员在物联网上的信任度与安全度,将信任度与安全度较高的组播成员放在一棵低数据量密钥树上,其他的组播成员放在另一棵低数据量密钥树上,再通过LHKE算法的初始化、子密钥生成和网络密钥生成三个阶段,对低数据量环境下物联网密钥进行管理。实验仿真证明,所提算法提高了低数据量环境下物联网密钥的安全性与可靠性。     

一种无线视频传感器节点协作跟踪方法

由于网络通信带宽以及节点能量等因素限制,信息的有效获取与能耗的平衡优化是无线视频传感器网络近期研究的热点,面向目标跟踪的无线视频传感器网络实现节能的关键在于节点的高效协作;文章目的在于研究一种无线视频传感器节点协作跟踪方法,通过综合考虑目标跟踪效果和节点能耗等因素,采用自适应混合高斯算法进行背景建模,分布式均值漂移算法进行目标跟踪,并构建一种基于效能函数的最优节点选择方法;实验结果显示该方法能在真实场景下高效地进行目标跟踪。     

复杂网络牵制控制优化选点算法及节点组重要性排序

本文研究复杂网络动力学模型的无向网络牵制控制的优化选点及节点组重要性排序问题.根据牵制控制的同步准则,网络的牵制控制同步取决于网络的Laplacian删后矩阵的最小特征值.因此,通过合理选择受控节点集得到一个较大的Laplacian删后矩阵最小特征值,是牵制控制优化选点问题的核心所在.基于Laplacian删后矩阵最小特征值的图谱性质,本文提出了多个受控节点选取的递归迭代算法,该算法适用于任意类型的网络.通过BA无标度网络、NW小世界网络及一些实际网络中的仿真实验表明:该算法在控制节点数较少时,能有效找到最优受控节点集.最后讨论了在复杂网络牵制控制背景下节点组重要性排序问题,提出节点组的重要性排序与受控节点的数目有关.     

波长转换受限条件下的最优组播波长分配算法

扩展了静态组播路由和波长分配问题,引入了范围受限的波长转换器,改进了优化目标,新的优化目标为整个组播连接使用的波长转换器数目最少,同时保证源节点到每个组播成员的路径上使用的波长转换器数目均小于指定值.利用动态规划,在两种连接建立策略下对问题进行了求解,所得解可用于衡量启发式组播波长分配算法的优劣.     

智能光网络中一种新型的分布式恢复方法

提出了一种基于固定备用路由和目的端触发的智能光网络中的分布式恢复方法,所选择的任一对源端节点和目的的端节点之间的固定备用路由包括该节点对之间的k条最短路径路由和基于部分链路无关的路由.目的端节点一旦探测到业务通道的失效将立即启动恢复进程,根据网络当前的资源使用情况,在这些备用路由中按照一定的次序选择一条恢复路由并为此分配一条可用的波长(对于没有波长变换器的光网络),然后将恢复通道的建立请求消息发送给该恢复通道的相关节点,这些相关节点可以锁定相关的网络资源,以避免来自其他恢复通道的竞争.所提出的算法增加了固定备用路由的数量,从仿真结果可以看出,该方法明显改善了失效连接的阻塞性能.     

一种牧场配料系统的设计与实现

提出了一种应用于移动Ad Hoc网络的分布式资源接纳控制机制,在目的节点和中间节点部署不同的资源接纳控制模块,能以接近通话或者分组传输的时间间隔适应网络的动态变化,为业务提供较好的QoS保障,并且能够支持多播及接收者异质性。仿真结果表明,添加资源接纳控制机制后,时延、抖动及丢包率分别降低了25.75%,51.76%和24.15%。     

基于组播树的多粒度波带静态疏导算法

研究了波带交换中的静态业务疏导算法。波带交换可以有效地减少波长交换的端口数量,但是当波带粒度值取固定值时,波带的粒度难以取得合适值。波带的粒度大,有助于减少交换端口的数量,但是波带利用率低;波带粒度小,有助于提高波带利用率,但是交换端口的数量多。为此,提出了多粒度的波带取值方法。根据静态业务疏导与组播路由的相似性,提出了利用构造组播树解决静态疏导问题的方法。另外,为了减少波带与波长交换平面互联的端口数量,采用了同目的地的波带疏导策略,并针对这一疏导策略提出了一种新的波带疏导辅助图。仿真结果表明,相对于固定粒度的波带取值,可以有效地减少交换端口的数量,并提高波带利用率。     

Multicast protection algorithms based on aggregated logical topology in survivable multi-domain optical networks

Since the optical network carries a lot of traffic, the survivability is an important issue to ensure the service continuity. At the same time, with the network scale increasing, the optical network has been divided into multi-domains each of which is managed by a unique network provider. Therefore, the survivability in multi-domain optical networks has got more attention in recent years. However, current works mostly addressed the unicast survivability and few or no solved the multicast survivability in multi-domain optical networks. Therefore, in this paper we propose two heuristic algorithms called Multicast Multi-domain Dedicated Protection (MMDP) and Multicast Multi-domain Shared Protection (MMSP) to provide the survivability in multicast multi-domain optical networks. In MMDP and MMSP, to provide the intra-domain protection, we use the modified Minimal-cost Path Heuristic (MPH) algorithm to compute the intra-domain survivable multicast tree. To provide the inter-domain protection, based on multi-domain logical topology, we firstly use the MPH algorithm to compute the inter-domain logical multicast tree and then use the Dijkstra algorithm to compute the inter-domain logical backup sub-path for each inter-link on this logical multicast tree. Simulation results show that MMSP has better resource utilization efficiency and lower blocking probability.     

DRL-M4MR: An intelligent multicast routing approach based on DQN deep reinforcement learning in SDN

Traditional multicast routing methods have some problems in constructing a multicast tree. These problems include limited access to network state information, poor adaptability to dynamic and complex changes in the network, and inflexible data forwarding. To address these defects, the optimal multicast routing problem in software-defined networking (SDN) is tailored as a multiobjective optimization problem, and DRL-M4MR, an intelligent multicast routing algorithm based on the deep Q network (DQN) deep reinforcement learning (DRL) method is designed to construct a multicast tree in a software-defined network. First, combining the characteristics of SDN global network-aware information, the multicast tree state matrix, link bandwidth matrix, link delay matrix and link packet loss rate matrix are designed as the state space of the reinforcement learning agent to solve the problem in that the original method cannot make full use of network status information. Second, the action space of the agent is all the links in the network, and the action selection strategy is designed to add the links to the current multicast tree in four cases. Third, single-step and final reward function forms are designed to guide the agent to make decisions to construct the optimal multicast tree. The double network architectures, dueling network architectures and prioritized experience replay are adopted to improve the learning efficiency and convergence of the agent. Finally, after the DRL-M4MR agent is trained, the SDN controller installs the multicast flow entries by reversely traversing the multicast tree to the SDN switches to implement intelligent multicast routing. The experimental results show that, compared with existing algorithms, the multicast tree constructed by DRL-M4MR can obtain better bandwidth, delay, and packet loss rate performance after training, and it can make more intelligent multicast routing decisions in a dynamic network environment. Code and DRL model are available at https://github.com/GuetYe/DRL-M4MR.     

A method of segment protection based on p-cycle for dynamic multicast with limited-range wavelength converter in WDM network

In the optical multicast network, node and link failures have very important influence on the network survivability which may lead to multiple destinations cannot receive data. Based on the wavelength layered-graph method, a method of efficiency-score based on heuristic algorithm of pre-configured cycle (p-Cycle) based-segment protection (ESHS) for dynamic multicast with limited-range wavelength conversion was presented in this paper. By finding the multicast tree segment protection, the total available p-Cycles are constructed for the multicast. Then we calculate each p-Cycle efficiency-score, the highest efficient-score p-Cycle is selected as the multicast route protection p-Cycle. The simulation results show that the ESHS can get higher performance than the existing ESHT algorithm, in terms of multicast request blocking probability and wavelength utilization.     

A risk-sharing multicast recovery scheme based on redundant trees in optical networks

Resilient and efficient multipoint mechanisms are required in optical networks. In this study, we propose a risk-sharing primary tree selection algorithm to enhance the redundant tree recovery method in multipoint optical networks. The mechanism not only can ensure the minimum hop distance from the source to every destination, but also can make nodes in the network share the risk of failure and degradation by averaging the number of messages triggered. Simulations demonstrate that the proposed mechanism ensures a better network environment after failure or degradation of multipoint optical networks.