A comparison of wavelength reservation protocols for WDM optical networks

In WDM optical networks, wavelength is the critical resource for efficient communication of traffic. Hence, suitable protocols are required to allocate and use the wavelengths efficiently. We have studied the wavelength reservation protocols of such networks, which are already developed and reported in literature. Following their historical development, we have outlined some generalized classification for them and provided comparison of their performances. Finally, on the basis of the previous works, we have discussed some future scopes, which may be explored for further improvement in performance of the protocols.     

Particle swarm optimization-based sub-pixel mapping for remote-sensing imagery

Mixed pixels are widely existent in remote-sensing imagery. Although the proportion occupied by each class in mixed pixels can be determined by spectral unmixing, the spatial distribution of classes remains unknown. Sub-pixel mapping (SPM) addresses this problem and a sub-pixel/pixel spatial attraction model (SPSAM) has been introduced to realize SPM. However, this algorithm fails to adequately consider the correlation between sub-pixels. Consequently, the SPM results created by SPSAM are noisy and the accuracy is limited. In this article, a method based on particle swarm optimization is proposed as post-processing on the SPM results obtained with SPSAM. It searches the most likely spatial distribution of classes in each coarse pixel to improve the SPSAM. Experimental results show that the proposed method can provide higher accuracy and reduce the noise in the results created by SPSAM. When compared with the available modified pixel-swapping algorithm, the proposed method often yields higher accuracy results.     

基于粒子群优化的大气质量评价模型

在L．D詹姆斯的S型生长曲线指数公式的基础上,采用具有全局搜索功能的粒子群优化（particle swam optimization,PSO）算法对公式中的参数进行优化,得到了对于多种大气污染物均适用的具有普适性的大气污染损害率计算公式和基于粒子群优化的大气质量评价模型。该评价模型与其它多种评价模型相比：不仅原理直观、评价结果准确,而且公式形式简单、计算简便,在大气质量评价领域具有较强的实用性。     

Routing and wavelength assignment for hypercube in array-based WDM optical networks

Hypercube is one of the most versatile and efficient communication patterns shared by a large number of computational problems. As the number of edges in hypercube grows logarithmically with the size of networks, the complexity of network topologies can be significantly reduced to realize hypercube in optical networks by taking advantage of the parallel transmission characteristic of optical fibers. In this paper, we study the routing and wavelength assignment for realizing hypercube on WDM optical networks including linear arrays and rings with the consideration of communication directions. Specifically, we analyze this problem for both bidirectional and unidirectional hypercubes. For each case, we identify a lower bound on the number of wavelengths required, and design the embedding scheme and wavelength assignment algorithm that uses a provably near-optimal number of wavelengths. In addition, we extend the results to meshes and tori. By our embedding schemes, many algorithms, originally designed based on hypercubes, can be applied to optical networks, and the wavelength requirements can be easily derived using our obtained results.     

Particle swarm optimization-based algorithms for TSP and generalized TSP

A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain searching strategy and a crossover eliminated technique are used to accelerate the convergence speed. Compared with the existing algorithms for solving TSP using swarm intelligence, it has been shown that the size of the solved problems could be increased by using the proposed algorithm.Another PSO-based algorithm is proposed and applied to solve the generalized traveling salesman problem by employing the generalized chromosome. Two local search techniques are used to speed up the convergence. Numerical results show the effectiveness of the proposed algorithms.     

Routing wavelength and time-slot reassignment algorithms for TDM based optical WDM networks

