A novel segment-shared protection algorithm based on dynamic domain-sequencing scheme for multi-domain optical mesh networks

Survivability has been widely recognized as an important design issue for optical networks. In practice, as the network scale keeps expanding, this design problem becomes more critical. Due to scalability and domain privacy, designing the protection scheme in multi-domain networks is more difficult than that in single domain networks. The path computation element (PCE) is known as an efficient architecture to compute optimal traffic engineering (TE) paths in multi-domain multilayer networks. Based on the PCE architecture, we first propose a new dynamic domain-sequencing scheme that considers the load balance of inter-domain links and then propose an improved segment-shared protection approach called DDSP. It can provide 100% protection ability for multiple failures that each single domain has only one failed link. Finally, the protection based on the optimal dynamic domain-sequencing scheme, called OPT, is designed, to evaluate performance of our algorithm and to provide the good bounding for the dynamic domain-sequencing scheme with limited intra TE information. Simulation evaluation shows that the proposed scheme is effective in multi-domain path protection with more efficient resource utilization, lower blocking probabilities and less inter-domain cost. Furthermore, the performance of it is near to OPT.     

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.     

一种面向生存性提升的光网络增长设计算法

研究了使非2-连通的光网络向可生存结构升级演进的增长型设计策略,提出了通过在增广拓扑上为网络业务提供共享路径保护来确定网络增长规划方案的SBPP-TA机制.通过建立整数线性规划(ILP)模型并进行仿真,结果表明,SBPP-TA策略能在添加尽量少的网络资源的情况下有效提升网络的生存性.     

Improving survivability for multi-link failures with reprovisioning in WDM mesh networks

This article proposes a new heuristic algorithm, called Shared Multi-sub-backup-paths Reprovisioning (SMR), to improve the survivability for multi-link failures in WDM mesh networks. In SMR, each connection will be initially assigned one primary path, one backup path, and multiple sub-backup paths. When failures occur, based on the corresponding policy SMR will reprovision the primary or backup resources for these connections affected by the failures. Compared to previous algorithms, the survivable performance of SMR can be significantly improved. The short version of this article was presented at the International Workshop on Broadband Convergence Networks (BCN) 2007.     

P-cycle Protection in multi-domain optical networks

Providing resilient inter-domain connections in multi-domain optical GMPLS networks is a challenge. On the one hand, the integration of different GMPLS domains to run traffic engineering operations requires the development of a framework for inter-domain routing and control of connections, while keeping the internal structure and available resources of the domains undisclosed to the other operators. On the other hand, the definition of mechanisms to take advantage of such automatically switched inter-domain connectivity is still an open issue. This article focuses on the analysis of applicability of one of these mechanisms: P-cycle-based protection. The proposed solution is based on the decomposition of the multi-domain resilience problem into two sub-problems, namely, the higher level inter-domain protection and the lower level intra-domain protection. Building a P-cycle at the higher level is accomplished by certain tasks at the lower level, including straddling link connection, capacity allocation and path selection. In this article, we present several methods to realize inter-domain P-cycle protection at both levels and we evaluate their performance in terms of availability and spent resources. A discussion on a proposal of implementation of signalling based on extensions of existing protocols such as RSVP-TE and the PCE architecture illustrates the practical viability of the approach.

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

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

A novel Topology Aggregation approach for shared protection in multi-domain networks

Routing for shared protection in multi-domain networks is more difficult than that in single-domain networks because of the scalability requirements. We propose a novel approach for shared protection routing in multi-domain networks where the key feature is a special Topology Aggregation. In this Topology Aggregation, only some potential intra-domain paths (intra-paths for short) are selected for carrying working and backup traffic between domain border nodes. The abstraction of each intra-path to a virtual edge makes the original multi-domain network to become an aggregated network. On the aggregated network, a single-domain routing algorithm for shared protection can be applied for obtaining the complete routing solutions. The experiments show that the proposed approach is scalable. Moreover it is close to the optimal solution in single-domain networks and outperforms the previously proposed scalable solutions in multi-domain networks.     

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.     

Hybrid survivability approaches for optical WDM mesh networks

This paper studies the problem of providing recovery from link failures in optical wavelength division multiplexing (WDM) networks. One of the widely studied mechanisms is dynamic link restoration, which provides recovery by determining restoration paths around a link after a failure occurs. This mechanism leads to a lower backup resource utilization, fast failure signaling rate, and a scalable operation. However, one of the main drawbacks of uncoordinated dynamic restoration is the inability to provide a 100% recovery for all connections, especially at high network loads. An alternate solution is proactive protection, where backup capacity is reserved during connection setup that can guarantee recovery under certain conditions (e.g., single link failures) but requires higher backup capacity and has low spare capacity utilization when failures do not occur. This paper presents two hybrid survivability approaches that combine the positive effects of restoration and protection. The proposed algorithms make use of available or collected network state information, such as link load, to identify critical links or segments in the network that are then proactively protected. The overall goal of the proposed approaches is to improve the restoration efficiency by providing a tradeoff between proactive protection and dynamic restoration. This paper presents a detailed performance analysis of the proposed algorithms. Experimental results show that under high loads, both the proposed approaches maintain a consistent restoration efficiency of at least 10%, or higher, when compared to the basic restoration scheme.     

Resource allocation strategies for survivability in WDM optical networks

WDM optical networks are high speed networks and provide enormous capacity. Survivability is very important issue in these networks. Survivability requires resources for handling the failures. So, efficient resource allocation strategy is required for survivability. In this paper, we have presented two resource allocation strategies for survivability. These strategies reserve the resources for the primary lightpaths and backup lightpaths. Then extensive simulations are done on different networks to evaluate the performance in terms of blocking probability. The results show that the second strategy performs better than first strategy.     

