Jie Zhang

Spectrum–block consumption for shared-path protection with joint failure probability in flexible bandwidth optical networks

We propose a minimum-free-spectrum-block-consumption algorithm (MFSB) for shared-path protection with joint failure probability requirements in flexible bandwidth optical networks. Compared with conventional algorithms, MFSB efficiently decreases the spectrum block consumption and achieves higher spectrum utilization.

Energy and Spectrum Efficiency with Multi-Flow Transponders and Elastic Regenerators in Survivable Flexible Bandwidth Virtual Optical Networks

Survivable energy-aware and spectrum-aware approaches (SEA/SSA) are developed to minimize energy and spectrum consumption in flexible bandwidth virtual optical networks. Simulation results show that SEA and SSA can efficiently reduce energy and spectrum consumption, respectively.

Minimum spectrum block consumption for shared-path protection with joint failure probability in flexible bandwidth optical networks

We propose a minimum-free-spectrum-block-consumption algorithm (MFSB) for shared-path protection with joint failure probability requirements in flexible bandwidth optical networks. Compared with conventional algorithms, MFSB efficiently decreases the spectrum block consumption and achieves higher spectrum utilization.

Minimized spectrum resource consumption with rescaled failure probability constraint in flexible bandwidth optical networks

We investigate the problem of minimizing spectrum resource consumption for a set of connection requests in a flexible bandwidth optical network under the constraint that the failure probability of each connection must be below a specified threshold. To optimize the total frequency slots consumed, three schemes are proposed and evaluated: the rescaled failure-probability-aware algorithm (RFPA), the traffic cognition algorithm with rescaled failure probability (RFPTC), and an integer linear programming (ILP) model. We also introduce two traditional Dijkstras algorithms with load balancing and spectrum assignment by first fit and traffic cognition (FF_DB and TC_DB) to compare with the proposed three schemes. For static traffic in a small network, the total frequency slots consumed by the RFPA and RFPTC algorithms will approach that of the optimal ILP solution as K increases, aswellastheaveragehops (AH). Furthermore, the average rescaled failure probabilities (RFPs) of the RFPA and RFPTC algorithms are much better than thoseof the ILP solutions. Inaddition, similarly, the results of the heuristic algorithms, FF_DB, TC_DB, RFPA, and RFPTC, in the large network have the same characteristics as in the small network. For dynamic traffic in a large network, the RFPTC algorithm reduces blocking probability and makes the best use of spectrum resources compared with the other schemes, which also reflects that discontinuous spectrum fragmentation is greatly reduced by the traffic cognition method. However, both RFPTC and RFPA result in much higher average RFP but perform fewer AH compared to TC_DB and FF_DB.

A distributed flexible architecture of adaptive control and service provisioning for automatic switched optical network

A distributed flexible architecture of adaptive control and service provisioning founded on automatic switched optical network is proposed in this paper. The testbed named Adaptive Multi-Service Optical Network (AMSON) has been developed for proof of the fundamental of adaptive control for intelligentized service realization and lightpath transmission.

Minimizing spectrum usage for shared-path protection with joint failure probability constraint in flexible bandwidth optical networks

This paper addresses the problem of minimizing spectrum usage for shared-path protection with joint failure probability constraint in flexible bandwidth optical networks. To achieve this goal, we propose an integer linear programming (ILP) model for shared-path protection and a heuristic spectrum-aware shared protection (SASP) algorithm that considers joint failure probability. Simulation results show that the ILP model minimizes the total usage of frequency slots and average hops, but leads to high average joint failure probability. Moreover, the SASP algorithm achieves better trade-off between total usage of frequency slots and average joint failure probability compared to the ILP model and a conventional shared-path protection (CSPP) algorithm. As expected, in a 14-nodes network, the SASP algorithm performs better with respect to total spectrum usage and average hops, but results in much larger average joint failure probability compared to the CSPP algorithm.

Evaluation of GMPLS controlled Multi-granularity Automatically Switched Optical Network

The Single-granularity Automatically Switched Optical Network (SASON) has been extensively researched in recent years. Yet little work has been done in the research of integrating multi-granularity Optical Cross-Connects (OXCs) with ASON architecture, that is Multi-granularity ASON (MASON). In this paper, Generalised Multi-Protocol Label Switching (GMPLS) controlled MASON is evaluated through simulations. For the first time MASON is compared with SASON. The results reveal that MASON is more scalable and does better in cost saving. But its advantages are at the expenses of longer connection setup time, worse blocking performance and more sensitivity to the inaccuracy of the routing information. Copyright

Adaptability of optical multi-service transport networks

Optical multi-service transport networks are on the edge of new round of revolution from automation to autonomy. The viewpoint of adaptability is proposed as an important topic to understand future optical networks in this paper. Related studies have been deployed in the aspects of service-oriented, traffic-oriented and media-oriented adaptability.

Dynamic interdomain wavelength routing based on source routing in ASON

The inter-domain and intra-domain routings are treated jointly with dynamically distributed algorithms in automatic switched optical networks (ASON) based on source routing. The simulation results show that the performance of the blocking probability is improved. Furthermore, the routing loops can be avoided efficiently and the inter-domain signaling complexity is reduced significantly by the proposed algorithms.

A Novel Framework and the Application Mechanism with Cooperation of Control and Management in Multi-domain WSON

Multi-layer and multi-domain optical networks have drawn much attention in current research, and the wavelength switched optical network (WSON) is viewed as one of the best solutions in optical networks. In this paper, a novel Cooperative Control and Management Framework (CCMF) in multi-domain WSON is proposed to support the arising intelligent applications and optimize resource utilization with more scalability and robustness. In CCMF, we focus on the mechanism with the consideration of requirements of intelligent applications with complex flows, performance guarantees and traffic engineering in a traditional optical network. Thus, a combined provisioning approach, synergetic between the control plane (CP) and the management plane (MP), is presented with the policy based management system, in which a mobile agent is introduced to support the communication between MP and CP. Furthermore, one application, a novel multi-domain impairment aware routing and wavelength assignment (MIA-RWA) algorithm at the Bit Error Rate level, based on the proposed CCMF, is presented. It is proposed to improve the routing performance in multi-domain WSON. Finally, comprehensive simulations are conduced to verify the effectiveness of CCMF and the proposed mechanisms.