In this paper, we consider the problem of maximizing the time of first lightpath request rejection, T in the circuit-switched time division multiplexed (TDM) wavelength-routed (WR) optical WDM networks. TDM is incorporated into WDM, to increase the channel utilization when the carried traffic does not require the entire channel bandwidth. In TDM–WDM network, multiple sessions are multiplexed on each wavelength by assigning a sub-set of the TDM slots to each session. Thus, given a session request with a specified bandwidth, a lightpath has to be established by using the routing, wavelength and time-slot assignment (RWTA) algorithms. If the lightpath cannot be established, lightpath request rejection or call blocking occurs. As each lightpath is substantial revenue and long-lived, lightpath request rejection is highly unfavourable in the optical backbone networks. In this paper, we are proposing an intelligent routing, wavelength and time-slot reassignment algorithm for multi-rate traffic demands, where, when a call gets blocked, the already established calls in the network are rerouted, wavelength and time-slot reassigned so as to accommodate the blocked call. Since we are talking of slow arrivals and long holding times for the lightpaths, it is possible to do this reassignment while provisioning a new call. Simulation based analyses are used to study the performance of the proposed reassignment algorithm. The results show that the proposed reassignment algorithm can be used to maximize the time of first call blocking, thereby accommodating more calls in the network before upgrading the network capacity.     

Wavelength decomposition approach for computing blocking probabilities in WDM optical networks without wavelength conversions

We present an approximate analytical method to evaluate the blocking probabilities in Wavelength Division Multiplexing (WDM) networks without wavelength converters. Our approach assumes fixed routing with Random or First-Fit wavelength assignment. The new approach views the WDM network as a set of different layers (colors) in which, blocked traffic in one layer is overflowed to another layer. Analyzing blocking probabilities in each layer of the network is derived from an exact approach. A moment matching method is then used to characterize the overflow traffic from one layer to another. The results indicate that our approach is more accurate than previous works.     

基于粒子群优化算法的极限环极值搜索控制

提出一种利用粒子群优化算法进行在线寻优的自适应控制算法,该方法可抑制极限环的振荡幅值．应用极值搜索控制的思想,在线测量极限环的振荡幅度,并将其作为优化目标,利用粒子群优化算法寻找最优控制量,使得极限环的振荡幅值最小．针对粒子群优化和极限环控制的特点,提出一种加快收敛的算法．数值实验表明,提出的算法不仅与传统基于摄动方法...     

Dynamic survivable algorithm for meshed WDM optical networks

In this paper, we propose a novel heuristic survivable algorithm called dynamic path-shared protection (DPSP) to completely protect the double-link failures in meshed Wavelength-division-multiplexing (WDM) optical networks. In order to improve the algorithm performance, we focus on considering two key issues that are load balancing and resource-sharing degree when computing the working and backup paths. We also investigate the trap situations and present a solution method, because the trap situations may lead to high blocking probability (BP). Simulations results show that, DPSP can provide complete protection for the double-link failures; with respect to the previous work, DPSP not only can effectively avoid the trap situations but also is able to obtain higher resource utilization ratio and lower BP.     

Cooperative learning for radial basis function networks using particle swarm optimization

This paper presents a new evolutionary cooperative learning scheme, able to solve function approximation and classification problems with improved accuracy and generalization capabilities. The proposed method optimizes the construction of radial basis function (RBF) networks, based on a cooperative particle swarm optimization (CPSO) framework. It allows for using variable-width basis functions, which increase the flexibility of the produced models, while performing full network optimization by concurrently determining the rest of the RBF parameters, namely center locations, synaptic weights and network size. To avoid the excessive number of design variables, which hinders the optimization task, a compact representation scheme is introduced, using two distinct swarms. The first swarm applies the non-symmetric fuzzy means algorithm to calculate the network structure and RBF kernel center coordinates, while the second encodes the basis function widths by introducing a modified neighbor coverage heuristic. The two swarms work together in a cooperative way, by exchanging information towards discovering improved RBF network configurations, whereas a suitably tailored reset operation is incorporated to help avoid stagnation. The superiority of the proposed scheme is illustrated through implementation in a wide range of benchmark problems, and comparison with alternative approaches.     

Adaptive scheduling for integrated traffic on WDM optical networks

