An investigation on all-optical multicast technology in all-optical networks
28 May 2021-
TL;DR: In this paper, four kinds of nonlinear effects are investigated to realize all-optical multicast, including cross-gain modulation (XGM), cross-phase modulation(XPM), four-wave mixing (FWM) and cascaded sum frequency generation (SFG)/difference frequency generator (DFG).
Abstract: Optical fiber communication has the characteristics of large transmission capacity, long transmission distance and good transmission efficiency, which could satisfy the ever-increasing bandwidth data communication requirements. All-optical network can directly process signal in the optical domain with the conventional optical - electrical - optical conversion and improve the signal processing speed. All-optical multicast technology is an important part of all-optical networks, which can improve the flexibility of the network and make better use of network resources. In this paper, four kinds of nonlinear effects are investigated to realize all-optical multicast, including cross-gain modulation (XGM), cross-phase modulation (XPM), four-wave mixing (FWM) and cascaded sum frequency generation (SFG)/difference frequency generation (DFG). The principle and multicast performance of these nonlinear effects are discussed. Moreover, the characteristics of several kinds of nonlinear devices are also compared, including SOA, HNLF, PPLN.
References
More filters
TL;DR: Using multipump four-wave mixing in a semiconductor optical amplifier, a simple scheme for multicasting an input nonreturn-to-zero 10-Gb/s signal to six different output wavelengths, all compliant with a 200-GHz channel grid is demonstrated.
Abstract: Using multipump four-wave mixing in a semiconductor optical amplifier, we demonstrate a simple scheme for multicasting an input nonreturn-to-zero 10-Gb/s signal to six different output wavelengths, all compliant with a 200-GHz channel grid. The signals are successfully transmitted in a metro-like system.
152 citations
TL;DR: This work demonstrates a scalable, energy-efficient, and pragmatic method for high-bandwidth wavelength multicasting using FWM in silicon photonic nanowires, and experimentally validate up to a sixteen-way multicast of 40-Gb/s NRZ data using spectral and temporal responses.
Abstract: We demonstrate a scalable, energy-efficient, and pragmatic method for high-bandwidth wavelength multicasting using FWM in silicon photonic nanowires. We experimentally validate up to a sixteen-way multicast of 40-Gb/s NRZ data using spectral and temporal responses, and evaluate the resulting data integrity degradation using BER measurements and power penalty performance metrics. We further examine the impact of this wavelength multicasting scalability on conversion efficiency. Finally, we experimentally evaluate up to a three-way multicast of 160-Gb/s pulsed-RZ data using spectral and temporal responses, representing the first on-chip wavelength multicasting of pulsed-RZ data.
85 citations
TL;DR: In this paper, a double pass configuration in a titanium indiffused waveguide realized on a periodically poled lithium-niobate substrate has been proposed for polarization-insensitive wavelength conversion.
Abstract: In this letter, we present a polarization-insensitive wavelength conversion scheme based on the cascading of two second-order processes. The nonlinear device exploits a double pass configuration in a titanium indiffused waveguide realized on a periodically poled lithium-niobate substrate. Polarization-independent conversion efficiency is obtained by rotating the signal polarization state by means of a Faraday mirror. A polarization sensitivity lower than 0.8 dB is experimentally demonstrated.
44 citations
TL;DR: In this paper, the effect of four-wave mixing (FWM) among the equally spaced converted signals was investigated and it was shown that the critical number of equally spaced consecutive channels giving significant penalty is 4.
Abstract: We experimentally demonstrate multicast wavelength conversion by exploiting cross-gain modulation and cross-phase modulation in an InAs/InGaAsP/InP columnar quantum dot semiconductor optical amplifier (CQD-SOA). We report wavelength multicasting of 40 and 80 Gb/s return-to-zero signals on four 400-GHz spaced channels. We find in all cases a moderate conversion penalty which we attribute mostly to four-wave mixing (FWM) among the equally spaced converted signals. We study the effect of the FWM impairments and find that the critical number of equally spaced consecutive channels giving significant penalty is 4. Instead, two- and three-channel conversion is possible with a null or negative Q2 factor penalty.
32 citations
TL;DR: This paper studies the problem of placing at most an exact Integer Nonlinear Program (INLP) and an efficient heuristic to solve the related reliable routing problem of establishing a connection over at most, and proposes an exact algorithm and two heuristics to solve this NP-hard problem.
Abstract: In current cloud computing systems, when leveraging virtualization technology, the customer’s requested data computing or storing service is accommodated by a set of communicated virtual machines (VM) in a scalable and elastic manner. These VMs are placed in one or more server nodes according to the node capacities or failure probabilities. The VM placement availability refers to the probability that at least one set of all customer’s requested VMs operates during the requested lifetime. In this paper, we first study the problem of placing at most $H$ groups of $k$ requested VMs on a minimum number of nodes, such that the VM placement availability is no less than $\delta$ , and that the specified communication delay and connection availability for each VM pair under the same placement group are not violated. We consider this problem with and without Shared-Risk Node Group (SRNG) failures, and prove this problem is NP-hard in both cases. We subsequently propose an exact Integer Nonlinear Program (INLP) and an efficient heuristic to solve this problem. We conduct simulations to compare the proposed algorithms with two existing heuristics in terms of performance. Finally, we study the related reliable routing problem of establishing a connection over at most $w$ link-disjoint paths from a source to a destination, such that the connection availability requirement is satisfied and each path delay is no more than a given value. We devise an exact algorithm and two heuristics to solve this NP-hard problem, and evaluate them via simulations.
29 citations