K-dimensional protection structure (KDPS) for multi-link failure in data center optical networks

Currently, data center has become one of the most important application resources. Meanwhile, there is huge amount of data streams within a data center or among different data centers, which requires the transmission channel with high bandwidth and good reliability. Optical networks become the essential solution for the data center interconnection. Especially for intra data center networks, there are too many links for a limited number of nodes, which make the network so complex and vulnerable. A K-dimensional protection structure (KDPS) is proposed against multi-link failure in data center optical networks, and 3DPS is mainly introduced and analyzed in the paper. Two greedy algorithms are proposed to construct KDPS in static and dynamic optical networks respectively. Numerical results show that 3DPS can be constructed with more difficulty in dynamic optical networks, and the greedy algorithm can find the 3DPS much easier under three-link failures than under dual-link failures.     

A Wavelength and Bandwidth Assignment Algorithm to Support Guaranteed Bandwidth Levels in Hybrid Time Division Multiplexing/Wavelength Division Multiplexing Ethernet Passive Optical Networks

Abstract

A novel bandwidth assignment algorithm in wavelength division multiplexing Ethernet passive optical networks, called a dynamic wavelength assignment service level agreement, is proposed to efficiently provide subscriber differentiation. Simulation results show that the dynamic wavelength assignment service level agreement outperforms other bandwidth allocation algorithms in wavelength division multiplexing Ethernet passive optical networks, as it makes a fairer bandwidth distribution than other methods and is able to overcome the non-allowed packet fragmentation of the Ethernet passive optical network standard. Consequently, it greatly increases the achieved throughput and always ensures a minimum guaranteed bandwidth to every priority subscriber. Furthermore, the new algorithm obtains lower mean packet delay and packet loss rate for the highest priority subscribers when compared with other bandwidth distribution schemes in wavelength division multiplexing Ethernet passive optical networks.     

Dynamic routing,modulation level and spectrum allocation (RMLSA) in FWDM with modulation format conversion

This paper proposes a dynamic routing, modulation level and spectrum allocation (RMLSA) scheme in the flexible optical wavelength-division multiplexing (FWDM) networks with modulation format conversion ability. The scheme considers the modulation format conversion at the intermediate nodes and addresses the fragmentation problem by avoiding appearance of them. The influence of routing to the emergence of the fragmentation is quantified, which is referenced to decide which one route of k-paths to use. Simulation results demonstrate efficient reductions in blocking rates and improvements in failure recovery rates for the scheme in the network.     

Accuracy and precision of methods for community identification in weighted networks

Different algorithms, which take both links and link weights into account for the community structure of weighted networks, have been reported recently. Based on the measure of similarity among community structures introduced in our previous work, in this paper, accuracy and precision of three algorithms are investigated. Results show that Potts model based algorithm and weighted extremal optimization (WEO) algorithm work well on both dense or sparse weighted networks, while weighted Girvan–Newman (WGN) algorithm works well only for relatively sparse networks.     

Blocking in wavelength-routed all-optical WDM network with wavelength conversion

The blocking probability in wavelength-routed all optical networks is very important measure of performance of the network, which can be affected by many factors such as network topology, traffic load, number of links, algorithms employed and whether wavelength conversion is available or not. In this paper, we have proposed a mathematical model to reduce the blocking probability of the WDM optical network for wavelength-convertible networks. The model can be used to evaluate the blocking performance of any network topology also it can be useful to improve its blocking performance of the given network topology. The blocking probability variation of the network for a particular load (per link) has been studied based on the load variation and total number of wavelengths used in the network. This model gives good results for high load (per link).     

Differential group delay monitoring using an all-optical signal spectrum-analyser

We demonstrate an all-optical device that monitors differential group delay (DGD) degradation of picosecond optical pulses. This device is based on an ultrafast all-optical signal analyser that uses nonlinear effects (cross-phase modulation) to transfer rapid temporal fluctuations into frequency domain effects that can be measured on an conventional optical spectrum analyser (incorporating a slow-detector). This monitoring scheme will enable rapid dynamic monitoring and compensation of DGD in ultrafast optical networks, at 160 Gb/s data rates and beyond, where electronic monitoring techniques cannot operate. We discuss the required signal polarisation condition.     