One of the important issues in the design of future generation of high-speed networks is to provide differentiated service to different types of traffic with various time constraints. In this paper, we study the problem of providing real-time service to either hard or soft real-time messages and normal transmission service to variable-length messages without time constraints in WDM optical networks. We propose an adaptive scheduling algorithm for scheduling message transmissions in order to improve the network performance when both real-time and non real-time messages are transmitted in one topology. We have analyzed the complexity of the algorithm to show its feasibility. We have conducted extensive discrete-event simulations to evaluate the performance of the proposed algorithm. The study suggests that when scheduling message transmission in WDM networks differentiated services should be considered in order to meet time constraints of real-time messages while non real-time messages are being served so that the overall performance of the network could be improved.     

Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion

Since optical WDM networks are becoming one of the alternatives for building up backbones, dynamic routing, and wavelength assignment with delay constraints (DRWA-DC) in WDM networks with sparse wavelength conversions is important for a communication model to route requests subject to delay bounds. Since the NP-hard minimum Steiner tree problem can be reduced to the DRWA-DC problem, it is very unlikely to derive optimal solutions in a reasonable time for the DRWA-DC problem. In this paper, we circumvent to apply a meta-heuristic based upon the ant colony optimization (ACO) approach to produce approximate solutions in a timely manner. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. The ACO algorithm proposed in this paper incorporates several new features so as to select wavelength links for which the communication cost and the transmission delay of routing the request can be minimized as much as possible subject to the specified delay bound. Computational experiments are designed and conducted to study the performance of the proposed algorithm. Comparing with the optimal solutions found by an ILP formulation, numerical results evince that the ACO algorithm is effective and robust in providing quality approximate solutions to the DRWA-DC problem.     

WDM光网络动态虚拟拓扑重构算法

针对波分复用光纤网络上业务流量动态改变的问题,为了使光纤网络能支持更多的业务连接,需要对虚拟拓扑进行重构。基于链路最大负载和包平均跳步距离,利用混合线性规划公式对重构问题进行描述,在此基础上提出一个自适应拓扑重构算法,达到提高网络吞吐量的目的。仿真结果表明,该算法可以有效地改善网络性能。     

A novel ring-tree-based routing and wavelength assignment algorithm for multicasting in DWDM optical mesh networks

Multicast session communications, such as video-conferencing and video-broadcasting, in DWDM mesh networks require the efficient multipoint-to-multipoint multicast algorithms. Several heuristics have approximate solutions using lightpath or light-tree for one-to-multipoint multicast communications, but few papers have discussed the multipoint-to-multipoint multicast problems in DWDM mesh networks. This paper proposes a ring-tree-based routing and wavelength assignment (RTRWA) solution in DWDM mesh networks. It proceeds to multipoint-to-multipoint multicast transmission by reserving links and wavelengths assigned by the Least Converter Count algorithm. The RTRWA algorithm tries to find an optimal ring path that connects all multicast session members with unidirectional links and connects the remaining nodes to the ring path with the light-tree. The RTRWA algorithm outperforms the Steiner minimal tree (SMT) algorithm in terms of the call blocking probability, difference in user capacity and the mean maximum transmission time.     

Rerouting schemes for dynamic traffic grooming in optical WDM networks

Traffic grooming in optical WDM mesh networks is a two-layer routing problem to effectively pack low-rate connections onto high-rate lightpaths, which, in turn, are established on wavelength links. The objective of traffic grooming is to improve resource efficiency. However, resource contention between lightpaths and connections may result in inefficient resource usage or even the blocking of some connections. In this work, we employ a rerouting approach to alleviate resource inefficiency and improve the network throughput under a dynamic traffic model. We propose two rerouting schemes, rerouting at lightpath level (RRLP) and rerouting at connection level (RRCON) and a qualitative comparison is made between the two. We also propose two heuristic rerouting algorithms, namely the critical-wavelength-avoiding one-lightpath-limited (CWA-1L) rerouting algorithm and the critical-lightpath-avoiding one-connection-limited (CLA-1C) rerouting algorithm, which are based on the two rerouting schemes. Simulation results show that rerouting reduces the blocking probability of connections significantly.     

Algorithms for burst rescheduling in WDM optical burst switching networks

