一种改进的多域光网络保护机制

生存性是保证业务服务质量的关键,多域光网络生存性问题中,由于存在多域间拓扑和路由信息不可见等约束,导致生存性实现较为困难.提出了将多域光网络进行逻辑聚合的思路,在此基础上分别针对域内和域间提出了非等值负载保护和M∶1保护机制.域内的非等值负载保护机制可以根据节点数以及业务量动态地分配保护路径,从而有效地提高资源利用率.     

多域光网络联合路由保护算法

研究了多域光网络中的路由保护问题。为了避免多域光网络通路保护二步算法可能导致的多域陷阱问题,提出了一种基于Suurballe算法扩展的多域联合路由保护算法。仿真表明,相比传统的多域通路保护二步算法,该算法资源利用率高,阻塞率低,平均每连接跨域数小。     

多域光网络中考虑域间输出策略的分段共享保护算法

研究了多域光网络中的路由保护问题.在多域光网络中,域间路由的建立要遵从域间输出策略.在考虑域间输出策略的基础上提出了一种多域光网络中基于路径计算单元的分段共享保护算法.仿真表明,相比传统的基于路径计算单元的多域分段保护算法,该算法阻塞率低,平均保护切换时间短.     

光网络中的一种基于虚拟源的动态多播保护算法

随着各种多播业务的不断出现,如何在网络的光层实现多播业务的可靠性传输已成为光网络研究中的一个热点问题,而多播保护算法是这一问题的核心.目前多播保护算法的研究都是在假设网络所有节点具有多播功能的条件下进行的,然而由于成本的限制,实际光网络往往是一个稀疏多播光网络,即网络中只有部分节点具有多播功能.针对这一问题,提出了一种基于虚拟源的动态多播保护算法.仿真结果表明:该算法不仅能在稀疏多播光网络中满足多播业务可靠传输的要求,还具有较高的网络资源的利用率和较低的时间复杂度.     

多域光网络中采用条件风险分离度的生存性策略

为了克服多域光网络中可扩展性约束的缺点,在多域光网络中提供区分业务的服务,提出一种采用条件风险分离度的多域光网络生存性策略.该策略给出条件风险分离度的概念,应用条件风险分离度实现域内虚链路映射,计算区分业务可靠性的端到端工作,保护路由对.仿真结果表明,所提生存性策略不仅能够区分业务可靠性,降低业务阻塞率,而且能够为业务提供平均高于其请求6.5%的可靠度.     

多域光网络中抗破坏风险评估

为提高多域光网络抗破坏能力,拟改善对其进行风险评估的方法,通过构建多域光网络入侵风险评估模型,采用非线性维纳滤波检测方法进行多域光网络入侵的检测滤波,构建多域光网络抗破坏风险评估的检测统计量,结合分组样本回归分析方法进行多域光网络抗破坏风险的关联挖掘,采用自适应寻优方法求得多域光网络入侵风险的统计分布,利用模糊网格聚类方法发现多域光网络入侵集中的隐含模式,根据聚类分布情况实现多域光网络抗破坏风险评估。仿真结果表明,评估精度与信噪比呈正相关,而本文方法显示,在信噪比0. 5～3. 5的区间中,评估精度为0. 79～0. 986,高于时频分析方法的0. 522～0. 853与小波分析方法的0. 504～0. 807。耗时数据统计显示,在网络节点数100～500的区间中,本文方法耗时仅2. 46～9. 32 ms,低于时频分析方法的8. 66～26. 04 ms与小波分析方法的10. 21～45. 53 ms。采用该方法进行多域光网络抗破坏风险评估的效果较好,更具优越性。     

多域光网络生存性的关键技术研究

多域光网络的生存性作为衡量网络性能优劣的关键指标,与实际网络应用的关系最为密切,是当前迫切需要解决的关键问题;聚焦高速化、多业务化驱动的多域光网络环境下的生存性技术.基于光网络的多业务、分布式控制的特性,分析了多域光网络生存性机制的研究现状及面临的挑战;给出了一种针对多域光网络生存性问题的分类方法;结合多域光网络对生存性的需求,对相关关键技术进行了归类和研究,并指明了进一步研究的方向和重点.     