基于径向基函数神经网络的传感布里渊散射谱特征提取

基于布里渊效应的分布式光纤传感器以其可在沿光纤中同时获得被测量场时间和空间上的连续分布信息,成为当前国际的研究热点。根据光纤中布里渊散射谱的传输特点和高精度特征提取的要求,提出了利用莱文伯-马夸特(L-M)算法调节权值的径向基函数神经网络(RBFN)对布里渊散射谱进行特征提取。通过与反向传播(BP)神经网络、五次多项式曲线拟合法和三次样条插值法进行预测比较,在中心频率为11.213GHz,权重比为4∶1的仿真散射谱模型中,本方法相对误差最小,仅0.0015179%,温度相对误差仅为0.152℃,且拟合度较好。在不同脉宽和不同温度下的同一检测系统中,前者的综合评价指标优于其他三种拟合方法。数值分析和实验研究均表明径向基函数神经网络适用于对布里渊散射谱进行拟合,有效提高了预测精度。     

Blocking probability analysis model for flexible spectrum optical networks

Compared to the traditional wavelength division multiplexing （WDM） optical networks with rigid and coarse granularities, flexible spectrum optical networks have high spectrum efficiency, which can support the service with various bandwidth requirements, such as sub and super channel. Among all network performance parameters, blocking probability is an important parameter for the performance evaluation and network planning in circuit~based optical networks including flexible spectrum optical networks. We propose an analytical method of blocking probability computation for flexible spectrum optical networks in this letter through mathematical analysis and theoretical derivation. Two blocking probability models are built respectively based on whether considering spectrum consecutiveness or not. Numerical results validate our proposed blocking probability models under different link capacity and traffic loads.     

Neural estimator to determine alpha parameter in terms of quantum-well number

The value of the α (Alpha) parameter, which is also called Linewidth enhancement factor, is particularly important in optical communication systems. This paper presents a new approach based on artificial neural networks (ANNs) to determine the α parameter for different number of quantum-wells (QWs). ANNs are trained in different structures with the use of five learning algorithms to obtain better performance and faster error convergence. The Levenberg–Marquardt (LM) algorithm, which has a quadratic speed of convergence, gives the best result among other learning algorithms used in the analysis. Both the training and the test results are in very good agreement with the experimental results reported elsewhere.     

全光网络中动态业务下的阻塞性能分析

通过对自适应路由和动态备选路由算法的性能分析,研究了波长选择和波长交换这两种类型的全光网络在动态业务下的阻塞性能,并提出了将动态波长分配与自适应路由选择相结合的算法.数值结果表明:1)相比波长交换网络而言,多纤波长选择网络是更为经济且切实可行的选择;2)动态备选路由算法可以获得与自适应路由算法相似的性能,并且文中所提出的算法能够更好的提高网络的阻塞性能.分析表明:不同算法的性能与网络拓扑的连接度以及备选路由的数目密切相关.     

Traffic estimation based on long short-term memory neural network for mobile front-haul with XG-PON

A novel predictive dynamic bandwidth allocation(DBA) method based on the long short-term memory(LSTM)neural network is proposed for a 10-gigabit-capable passive optical network in mobile front-haul(MFH) links. By predicting the number of packets that arrive at the optical network unit buffer based on LSTM, the round-trip time delay in traditional DBAs can be eliminated to meet the strict latency requirement for MFH links. Our study shows that the LSTM neural network has better performance than feed-forward neural networks. Based on extensive simulations, the proposed scheme is found to be able to achieve the latency requirement for MFH and outperforms the traditional DBAs in terms of delay, jitter, and packet loss ratio.     

Survivable routing and spectrum allocation algorithm based on p-cycle protection in elastic optical networks

