Optimal Number Of Wavelengths Research Articles

Discrete combination method based on equidistant wavelength screening and its application to near-infrared analysis of hemoglobin

A wavelength selection method for discrete wavelength combinations was developed based on equidistant combination-partial least squares (EC-PLS) and applied to a near-infrared (NIR) spectroscopic analysis of hemoglobin (Hb) in human peripheral blood samples. An allowable model set was established through EC-PLS on the basis of the sequence of the predicted error values. Then, the wavelengths that appeared in the allowable models were sorted, combined, and utilized for modeling, and the optimal number of wavelengths in the combinations was determined. The ideal discrete combination models were obtained by traversing the number of allowable models. The obtained optimal EC-PLS and discrete wavelength models contained 71 and 42 wavelengths, respectively. A simple and high-performance discrete model with 35 wavelengths was also established. The validation samples excluded from modeling were used to validate the three models. The root-mean-square errors for the NIR-predicted and clinically measured Hb values were 3.29, 2.86, and 2.90 g·L–1, respectively; the correlation coefficients, relative RMSEP, and ratios of performance to deviation were 0.980, 0.983, and 0.981; 2.7%, 2.3%, and 2.4%; and 4.6, 5.3, and 5.2, respectively. The three models achieved high prediction accuracy. Among them, the optimal discrete combination model performed the best and was the most effective in enhancing prediction performance and removing redundant wavelengths. The proposed optimization method for discrete wavelength combinations is applicable to NIR spectroscopic analyses of complex samples and can improve prediction performance. The proposed wavelength models can be utilized to design dedicated spectrometers for Hb and can provide a valuable reference for non-invasive Hb detection.

Routing and wavelength assignment for augmented cubes in array-based wavelength-division-multiplexing optical networks

ABSTRACTThe augmented cube is a class of communication patterns that are employed by a number of typical parallel algorithms. It is one of the hypercube variations, and retains all favourable properties of hypercube. This paper addresses the routing and wavelength assignment (RWA) for the augmented cube communication pattern in a linear array wavelength-division-multiplexing optical network. By using congestion estimation and giving a RWA strategy, we prove that the optimal number of wavelengths is , where N denotes the size of the augmented cube.

Discriminating indicator grass species for rangeland degradation assessment using hyperspectral data resampled to AISA Eagle resolution

The development of techniques to estimate and map increaser grass species is critical for better understanding the condition of the rangeland and levels of rangeland degradation. This paper investigates whether canopy reflectance spectra, resampled to AISA Eagle resolution can discriminate among four increaser species representing different levels of rangeland degradation. Canopy spectral measurements were taken from the four indicator species: Hyparrhenia hirta (HH), Eragrostis curvula (EC), Sporobolus africanus (SA), and Aristida diffusa (AD). The random forest algorithm and a forward variable selection technique were used to identify optimal wavelengths for discriminating the species. Results revealed that the optimal number of wavelengths (n=8) that yielded the lowest OOB error (11.36%) in discriminating among the four increaser species are located in 966.7, 877.6, 691.9, 718.7, 902.7, 854.8, 674.1 and 703nm. These wavelengths are located in the visible, red-edge and near-infrared regions of the electromagnetic spectrum. The random forest algorithm can accurately discriminate species with an overall accuracy of 88.64% and a KHAT value of 0.85. The study demonstrated the possibility to upscale the method to airborne sensors such as AISA Eagle for mapping indicator species of rangeland degradation. A rotational grazing management plan should be considered as a way to create sustainable rangeland management in degraded areas.

Routing and wavelength assignment for 3-ary n-cube in array-based optical network

The k-ary n-cube, denoted Q n k , is one of the popular communication patterns of parallel algorithms. This paper addresses the routing and wavelength assignment for Q n 3 communication pattern in array-based WDM optical network. By using congestion estimation and giving a routing and wavelength assignment strategy, we prove that the optimal number of wavelengths is 3 n − 1 .

