Mathematical formulation of provisioning of connections with advance reservation in metro WDM ring networks using reconfigurable OADMs (ROADMs) with tuning constraint

Optical add/drop multiplexers (OADMs) can significantly reduce the cost of metro optical wavelength-division multiplexing (WDM) ring networks by allowing traffic to bypass intermediate nodes without expensive opto-electro-opto (O-E-O) conversion. Some traditional OADMs, called fixed OADMs (FOADMs), can only add/drop traffic on a specific wavelength. Reconfigurable Optical Add/Drop Multiplexers (ROADMs) are emerging, which can add/drop traffic onto/from different wavelengths at different time. ROADMs provide desirable flexibility, enable fast provisioning of dynamic traffic, and save capital expenditure (CapEx) and operational expenditure (OpEx). In order to be cost-effective, some ROADMs employ architectures that tune the ROADM continuously from one wavelength to another, crossing through all the wavelengths in-between, which may cause interference to the connections, if any, on those wavelengths being crossed. In order to prevent existing connections from being interrupted, a constraint needs to be imposed that ROADMs cannot cross working wavelengths when tuning. In this study, the design and the benefits of metro optical WDM network architectures using ROADMs and the impact of this tuning constraint on the performance of the network are investigated. Mathematical formulation of the problem of provisioning of connections with advance reservation, in which the arrival time and departure time of all the connections are known in advance, is presented, and results for a small network are shown.     

Provisioning of dynamic traffic in mixed-line-rate optical networks with launch power determination

In mixed-line-rate (MLR) networks, different line rates on different wavelengths can coexist on the same fiber. MLR architectures can be built over transparent optical networks, where the transmitted signals remain in the optical domain along the entire path. Along the transparent optical path, a signal experiences various physical layer impairments (PLIs), and its quality degrades as it travels through each optical component. One of the major factors that affect the transmission quality is the launch power of the optical signal. The power must be large enough to ensure noise resiliency at the receiver, but it must be below the limit where fiber nonlinearities distort the signal. Moreover, high launch power is disruptive not only for the actual lightpath itself but also for neighboring lightpaths, and this effect is particularly critical in MLR networks since advanced modulation techniques used for high line rates are highly susceptible to PLIs. In this study, we investigate the problem of determining the appropriate launch power for provisioning of dynamic connection requests in MLR networks. By setting the appropriate launch power for each connection, we aim to maximize the number of established connections. We propose two different heuristics to determine the appropriate launch power of a lightpath. Worst-case best-case average (WBA) is based on optical reach of signal in a transparent optical network. In impairment-aware launch power determination (I-ALPD), current state of the network and impairments are evaluated to determine the launch power. The proposed approaches are practical and can adapt to the needs of network operators. Simulation results show that the performances of the proposed approaches show better results than the existing schemes in terms of blocking probability and bandwidth blocking ratio.     

Disaster-aware service provisioning with manycasting in cloud networks

Cloud services delivered by high-capacity optical datacenter networks are subject to disasters which may cause large-area failures, leading to huge data loss. Survivable service provisioning is crucial to minimize the effects of network/datacenter failures and maintain critical services in case of a disaster. We propose a novel disaster-aware service-provisioning scheme that multiplexes service over multiple paths destined to multiple servers/datacenters with manycasting. Our scheme maintains some bandwidth (i.e., degraded service) after a disaster failure vs. no service at all. We formulate this problem into a mathematical model which turns out to be an Integer Linear Program (ILP), and we provide heuristic optimization approaches as ILP is intractable for large problem instances. Numerical examples show that exploiting manycasting by intelligently selecting destinations in a risk-aware manner for service provisioning offers high level of survivability against link and node failures that may be caused by disasters and post-disaster failures at no extra cost compared to the other survivable schemes.     

Transmission Electron Microscopy-Based Analysis of Electrically Conductive Surface Defects in Large Area GaSb Homoepitaxial Diodes Grown Using Molecular Beam Epitaxy

We investigate a mechanism causing shorting of large area GaSb diodes grown on GaSb substrates using molecular beam epitaxy (MBE). The source of these shorts is determined to be large crystallographic defects on the surface of the diodes that are formed around droplets of gallium ejected from the gallium Knudsen cells during MBE. The gallium droplets cause defects in the crystal structure, and, as the epitaxy continues, the gallium is incorporated into the surrounding material. The shape of the defects is pyramidal with a central void extending from the epi-surface to the gallium core. Processing a GaSb diode with these surface defects results in the top-side contact metal migrating into the defect and shorting the diode. This prevents realization of large area diodes that are critical to applications such as photovoltaics and detectors. The diodes in this study are electrically characterized and the defect formation mechanism is investigated using cross-section transmission electron microscopy and electron dispersive spectroscopy.     

On dimensioning optical grids and the impact of scheduling