With the number of large capacity applications in core network increasing, the bandwidth requirement of optical connections in conventional Wavelength Division Multiplexing (WDM) networks keeps enhancing, so that the Orthogonal Frequency Division Multiplexing (OFDM) technology is adopted to provide higher spectrum efficiency and flexibility in the future elastic optical networks. Meanwhile, survivability in the conventional WDM optical networks has been widely studied as an important issue to ensure the service continuity. However, survivability in OFDM-based elastic optical networks is more challenging than that in conventional WDM optical networks because each fiber usually carries even more connections. Therefore, it is necessary to study the new lightpath protection algorithm in elastic optical networks. Since p-cycle protection scheme has short restoration time and simple protection switching procedure, in this paper, we study the static Survivable p-Cycle Routing and Spectrum Allocation (SC-RSA) problem with providing an Integer Linear Programming (ILP) formulation. Since RSA is a NP-hard problem, we propose a new heuristic algorithm called Elastic p-Cycle Protection (ECP) to tolerate the single-fiber link failure. For each demand, ECP scheme can compute highly-efficient p-cycles to provide protection for all of the on-cycle links and the straddling links. We also consider the load balancing and choose the proper working path for each demand. Simulation results show that the proposed ECP scheme achieves better performances than traditional single-line-rate survivable schemes.     

A grid based particle method for evolution of open curves and surfaces

We propose a new numerical method for modeling motion of open curves in two dimensions and open surfaces in three dimensions. Following the grid based particle method we proposed in [S. Leung, H.K. Zhao, A grid based particle method for moving interface problems. J. Comput. Phys. 228 (2009) 2993–3024], we represent the open curve or the open surface by meshless Lagrangian particles sampled according to an underlying fixed Eulerian mesh. The underlying grid is used to provide a quasi-uniform sampling and neighboring information for meshless particles. The key idea in the current paper is to represent and to track end-points of the open curve and boundary-points of the open surface explicitly and consistently with interior particles. We apply our algorithms to several applications including spiral crystal growth modeling and image segmentation using active contours.     

Towards an Efficient and Exact Algorithm for Dynamic Dedicated Path Protection

We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algorithm in the setting of optical networks, but it should be applicable to other networks, where services have to be protected, and where the network resources are finite and discrete, e.g., wireless radio or networks capable of advance resource reservation. To the best of our knowledge, we are the first to propose an algorithm for this long-standing fundamental problem, which can be efficient and exact, as suggested by simulation results. The algorithm can be efficient because it can solve large problems, and it can be exact because its results are optimal, as demonstrated and corroborated by simulations. We offer a worst-case analysis to argue that the search space is polynomially upper bounded. Network operations, management, and control require efficient and exact algorithms, especially now, when greater emphasis is placed on network performance, reliability, softwarization, agility, and return on investment. The proposed algorithm uses our generic Dijkstra algorithm on a search graph generated “on-the-fly” based on the input graph. We corroborated the optimality of the results of the proposed algorithm with brute-force enumeration for networks up to 15 nodes large. We present the extensive simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50, and 100 nodes, and with 160, 320, and 640 spectrum units. We also compare the bandwidth blocking probability with the commonly-used edge-exclusion algorithm. We had 48,600 simulation runs with about 41 million searches.     

基于正交频分复用无源光网络的动态带宽分配算法研究

介绍了一种应用于未来大容量、多业务接入场景下的称为光正交频分复用无源光网络的下一代接入网技术,并提出了一种基于此结构的称为基于服务质量需求的固定周期流水线轮询动态带宽分配算法.该算法通过应用二级带宽分配机制、带宽预申请机制和最小带宽申请优先原则等方法,有效地保障了在大容量、多业务接入场景下各个业务不同的服务质量需求.为研究其性能,建立了该算法的仿真模型并进行了对比仿真.仿真结果显示该算法以低时延和低抖动有效地支持快速转发业务,同时平衡了确保转发业务和尽力而为业务之间的优先性和相对公平性,并且实现了不同光网络单元间的同优先级业务带宽分配的公平性.与传统的动态带宽分配算法算法相比,基于服务质量需求的固定周期流水线轮询动态带宽分配算法具有执行效率高、算法复杂度低、性能良好等优点,并且能够更好地适应光正交频分复用无源光网络的特性,发挥网络最大的性能.     

Fiber-wireless (FiWi) access network: Performance evaluation and scalability analysis of the physical layer

