共查询到16条相似文献,搜索用时 140 毫秒
1.
基于SRLG约束和资源共享的交迭段保护机制研究 总被引:1,自引:0,他引:1
通过对共享风险链路组约束机制和交迭段保护机制的分析,将两者相结合并根据工作和保护路径分别采用动态链路权重调整,提出了一种基于共享风险链路组不相关的交迭段共享保护算法.交迭段共享保护算法在共享风险链路组不相关的约束条件下,为整个工作路由提供了多个交迭的保护段,并给出了一种能够合理有效选择这些交迭保护段的方法.对交迭段共享保护算法的分析和仿真结果表明,与以往保护算法相比,交迭段共享保护算法不但大大提高了网络连接的可靠性,而且还通过不同交迭保护段间资源的合理共享,有效地提高了网络资源的利用率. 相似文献
2.
智能光网络中一种新型的分布式恢复方法 总被引:4,自引:4,他引:0
提出了一种基于固定备用路由和目的端触发的智能光网络中的分布式恢复方法,所选择的任一对源端节点和目的的端节点之间的固定备用路由包括该节点对之间的k条最短路径路由和基于部分链路无关的路由.目的端节点一旦探测到业务通道的失效将立即启动恢复进程,根据网络当前的资源使用情况,在这些备用路由中按照一定的次序选择一条恢复路由并为此分配一条可用的波长(对于没有波长变换器的光网络),然后将恢复通道的建立请求消息发送给该恢复通道的相关节点,这些相关节点可以锁定相关的网络资源,以避免来自其他恢复通道的竞争.所提出的算法增加了固定备用路由的数量,从仿真结果可以看出,该方法明显改善了失效连接的阻塞性能. 相似文献
3.
基于节能的绿色光网络路由算法的研究 总被引:1,自引:0,他引:1
在传统的网络路由算法中,一般采用最短路径算法进行路由选路,最短路径算法以节点间的距离为权重,计算一条由源节点至目的节点的权重最小的路径以完成路由。最短路径算法虽然最小化了距离长度代价,却没有考虑能耗问题,所以使用最短路径算法所得出路径的能耗并不一定是最小的。针对这一问题,提出一种新型的综合性绿色路由算法,设定能耗作为节点间的权重,融合光旁路及业务量疏导,同时考虑路由和波长分配(RWA)问题,将完成每个业务所需要的能耗最小化,实现节能。仿真结果表明,与最短路径算法相比,绿色路由算法在较大规模网络中能够节省约40%的能耗,节能效果相当显著。 相似文献
4.
一种新的WDM光网中的共享链路保护策略 总被引:2,自引:2,他引:0
研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率. 相似文献
5.
6.
7.
《光学学报》2015,(5)
针对多域光网络环境下传统的多点对多点(MP2MP)组播路由和波长分配(RWA)算法未考虑最优化组播域序列选择的问题,以及所导致的网络资源占用量过高和难以满足实时业务服务质量(Qo S)要求的问题,提出了一种面向多域光网络、计算可并行化、基于时延和最小代价约束的多核点共享树RWA启发式算法(MSTDC)。该算法通过构造虚拓扑的方式将多域的问题转化到单域中求解,从而实现了多核点共享树最小化核心点的个数及其所在域的准确计算。在多域间并行地将源和目的节点按照特定的Qo S选择策略和算法加入到不同的共享树中。仿真验证了在网络节点数为50个且均匀地分布在9个域内的多域光网络环境下,MSTDC算法与传统组播树算法相比波长资源占用率降低可达51.1%,路由成功率提高可达24.8%,算法执行时间降低可达64.6%。 相似文献
8.
9.
现有研究表明明显的社团结构会显著降低网络的传输性能. 本文基于网络邻接矩阵的特征谱定义了链路对网络社团特性的贡献度, 提出一种通过逻辑关闭或删除对网络社团特性贡献度大的链路以提高网络传输性能的拓扑管理策略, 即社团弱化控制策略(CWCS 策略). 在具有社团结构的无标度网络上分别进行了基于全局最短路径路由和局部路由的仿真实验, 并与关闭连接度大的节点之间链路的HDF 策略进行了比较. 仿真实验结果显示, 在全局最短路径路由策略下, CWCS策略能更有效地提高网络负载容量, 并且网络的平均传输时间增加的幅度变小. 在局部路由策略下, 当调控参数0<α<2, 对网络负载容量的提升优于HDF策略.
关键词:
复杂网络
社团特性
负载容量
拓扑管理 相似文献
10.
通过网络编码方法优化多核点选择和组播信息传输,本文提出一种基于多核点共享树和网络编码的光组播路由构造和波长分配方法、减少波长资源消耗和提高网络的负载平衡性能.首先,删除产生源点迂回回路的网络编码备选核点集合,采用启发式矩阵运算方法确定多源共享树的网络编码核点,实现多源共享树以最少的核点覆盖最多的源节点;然后,为减少波长信道消耗数目,在确定的核点到目的节点间加入网络编码方法传输信息;最后,讨论了多核点共享树的波长分配方法和目的节点成功解码的边分离路径方法.仿真结果表明:与单核共享树、基于网络编码的单核共享树相比,基于网络编码的多核点共享树组播路由方法需求最少的波长数目和获得最好的网络负载平衡性能. 相似文献
11.
一种带物理约束的光网络业务量疏导方法 总被引:1,自引:0,他引:1
提出了基于最大收益的捆绑疏导算法(MRA)来解决光网络中具有多种物理约束的业务量疏导问题。MRA首先在物理拓扑上逐个放置业务, 随后捆绑细粒度业务、实现管道实例化。即考虑业务的路由情况, 将其在物理拓扑上的路由都视为单跳的细粒度管道, 然后使用基于深度优先搜索的方法来检查哪些业务能够捆绑到一起形成多跳粗粒度的潜在管道, 以节省中间节点的细粒度交换容量。再从这些粗粒度的潜在管道中, 使用最大收益的方法遴选出具有最大成本收益的无冲突集合, 并加以实例化。仿真结果显示, 在处理多个物理约束时, MRA在容量和实现成本上均优于现有的算法, 并且它能处理多达百个节点以上的大网络中的业务量疏导问题。 相似文献
12.
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. 相似文献
13.
随着光网络规模的不断扩大以及网络体系结构的扁平化过程加速,网络传输的可靠性和实时性以及生存性路面算法本身面临新的挑战.本文在单点割集的松弛生存性约束条件下,结合动态业务下的IP over WDM光网络的特点,借助蚁群优化算法的强鲁棒性和记忆能力,通过改变与调整蚁群优化算法结构中的信息素结构与其更新机制,在动态路由选择过程中,引入网络可生存性约束信息改进路由选择概率计算机制,来实现IP over WDM光网络动态生存性映射的路由策略.与其他同类算法相比,该算法不再存储网络备用路由集和物理拓扑自身庞大的割集关系,在保证网络生存性效果的前提下,通过割集松弛条件有效降低了计算的时间复杂度,提高算法收敛速度,适应网络实时性要求.仿真结果表明:与传统最短路算法比较,该算法能有效提高动态光网络的可生存性映射性能和网络的资源利用效率,并降低业务阻塞率. 相似文献
14.
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. 相似文献
15.
Since optical network carries a lot of traffic, survivability is very important to ensure the service continuity against network failures. Recently, multicast services become more popular to meet the huge multimedia demand in network, so that multicast survivability in optical network has got more attention. However, multicast survivability may lead to more energy consumption due to more redundant backup resources allocated. Since greening network is particularly important with the energy crisis keeping growing, green multicast survivability in optical network is a challenging issue. This paper focuses on the green multicast grooming protection problem in optical network and designs two auxiliary graphs that includes a virtual topology graph and an integrated graph to address the survivable multicast grooming, routing and wavelength assignment. Based on the auxiliary graphs, this paper proposes an efficient heuristic called green multicast grooming algorithm based on spanning path dedicated protection (GMG-SPDP), in which the network reliability and the energy efficiency are jointly taken into account. Simulation results show that, compared to other algorithms, the proposed GMG-SPDP not only has lower blocking probability and higher bandwidth utilization ratio, but also saves more energy. 相似文献
16.
Storage area networks (SANs) are an essential part of enterprise computing today. There is no comprehensive business continuity plan without SANs in the picture. This paper proposes and evaluates network survivability of optical paths in wavelength division multiplexing (WDM) based storage area networks in a metro ring network. The paper begins with a background on network survivability in metro WDM ring network. Subsequently, the network and node architectures along with their medium access control (MAC) protocols are described. In this work, one link failure (a single cable cut) in metro WDM based SANs in a ring network architecture is considered. Performance evaluation for network survivability in metro WDM SAN is carried out by means of discrete-event computer simulation. Network throughput and packet delay are investigated. The network performance is evaluated for asymmetric (unbalanced) traffic scenarios under Poisson and self-similar traffic. 相似文献