When deploying Grid infrastructure, the problem of dimensioning arises: how many servers to provide, where to place them, and which network to install for interconnecting server sites and users generating Grid jobs? In contrast to classical optical network design problems, it is typical of optical Grids that the destination of traffic (jobs) is not known beforehand. This leads to so-called anycast routing of jobs. For network dimensioning, this implies the absence of a clearly defined (source, destination)-based traffic matrix, since only the origin of Grid jobs (and their data) is known, but not their destination. The latter depends not only on the state of Grid resources, including network, storage, and computational resources, but also the Grid scheduling algorithm used. We present a phased solution approach to dimension all these resources, and use it to evaluate various scheduling algorithms in two European network case studies. Results show that the Grid scheduling algorithm has a substantial impact on the required network capacity. This capacity can be minimized by appropriately choosing a (reasonably small) number of server site locations: an optimal balance can be found, in between the single server site case requiring a lot of network traffic to this single location, and an overly fragmented distribution of server capacity over too many sites without much statistical multiplexing opportunities, and hence a relatively large probability of not finding free servers at nearby sites.     

New and improved approaches for shared-path protection in WDM mesh networks

This paper investigates the problem of dynamic survivable lightpath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). In particular, we focus on shared-path protection because it is resource efficient due to the fact that backup paths can share wavelength links when their corresponding working paths are mutually diverse. Our main contributions are as follows. 1) First, we prove that the problem of finding an eligible pair of working and backup paths for a new lightpath request requiring shared-path protection under the current network state is NP-complete. 2) Then, we develop a heuristic, called CAFES, to compute a feasible solution with high probability. 3) Finally, we design another heuristic, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-path protection and approach to optimal solutions without enumerating paths. We evaluate the effectiveness of our heuristics and the results are found to be promising.     

LFMTCN: A Green Ultra-Dense Multi-tier Small Cell Network Using Leader–follower Strategy

Wireless Personal Communications - Design of energy and spectrum-efficient multi-tier small cell network is an emerging research area. This paper has addressed the challenges of power optimization...     

Comparative Study on the Properties of Galvanically Deposited Nano- and Microcrystalline Thin Films of PbSe

Thin films of PbSe having both nano- and microstructures have been deposited on transparent conducting oxide (TCO)-coated glass substrates electrochemically, from an aqueous solution of Pb(OAc)₂, ethylenediamine tetraacetic acid (EDTA), and SeO₂. A Pb strip acted as the sacrificial anode, while the TCO glass was the cathode. No external bias was applied. The formation of PbSe was pH sensitive, and pH ~3 was found to be optimum for film deposition. Films grown at room temperature (25°C) were nanocrystalline (~25 nm), while those deposited at 80°C were microcrystalline (~150 nm). Films were characterized by x-ray diffraction studies, field-emission scanning electron microscope image analysis, infrared spectral analysis, and by both alternating-current (a.c.) and direct-current (d.c.) electrical measurements. A blue-shift was observed for the nanocrystalline films. Film resistivity and junction properties were obtained from electrical measurements.     

Fair queueing with service envelopes (FQSE): a cousin-fair hierarchical scheduler for subscriber access networks

In this paper, we propose and investigate the characteristics of a fair queueing with service envelopes (FQSE) algorithm-a hierarchical fair-share scheduling algorithm for access networks based on a remote scheduling system such as Ethernet passive optical networks (EPON) or cable TV network. FQSE is designed to overcome the limiting factors of a typical remote scheduling system such as large control-plane delay, limited control-plane bandwidth, and significant queue switch-over overhead. The algorithm is based on a concept of service envelope-a function representing the fair allocation of resources based on a global network condition called satisfiability parameter (SP). We define properties of cousin-fairness and sibling-fairness and show the FQSE to be cousin-fair. FQSE is unique in that it is the only hierarchical algorithm that is simultaneously cousin-fair. Furthermore, we show the necessary techniques to adapt FQSE to variable-sized packet-based networks. We analyze FQSE performance in EPON serving 1024 independent queues and demonstrate FQSE's ability to provide guaranteed bandwidth to each queue and to share the excess bandwidth fairly.     

Survivable WDM mesh networks

In a wavelength-division-multiplexing (WDM) optical network, the failure of network elements (e.g., fiber links and cross connects) may cause the failure of several optical channels, thereby leading to large data losses. This study examines different approaches to protect a mesh-based WDM optical network from such failures. These approaches are based on two survivability paradigms: 1) path protection/restoration and 2) link protection/restoration. The study examines the wavelength capacity requirements, and routing and wavelength assignment of primary and backup paths for path and link protection and proposes distributed protocols for path and link restoration. The study also examines the protection-switching time and the restoration time for each of these schemes, and the susceptibility of these schemes to multiple link failures. The numerical results obtained for a representative network topology with random traffic demands demonstrate that there is a tradeoff between the capacity utilization and the susceptibility to multiple link failures. We find that, on one hand, path protection provides significant capacity savings over link protection, and shared protection provides significant savings over dedicated protection; while on the other hand, path protection is more susceptible to multiple link failures than link protection, and shared protection is more susceptible to multiple link failures than dedicated protection. We formulate a model of protection-switching times for the different protection schemes based on a fully distributed control network. We propose distributed control protocols for path and link restoration. Numerical results obtained by simulating these protocols indicate that, for a representative network topology, path restoration has a better restoration efficiency than link restoration, and link restoration has a faster restoration time compared with path restoration.