Wavelength division multiplexing (WDM) is a promising technology for realizing terabit networks. Optical burst switching (OBS) is a way to efficiently support bursty traffic on WDM-based optical Internet networks. In OBS networks, the control (header) and payload (data) components of a burst are sent separately with a time gap. The control packet first traverses the burst switching nodes and reserves suitable wavelengths on the links for the corresponding data burst by using a scheduling algorithm. Our work is motivated from the observation that the existing scheduling algorithms either have low computational complexity or high performance in terms of burst dropping probability, but not both simultaneously. Since the arrival of bursts is dynamic, it is highly desirable that the scheduling is done as quickly as possible. We develop scheduling algorithms which integrate the merits of both low computational complexity and high burst dropping performance. The key idea is to reschedule an existing burst by assigning a new wavelength to it keeping the burst arrival and leaving time unchanged in order to accommodate the new burst. We propose computationally simple rescheduling algorithms called on-demand burst rescheduling and aggressive burst rescheduling. The effectiveness of the proposed algorithms and the signaling overhead are studied through simulation experiments.     

Design,performance and wavelength assignment of a wavelength division multiaccess protocol for optical fibre ring networks

This paper presents a multiaccess strategy for use over optical fibre ring networks employing two counter rotating rings, and using wavelength division multiplexing. Transmitters employ tunable lasers, while receivers employ one or more fixed wavelength filters. The paper introduces an algorithm for the optimal assignment of the receivers to the channels, such that the possibility of finding an unused channel leading to a certain receiver is maximized. The paper contains a performance study of the network protocol.     

Gene selection for cancer tumor detection using a novel memetic algorithm with a multi-view fitness function

Cancer is one of the key research topics in the medical field. An accurate detection of different cancer tumor types has great value in providing better treatment facilities and risk minimization for patients. Recently, DNA microarray-based gene expression profiles have been employed to correlate the clinical behavior of cancers with the differential gene expression levels in cancerous and benign tumors. An accurate classifier with linguistic interpretability using a small number of relevant genes is beneficial to microarray data analysis and development of inexpensive diagnostic tests. Several well-known and frequently used techniques for designing classifiers from microarray data, such as a support vector machine, neural networks, k-nearest neighbor, and logistic regression model, suffer from low comprehensibility. This paper proposes a new memetic algorithm which is capable of extracting interpretable and accurate fuzzy if–then rules from cancer data. This paper is the first proposal of memetic algorithms with the Multi-View fitness function approach. The new presented Multi-View fitness function considers two kinds of evaluating procedures. The first procedure, which is located in the main evolutionary structure of the algorithm, evaluates each single fuzzy if–then rule according to the specified rule quality (the evaluating procedure does not consider other rules). However, the second procedure determines the quality of each fuzzy rule according to the whole fuzzy rule set performance. In comparison to classic memetic algorithms, these kinds of memetic algorithms enhance the rule discovery process significantly.     

Protections for multicast session in WDM optical networks under reliability constraints

In this paper, we investigate protections of multicast session under reliability constraints in WDM optical networks, which is not referred in previous works. All of the papers about protection of multicast session discuss 100% reliability that may be distinct in different users’ requirement. At the beginning of the paper, we discuss the reliability of a tree. Then under reliability constraints, we propose three novel protection algorithms, which are Arc-Disjoint Tree with Different Reliability (ADT_DiR), Partial Tree Protection (PTP) and Choosing Segments Protection (CSP). ADT_DiR finds an arc-disjoint tree if the reliability of primary tree does not meet users’ requirement. PTP finds a small protection tree for some part of primary tree and also meets users’ requirement. CSP divides primary tree into segments first, and then protects some segments that are picked up by a strategy while satisfying users’ requirement. Compared with all protection schemes in other papers, which provide 100% reliability, ADT_DiR, PTP and CSP all decrease the resources needed by backup tree and reduce the failure probability of finding backup trees. The simulation results show that all the three protection schemes decrease the blocking ratio and reduce the protection resources consumed comparing to other protection schemes while meeting users’ requirement under dynamic traffics.