The fiber-wireless (FiWi) access network is a prestigious architecture for next generation (NG) access network. NG access networks are proposed to provide high data rate, broadband multiple services, scalable bandwidth, and flexible communication for manifold wireless end-users (WEUs). In this paper, the FiWi access network is designed based on a wavelengths division multiplexing/time division multiplexing passive optical network (WDM/TDM PON) at the optical backhaul with data rate of 2.5 Gb/s and wireless fidelity-worldwide interoperability for microwave access (WiFi–WiMAX) technologies at the wireless front-end along a 50 m–5 km wireless links with data rate of 54–30 Mb/s, respectively. The performance of the optical backhaul and the wireless front-end, in the proposed FiWi access network, has been evaluated in terms of bit error rate (BER), error vector magnitude (EVM), and signal-to-noise ratio (SNR) of the physical (PHY) layer. The scalability of the optical backhaul based on maximum split ratio of 1/32 for each wavelength channel and a fiber length of 24 km from the central office (CO) to the access point (AP) is analyzed with bit error rate (BER) of 10⁻⁹.     

基于正交频分复用无源光网络的动态带宽分配算法研究

介绍了一种应用于未来大容量、多业务接入场景下的称为光正交频分复用无源光网络的下一代接入网技术,并提出了一种基于此结构的称为基于服务质量需求的固定周期流水线轮询动态带宽分配算法.该算法通过应用二级带宽分配机制、带宽预申请机制和最小带宽申请优先原则等方法,有效地保障了在大容量、多业务接入场景下各个业务不同的服务质量需求.为...     

Characterization of phase modulated non-return-to-zero (PM-NRZ) format for DWDM long reach PONs

A technique which has been shown to be effective to mitigate the Rayleigh backscattering (RB) noise and potentially suited for use in the carrier distributed passive optical networks (PONs), uses a phase modulator (PM) at the reflective optical networking unit (RONU) to reshape the spectrum of the upstream non-return-to-zero (NRZ) signal, named PM-NRZ. Since the PM-NRZ signal has a much wider spectrum than the conventional NRZ signal, it would be very interesting to know its performance when applied to the multiple channels, or dense wavelength division multiplexed (DWDM) environment. Here, we, for the first time, show how close the neighboring channels can be located in the network by means of numerical simulations. We also provide solutions to reduce the crosstalk produced by neighboring PM-NRZ channels. Since in the WDM-PON system the distances between different ONUs and the head-end office vary, we also analyze the network performance when the powers of adjacent PM-NRZ signals change.     

Image feature extraction by dynamic neural filtering and phase-only joint transform correlation

Neural network-based image processing algorithms present numerous advantages due to their supervised adjustable properties. Among various neural network architectures, dynamic neural networks, Hopfield and Cellular networks, have been found inherently suitable for filtering applications. Combining supervised and filtering features of dynamic neural networks, this paper presents dynamic neural filtering technique based on Hopfield neural network architecture. The filtering technique has also been implemented by using phase-only joint transform correlation (POJTC) for optical image processing applications. Filtering structure is basically similar to the Hopfield neural network structure except for the adjustable filter mask and 2D convolution operation instead of weight matrix operations. The dynamic neural filtering architecture has learnable properties by back-propagation learning algorithm. POJTC presents significant advantages to achieve the operation of summing the cross-correlation of bipolar data by phase-encoding bipolar data in parallel. The image feature extraction performance of the proposed optical system is reported for various image processing applications using a simulation program.     

Radio over fiber access network architecture employing RSOA with downstream OQPSK and upstream re-modulated OOK data

We have demonstrated a bidirectional reflective semiconductor optical amplifier (RSOA) based on wavelength division multiplexing ROF network utilizing an offset quadrature differential phase shift keying (OQPSK) signal for down-link and an on-off keying (OOK) signal re-modulated for up-link. A 50 km range colorless WDM-ROF without dispersion compensation was demonstrated for both 1 Gbit/s downstream and upstream signals. The BER performance of our scheme shows that our scheme is a practical solution to meet the data rate and cost-efficient of the optical links simultaneously in tomorrow's ROF access networks.