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

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

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

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

基于业务的智能光网络生存性研究

目前对于智能光网络（ION）生存性方面的研究主要是针对光网络本身，基于静态的资源配置和管理机制对于快速变化的业务需求而言缺乏灵活性，难以满足未来智能光网络中复杂业务的需求。基于业务的智能光网络生存性策略，可以解决现有网络生存性策略与业务侧的生存性需求之间的差异。通过将对生存性需求的描述和定义从网络侧转移到业务侧，以业务对生存性的需求为核心，能很好地实现智能光网络中对生存性策略的控制和实现。     

智能光网络中基于DRS的多层生存性策略的研究

近年来,基于区分生存性业务(DRS)的多层生存性问题在智能光网络生存性技术的研究中愈发受到关注.本文在分析现有多层生存性机制存在问题的基础上,结合DRS模型,设计了一种基于DRS的多层生存性策略,并对层间协调机制中的关键问题进行了研究.该策略不仅考虑了业务的可靠性需求差异,而且平衡了网络资源分配,有重要的实际应用价值.     

多域光网络中一种支持区分可靠性的通路保护算法

区分可靠性的通路保护方案既能为光网络中具有不同可靠性需求的业务提供有效的故障保护,又能优化网络资源的利用,是一种高效的生存性机制。但目前此类问题的研究主要是集中于传统的单域光网络中,所得的研究成果无法直接运用于具有多域特点的下一代光网络中。针对这一问题,在对以往通路保护算法进行改进的基础上提出了一种适用于多域光网络中的支持区分可靠性的通路保护算法,并对其性能进行了计算机仿真研究。仿真结果表明,该算法不仅能满足多域光网络中不同业务的可靠性需求,而且能提高网络资源的利用率、降低业务连接的阻塞率。     

嵌入式多层多域光网络路由及控制器设计(本期优秀论文)

提出一种光网络路径计算及连接控制专用系统的设计和实现方法.搭建基于该设计的实验平台实现了在多SDH及OTN域光网络之上的跨域连接调度、生存性策略等多层多域光网络互连互通功能,并满足实时性、可靠性、低成本等要求.     

可生存光网络中的不同QoS策略

随着光网络技术的不断发展,网络的生存性及其QoS问题越来越受到关注.文章围绕可生存光网络中的不同QoS策略这一问题,首先介绍了可生存光网络及其QoS参数的概念,解释了为什么如今要考虑可生存光网络中的不同QoS策略.接着以传统光网络生存性方法的一般分类图为依据,从原理、性能等方面归纳比较了以往各种生存性方法,并分析了各自的优缺点.最后根据考虑可生存性光网络中QoS参数的不同,具体描述了用来支持不同业务的各种光网络生存性方法.     

智能光网络的多域生存性技术研究

自动交换光网络是传送网的发展趋势,而快速高效的生存性是其重要特点.介绍了光网络生存性,重点分析了多域网络和域间路由问题,并且提出了具体的实现多域网络的生存性方法.     

智能光网络的多层生存性技术

文章对多层网络生存性问题、独立的网络生存性配置方案和多层网络生存性配置方案进行了概括和分析,对基于IP,GMPLS/Optical智能光网络多层结构的调整策略进行了研究,并讨论了基于智能光网络的统一控制平面、利用层间信令协调机制的集成多层网络生存性方案。     

基于GMPLS的自动交换光网络生存性技术研究

能够提供高效快速的生存性是自动交换光网络的重要特点.介绍了自动交换光网络的生存性实现的过程和各种生存性机制,提出了基于通用多协议标签交换的自动交换光网络中标签交换路径端到端生存性的实现方案,并对恢复的时间具体的分析.     

Survivability in multi-domain optical networks using p-cycles

Survivability is becoming an important issue in optical networks due to the huge bandwidth offered by optical technology. Many works have studied network survivability. The majority of these works are destined for single-domain networks. In this work, we address the survivability of multi-domain optical networks. This paper provides a classification of the existing protection solutions proposed for multi-domain networks and analyses their advantages and limitations. We propose a new solution for multi-domain optical networks based on p-cycles (pre-configured cycles). For scalability and security reasons, we also propose a topology aggregation model adapted to p-cycle computations. This aggregation model allows our proposed solution to find a trade-off between two competing goals: efficient use of backup resources and short running time. Simulation results show that the proposed solution is a good trade-off between resource utilization and running time compared to existing solutions.     

A novel multi-link fault-tolerant algorithm for survivability in multi-domain optical networks

With the large-scale deployment of optical network equipments, the problems of separated domains management and the multi-domain-based survivability have become the primary challenge in new generation intelligent optical networks. Aimed at resisting multi-link failures in multi-domain optical networks (MDON), a heuristic multi-link fault-tolerant (MLFT) algorithm for survivability in MDON is proposed in this article, which applied Hamiltonian cycle protection and segment-shared protection to establish a novel survivability strategy for either intra-domain??s or inter-domain??s multiple links, respectively. Furthermore, a new virtual-link mapping scheme and link-cost formulas are presented to encourage the appropriate routing selection and load balancing, which can also contributed to better resource utilization ratio and blocking ratio. Simulation results show that MLFT realizes the multi-link fault-tolerant survivability at a lower cost with better performances in redundancy ratio, blocking ratio, and computation complexity.     