多域光网络中的动态RWA算法研究

随着光网络规模的不断增大,下一代智能光网络将被划分为多个路由域进行分布式管理.由于在这种具有分布式特点的多域光网络中,每个路由域只了解本地子网内的拓扑和资源信息,因此以往光网络中已有的基于全网信息的动态RWA算法将不在有效.文章首先分析了多域光网络中的动态RWA问题,然后针对多域网的特点对已有的RWA算法进行了修改,并在给定的多域光网络模型中对该算法进行了仿真研究.结果表明:在多域网络环境下,以往的动态RWA算法急需改进.     

一种光网络中可用性的计算方法

光纤骨干通信网中,一条光纤的断裂会引起大量业务中断.因此,对于每一条工作光路可配置一条链路分离的保护光路.采用共享通路保护时光路连接的可用性计算是网络设计时的重要问题.现对共享通路保护方式下光路连接可用性的计算给出了推导过程和一种明显的计算公式.最后给出实例,通过与仿真结果的比较验证了计算方法的正确性.     

光网络中一种考虑信号损伤限制和服务质量区分的动态RWA算法

在光网络中,光信号沿着路由与波长分配(RWA)算法选定的光通路传输的过程中会受到各种信号损伤的影响而导致信号质量的不断下降,严重影响着业务的服务质量(QoS).而光网络中多样化的客户层业务往往有着不同的QoS的需求,因此有必要根据不同的业务QoS需求对光信号损伤的影响进行不同程度的控制.针对这一问题,提出了一种能同时考虑信号损伤限制和服务质量区分的动态RWA算法,并通过计算机仿真的方法对其性能进行了分析和验证.结果表明:该算法既能克服光网络中信号损伤的影响又能为不同级别的业务提供不同的QoS保证,更贴近实际需求.     

Enhanced Dynamic Segment Protection in WDM Optical Networks under Reliability Constraints

In this letter, we study the protection problem in wavelength division multiplexing (WDM) optical networks, and propose a novel dynamic heuristic algorithm called differentiated reliable segment protection (DRSP). Differing from previous work, DRSP can effectively avoid the trap problem and is able to find a feasible solution for each connection request. Therefore, DRSP outperforms the previous work. Simulation results have shown to be promising.     

无向通信网端对端可靠性通用算法

针对无向通信网的节点和链路都存在失效的问题,提出了端到端可靠性的通用算法。对无向网络基于概率论的分解定理进行证明,介绍了无向网络的简化与分解算法及流程,并分析了端到端可靠度的计算准则,针对3种复杂程度无向网络进行了分析比较,最后提出一种无向通信网端对端可靠性通用算法。分析结果表明提出的通用算法适合节点和链路都不可靠的情...     

A Study of Path Protection in Large-Scale Optical Networks

We consider the problem of designing a network of optical cross-connects (OXCs) which provides end-to-end lightpath services to large numbers of client nodes, under the requirement that the network will survive any single-link failure. Our main objective is to quantify the additional resource requirements of implementing path protection schemes over a network with no survivability properties. To this end, we present heuristic routing and wavelength assignment algorithms for dedicated path protection and two variants of shared path protection, and integrate them into the physical and logical topology design framework we developed in an earlier study. We apply our heuristics to networks with up to 1000 client nodes, with a number of lightpaths that is an order of magnitude greater than the number of clients, and for a wide range of values for system parameters such as the number of wavelengths per fiber, the number of optical transceivers per client node, and the number of ports per OXC. Our results provide insight into the relative resource requirements of dedicated and shared path protection schemes. We also find that, using shared path protection schemes, it is possible to build cost-effective survivable networks that provide rich connectivity among client nodes with only a modest additional amount of resources over a network with no survivability properties.     