Routing and wavelength assignment for hypercube communications embedded on optical chordal ring networks of degrees 3 and 4

Routing and wavelength assignment for realizing hypercube communications on WDM ring networks has been discussed in previous research. To reduce the wavelength requirement, we study routing and wavelength assignment for realizing hypercube communications on WDM ring networks with additional links. We design the embedding schemes and derive the numbers of wavelengths required on WDM chordal ring networks of both degrees 3 and 4. Based on our proposed embedding schemes, we provide the analysis of chord length with optimal number of wavelengths to realize hypercube communications on 3-degree and 4-degree chordal rings. Results show that the wavelength requirement for realizing hypercube communications on optical chordal ring networks is significantly lower than that on optical ring networks. In addition, our research also provides solutions for embedding hypercube graph on chordal rings in graph embedding theory.

Node dimensioning in optical burst switching networks

Network dimensioning should be progressed for pursuing the ultimate efficiency of network system resources in order to satisfy target performance. This article studies node dimensioning as a method of resource optimization in optical burst switching (OBS) networks. OBS is a new switching technology for pursuing bufferless transparent optical networks by sending control packets prior to data burst in order to provision resources for the burst. However, the basic assumption of a bufferless node implies burst contention at a core node when more than two bursts attempt to move forward the same output simultaneously. Thus, burst contention is a critical performance metric and this article takes it into account as a constraint on node dimensioning and target performance. In this article, we first present node dimensioning issues for OBS networks. Two constraints from the transport plane and the control plane which affect burst contention are then introduced. The effect of the burst assembly process on node dimensioning is also presented. From numerical analysis, the optimal number of wavelengths in a link, which provides the lowest blocking probability, is obtained to suggest a guideline for node dimensioning.

Efficient traffic grooming in synchronous optical network/wavelength-division multiplexing bidirectional line-switched ring networks

We study traffic grooming in synchronous optical network/wavelength-division multiplexing (SONET/WDM) bidirectional line-switched ring (BLSR) networks under the uniform all-to-all traffic model with an objective to reduce total network costs (wavelength and electronic multiplexing costs), in particular, to minimize the number of add-drop multiplexers (ADMs) while using the optimal number of wavelengths. We derive a new tighter lower bound for the number of wavelengths when the number of nodes is a multiple of 4. We show that this lower bound is achievable. We then derive new, more general, and tighter lower bounds for the number of ADMs subject to the constraint that the optimal number of wavelengths is used, and propose heuristic algorithms (the circle construction algorithm and the circle grooming algorithm) that try to minimize the number of ADMs while using the optimal number of wavelengths in BLSR networks. Both the bounds and algorithms are applicable to any value of r and for different wavelength granularity g . All previous ADM lower bounds except perhaps that in (Gerstel et al., 1999) were derived under the assumption that the magnitude of the traffic streams ( r ) is one unit ( r = 1) with respect to the wavelength capacity granularity g . Performance evaluation shows that wherever applicable, our lower bounds are at least as good as existing bounds and are much tighter than existing ones in many cases. Our proposed heuristic grooming algorithms perform very well with traffic streams of larger magnitude. The resulting number of ADMs required is very close to the corresponding lower bounds derived in this paper.

On the All-to-All Broadcast Problem in Optical Networks 1

This paper considers the transmission of uniform deterministic traffic in an optical broadcast-star network using Wavelength Division Multiplexing. Lower bounds are established on the minimum time to exchange information between every node pair in such a network with tunable transmitters and fixed-tuned receivers. Three different scheduling algorithms are developed that are strictly optimal in three regimes of system parameters. The results are applicable to arbitrary tuning delays and arbitrary numbers of wavelength channels, and indicate the existence of a well-defined transition regime from tuning-limited operation to bandwidth-limited operation. Finally, the problem of computing the optimal number of wavelengths is addressed to achieve a schedule with minimum schedule length, and exact solutions are given.