Data-centric optical networks and their survivability

The explosive growth of data traffic-for example, due to the popularity of the Internet-poses important emerging network requirements on today's telecommunication networks. This paper describes how core networks will evolve to optical transport networks (OTNs), which are optimized for the transport of data traffic, resulting in an IP-directly-over-OTN paradigm. Special attention is paid to the survivability of such data-centric optical networks. This becomes increasingly crucial since more and more traffic is multiplexed onto a single fiber (e.g., 160×10 Gb/s), implying that a single cable cut can affect incredible large traffic volumes. In particular, this paper is tackling multilayer survivability problems, since a data-centric optical network consists of at least an IP and optical layer. In practice, this means that the questions "in which layer or layers should survivability be provided?" and "if multiple layers are chosen for this purpose, then how should this functionality in these layers be coordinated?" have to be answered. In addition to a theoretical study, some case studies are presented in order to illustrate the relevance of the described issues and to help in strategic planning decisions. Two case studies are studying the problem from a capacity viewpoint. Another case study presents simulations from a timing/throughput performance viewpoint     

WDM光网络中单链路失效的混合生存性算法研究

提出了一种新的动态混合生存性(Dynamic Hybrid Survivability,DHS)算法.在DHS算法中,不同优先级的连接请求采取了不同的抗毁策略.DHS算法对到来的连接请求,能够根据网络当前的状态动态调整链路权值,计算相应的工作路径/保护路径,从而在整个网络中起到平衡负载的作用.计算机仿真表明DHS算法具有较优的网络性能.     

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

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

Signalling end-to-end optical services over multi-domain networks

This paper proposes a new UCLP (User-Controlled LightPath) architecture that offers end-to-end optical services provisioning in a multi-domain network. It also shows the experimental results of our UCLP software tool implemented on the Canarie optical network testbed. This work is motivated by the growing need for end-to-end lightpaths to support high volume data transferring applications such as GridFTP (GRID File Transfer Protocol) and SAN (Storage Area Networks) over multi-domain networks. The main problems encountred while provisioning end-to-end optical service in a multi-domain network are investigated and a review of the different interdomain signalling approaches is provided in comparison with our user-controlled lightpath provisioning approach. Various interdomain signalling approaches are discussed and compared to justify the necessity of signalling methods at the application level for long-duration applications.     

WDM光网络中一种新型的动态共享保护算法

波分复用(WDM)光网络中引入了共享风险链路组(SRLG)的概念 ,要求工作通路与保护通路不能处于同一个SRLG之中.文章提出了一种基于SRLG限制的动态共享通道保护算法,即满足K对业务的动态链路权重配置(K-Dynamic Link Weight Configuration, K-DLWC)算法 ,该算法的     

A novel online wavelength assignment algorithm in wavelength-convertible multi-granular optical networks

As industrial technology gets more mature, a single fiber can offer more and more wavelengths. However, it also results in a large amount of switching ports at optical cross-connects (OXCs). Certainly, it is expected that higher and higher complexity is inevitable to control and manage such large OXCs. In this paper, we study the dynamic wavelength assignment problem in waveband switching (WBS) networks composed of multi-granular OXCs (MG-OXCs). Moreover, in order to relax the wavelength continuity constraint on lightpath establishments, each MG-OXC node is equipped with a certain number of converters. To efficiently minimize the extra port consumption and utilize wavelength converters, we proposed an online wavelength assignment algorithm named Least Weighted Configuration Cost (LWCC). For a new request, LWCC first adopts fixed routing and then exploits the layered-graph approach and a new cost function for edge weight assignment to determine adequate wavelength(s). The performance metrics of interest include both blocking performance and converter utilization. Numerical results show that LWCC is superior in waveband grouping and therefore results in significant performance gain in terms of blocking probability.

OBGP+: An improved path-vector protocol for multi-domain optical networks

One of the essential components for the dynamic provisioning of lightpaths across multiple domains is the Routing and Wavelength Assignment (RWA) strategy adopted. The consolidation that path-vector protocols have had in practice, has motivated the optical extension to BGP (OBGP). We claim, however, that a routing model mostly centered on the exchange of reachability information-like the one we have today with BGP or the one offered by OBGP-will not be sufficient for multi-domain optical networks. Routing domains must be able to exchange both reachability as well as aggregated Path-State Information (PSI). Understanding that this is a missing piece in the routing models provided by BGP and OBGP is easy nowadays, but contributing with solutions capable of highly improving the performance of a path-vector without impacting on key aspects of the protocol-fundamentally, its scalability, its convergence properties, and the number of routing messages exchanged between domains-is a challenging task.In this paper we propose OBGP +, which is a very simple extension of a path-vector protocol supporting the computation and advertisement of PSI between optical domains. The PSI that we propose to use is highly condensed in the form of a single integer value. In order to avoid the typical increase in the number of routing messages associated with the update of PSI, we propose to piggy-back the updates in non-dummy Keepalive messages exchanged between OBGP+ neighbors. Extensive simulations reveal that, despite its simplicity: (i) OBGP+ is able to drastically reduce the blocking experienced with a path-vector protocol like OBGP; (ii) OBGP+ needs much less number of routing messages than OBGP to achieve such performance; and (iii) the convergence and restoration features of OBGP+ are also better than those of OBGP, which is particularly important for connections that lack a protection path.     

Virtualized controller placement for multi-domain optical transport networks using machine learning

Photonic Network Communications - Optical multi-domain transport networks are often controlled by a hierarchical distributed architecture of controllers. Optimal placement of these controllers is...     

An efficient fault-tolerant distributed channel allocation algorithm for cellular networks

A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.