Cost Effective Shared Path Protection for WDM Optical Mesh Networks with Partial Wavelength Conversion

In this paper, we study routing and wavelength assignment of connection requests in survivable WDM optical mesh networks employing shared path protection with partial wavelength conversion while 100% restorability is guaranteed against any single failures. We formulate the problem as a linear integer program under a static traffic model. The objective is to minimize the total cost of wavelength-links and wavelength converters used by working paths and protection paths of all connections. A weight factor is used which is defined as the cost ratio of a wavelength converter and a wavelength-link. Depending on the relative cost of bandwidth and wavelength conversion, the optimization objective allows a proper tradeoff between the two. The proposed algorithm, the shortest-widest-path-first (SWPF) algorithm, uses a modified Dijkstra's algorithm to find a working path and a protection path for each connection request in the wavelength graph transformed from the original network topology. When there are multiple candidate paths that have the same minimum total cost, the path along which the maximum number of converters used at each node is minimized is chosen by the SWPF algorithm. We have evaluated the effectiveness of the proposed algorithm via extensive simulation. The results indicate that the performance of the proposed algorithm is very close to that of the optimal solutions obtained by solving the ILP formulation and outperforms existing heuristic algorithms in terms of total number of converters used and the maximum number of converters required at each node in the network. The proposed algorithm also achieves slightly better performance in terms of total cost of wavelength-links and converters used by all connections. We also investigated shared path protection employing converter sharing. The results show that the technique can reduce not only the total number of converters used in the network but also the maximum number of converters required at each node, especially when a large number of converters are needed in the network. In this study, although the ILP formulation is based on static traffic, the proposed algorithm is also applicable to routing dynamic connection requests.     

光突发交换网络中的区分服务研究

为了在光突发交换网络中提供端到端的区分服务,提出了一种区分服务模型,并详细介绍了其功能.提出了一种控制分组的区分服务编码点,详细研究了一系列区分服务规则,包括编码点的改写和更新以及区分服务模型的可扩展性.同时提出了几个有待进一步研究的问题.     

基于多波长光传送网的网络保护与恢复

介绍了传送网的发展趋势和结构变化 ,分析了原有传送网的一些保护与恢复方式 ,然后着重分析了多层传送网保护与恢复方面的一些问题 ,提出了在基于多波长的多层融合光传送网中如何更好地实现保护与恢复的几种方法及原则 ,并进行了相应的对比和分析。     

基于结构分割的自适应MPEG—I视频编码系统

本文介绍一种基于结构分割的自适应编码系统。图像组（ＧＯＰ）中参考帧的数目以及它们间的间隔由可补偿性分析自适应地确定。时间视觉掩盖效应已利用于合理分配不同帧的码率。实验结果表明，这种自适应调整图像组结构的编码系统，无论视觉效果还是信噪比，都明显优于固定结构的编码系统。     

Capacity Efficiency and Restorability of Path Protection and Rerouting in WDM Networks Subject to Dual Failures

Resilient optical networks are predominately designed to protect against single failures of fiber links. But in larger networks, operators also see dual failures. As the capacity was planned for single failures, disconnections can occur by dual failures even if enough topological connectivity is provided. In our approach the design of the network minimizes the average loss caused by dual failures, while single failures are still fully survived. High dual failure restorability is the primary aim, capacity is optimized in a second step. For WDM networks with full wavelength conversion, we formulate mixed integer linear programming models for dedicated path protection, shared (backup) path protection, and path rerouting with and without stub-release. For larger problem instances in path rerouting, we propose two heuristics. Computational results indicate that the connectivity is of much more importance for high restorability values than the overall protection capacity. Shared protection has similar restorability levels as dedicated protection while the capacity is comparable to rerouting. Rerouting surpasses the protection mechanisms in restorability and comes close to 100% dual failure survivability. Compared to single failure planning, both shared path protection and rerouting need significantly more capacity in dual failure planning.