A novel domain-by-domain survivable mechanism in multi-domain wavelength-division-multiplexing optical networks

In multi-domain wavelength-division-multiplexing (WDM) optical networks, the inter-domain routing is a challenge since each single-domain cannot view the full network topology. At the same time, survivability is also an important issue in optical networks since the failures of fiber links or network nodes may lead to a lot of traffic being blocked. In this paper, we study the survivability in multi-domain WDM optical networks, and propose a new survivable mechanism called load balanced domain-by-domain routing (LBDDR). In LBDDR, in order to obtain the efficient inter-domain survivable routes, we present the domain-by-domain routing (DDR) method which can find the intra-domain sub-working path and sub-backup path in each single-domain to form the inter-domain working path and backup path for each demand. In order to reduce the blocking probability, we present the load balanced routing method which can encourage the traffic to be uniformly distributed on the links with more free wavelengths. Simulation results show that, compared with conventional mechanism, LBDDR can obtain better performances.     

Hierarchical routing and traffic grooming in IP/MPLS-based ASON/GMPLS multi-domain networks

Routing, connection setup, and path computation are well-known problems in multi-domain networks, which have been largely analyzed in pure IP (packet) networks. In circuit-switched optical multi-domain networks, there remain, however, a number of routing and path computation challenges. Traffic grooming means combining a number of low-speed traffic streams so that the high capacity of each lightpath may be used as efficiently as possible, as path computation implements the core of the grooming function, it is obvious that solutions for the traffic grooming problem in optical multi-domain networks are still not sufficiently investigated. In this study we propose a methodology to address the problems of routing, connection setup, and traffic grooming in optical multi-domain networks, which adapts a two-level hierarchical routing scheme and full-mesh topology abstraction algorithm to improve routing scalability and lower inter-domain blocking probabilities; additionally our proposed methodology adapts a scheme for traffic grooming in DWDM multi-domain networks to improve the resources usage. To test our proposed methodology we propose a detailed IP/MPLS-based ASON/GMPLS multi-domain multilayer test framework.     

Evaluation of post-fault restoration strategies in multi-domain networks

Although multi-domain survivability is a major concern for operators, few studies have considered the design of post-fault restoration schemes. This paper proposes two such strategies, based upon hierarchical routing and signaling crankback, to handle single and multi-link failure events in multi-domain IP/MPLS networks (also extendible to optical DWDM networks). Specifically, the hierarchical routing strategy relies upon abstracted domain information to compute inter-domain loose routes, whereas the crankback scheme applies signaling re-tries to restore paths in a domain-by-domain manner. The performance of these proposed solutions is then analyzed and compared via simulation.     

光网络中基于路径计算单元的路由机制研究

针对大规模多层多域光网络群故障发生时的网络受损情况,提出基于路径计算单元(PCE)架构的跨域路由算法进行快速恢复,并基于OMNet平台对多层多域路由方案进行了性能仿真分析。结果表明,基于PCE架构的路由策略在群故障发生时能够大大减少网络中的路径计算请求泛洪信息,降低路由计算收敛时间,可以提高全网剩余资源的资源利用率,为业务的快速恢复提供了路由基础。     

A novel method to evaluate clustering algorithms for hierarchical optical networks

The routing issues in multi-layer and multi-domain optical networks have drawn much attention in current research. With the introduction of the path computation element, routes can be calculated more efficiently in multi-domain optical networks. However, the optimal degree of routing approach in multi-layer and multi-domain optical networks is also determined by the clustering algorithms deployed for construction of hierarchical networks. Therefore, it is important to investigate the way to evaluate the impact of the clustering algorithm on the routing approach (e.g., blocking probability) in optical networks with dynamic traffic, which has not been studied sufficiently. In this paper, a novel method to describe and evaluate the clustered structures generated by different clustering algorithms for hierarchical optical networks is proposed. This method deploys a novel evaluation metric that represents blocking probability of clustered optical networks, so it can be used as guidelines for designing clustered structures. Besides theoretical analysis, simulations are carried out on different network topologies and clustered types to validate the effectiveness of the method presented.     

Unavailability analysis of long-haul networks

Network survivability is a key concern in today's network, and will become increasingly important in future optical networks as they carry ever more traffic. Networks are also becoming more complex, with the requirement for increased functionality. Currently, there is a lack of understanding in the industry as to the exact relationship between the choice of network architecture and the meeting of a set availability objective. This paper analyses a number of long-haul network architectures from an unavailability point of view. The long-haul networks analyzed include: networks with diversity, networks with restoration capability, and networks with survivability. Derivations are given for each architecture; formulas for 2 and 4-fiber rings, and dual fed routing are new. A hypothetical reference connection (HRX) and its unavailability objectives are used as references. Networks with restoration capability and networks with survivability meet the proposed objective. Self-healing rings (both 2 and 4-fiber bidirectional line switched rings) and dual fed systems offer the highest level of survivability, by eliminating service impacts caused by cable cuts and equipment failures