WDM光网上的Hopfild网波长分配算法的实现

讨论了在线性和环形WDM光网络上实现Hopfield网络的波长分配问题。给出了在线性和环形WDM光网络上实现并行Hopfild算法的通信模式所需波长数的下限值，分别设计了将该通信模式嵌入在上述简单WDM光网络上的波长分配方案，并给出了在该方案下实现Hopfield网络所需的波长数。     

WDM双环网上Hopfield网的波长分配*

基于WDM双环网,讨论了在其上实现Hopfield通信模式的波长分配问题,提出了一种路由策略及波长分配方案.在此基础上给出了实现Hopfield算法所需的波长数.     

并行LU分解的通信模式在WDM环网上的波长分配算法

波长分配是光网络设计的基本问题，设计波长分配算法是洞察光网络通信能力的基本方法．不同的并行算法具有不同的通信模式，如何在光互连网上实现这些通信模式，是当前一个颇受关注的研究领域．本文基于WDM环网络，针对矩阵的并行LU分解，构造了一种并行LU分解的通信模式，讨论了将该通信模式嵌入在环形光网络中的波长分配问题．在解决该问题的过程中，得到了将一种特殊的二分图结构的通信模式嵌入在环网中的波长分配算法．通过分析和证明得到了在WDM环网上实现该并行LU分解通信模式所需的最小波长数．     

并行BP算法在WDM环网上的波长分配

波长分配是光网络设计的基本问题,设计波长分配算法是洞察光网络通信能力的基本方法。不同的并行算法具有不同的通信模式,如何在光互联网上实现这些通信模式,同时优化波长分配问题,是当前一个颇受关注的研究领域。神经网络计算的一个重要特点是大规模并行计算,该文基于WDM环网络,讨论了在其上实现并行BP算法的波长分配问题,设计了将完全二分图结构Kmn,通信模式嵌入环网的方案,给出了在WDM环网络上实现并行BP算法所需的最小波长数。     

矩阵乘在一组规则WDM光网络上的波长分配

在光互连网络上实现并行算法的通信模式是当前一个颇受关注的研究领域。矩阵乘法是数值分析领域中一种常用的基本运算,许多数值代数中的计算问题最终会归结到矩阵乘法的计算。提出一种嵌入算法MRDR,在此基础上分析了在一组规则WDM光网络线性阵列、环、mesh、双环网上实现并行矩阵乘通信模式的波长分配问题,并给出了所需的最小波长数。     

并行FFT的通信模式在一组规则WDM光互连网络上的波长分配

在光互连网络上实现并行算法的通信模式是当前一个颇受关注的研究领域,基于顺序映射和移位逆序映射两种不同的嵌入方式,分析了在一组规则WDM光网络上实现并行FFT的通信模式所需的波长数．结论表明：将并行FFT的通信模式嵌入在线性阵列、环、二维mesh和二维torus光网络上。采用移位逆序映射方式比采用顺序映射方式所需的波长数少．     

并行FFT通信模式在WDM双环网上的波长分配

波长分配是光网络设计的基本问题。快速傅立叶变换（FFT）在数字信号处理、图像处理等领域有着广泛的应用,WDM双环网受到广泛的关注。提出一种递归的嵌入算法FFT-DLN,针对4种基本嵌入算法生成法、对折嵌入算法、顺序映射和逆序映射,得到在WDM双环网上实现并行FFT的通信模式所需的波长数均为N/8（N≥8）。通过分析发现,对于相同规模的傅立叶变换,递归的对折嵌入算法和逆序映射具有更短的执行时间。     

光RP(k)网络上Hypercube通信模式的波长指派算法

波长指派是光网络设计的基本问题,设计波长指派算法是洞察光网络通信能力的基本方法.基于光RP(k)网络,讨论了其波长指派问题. 含有N=2n个节点的Hypercube通信模式,构造了节点间的一种排列次序Xn,并设计了RP(k)网络上的波长指派算法.在构造该算法的过程中,得到了在环网络上实现n维Hypercube通信模式的波长指派算法.这两个算法具有较高的嵌入效率.在RP(k)网络上,实现Hypercube通信模式需要max{2,(5(2n?5/3(}个波长.而在环网络上,实现该通信模式需要复用(N/3+N/12(个波长,比已有算法需要复用(N/3+N/4(个波长有较大的改进.这两个算法对于光网络的设计具有较大的指导价值.     

WDM环网的保护方法的研究

文章分析了利用1:1环路配置方式进行WDM光环形网络保护的实现方法,简单介绍APS在环保护中的应用。总结环形保护正确实施所需解决的问题及方法。     

WDM环网的保护方法的研究

本文分析了利用1:1环路配置方式进行WDM光环形网络保护的实现方法,简单介绍APS在环保护中的应用。总结环形保护正确实施所需解决的问题及方法。     

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.     

Cost-effective single-hub WDM ring networks: A proposal and analysis

In this paper, we study a new concept of traffic grooming in wavelength-division multiplexing (WDM) ring networks that aims at eliminating both the bandwidth underutilization and the scalability concerns that are typical of all-optical wavelength routed ring networks. Our objective is to reduce the network cost while preserving the benefits of all-optical WDM ring networks. In order to assess the efficiency of our proposal, all underlying network costs are compared. These costs include that of the transceivers required at node level, as well as the number of wavelengths. Our results show that the proposed aggregation technique can significantly improve the resource utilization while reducing the network cost.     

Routing and wavelength assignment for 3-ary n-cube communication patterns in linear array optical networks for n communication rounds

k-ary n-cubes are a class of communication patterns that are employed by a number of typical parallel algorithms. This paper addresses the implementation of parallel algorithms with bidirectional 3-ary n-cube communication patterns on a bidirectional linear array WDM optical networks when the information is transmitted one dimension after another. By giving an embedding scheme ?, we prove the optimal number of wavelengths under ? and design a routing and wavelength assignment strategy of it.     

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.     

Minimization of SONET ADMs in ring networks revisited

We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a set of traffic streams (lightpaths) in a ring is determined by the routing and the wavelength assignment of the traffic streams. We consider both the arc version where the route of each traffic stream is given as input, and the chord version, where the routing is to be decided by the algorithm. The goal in both cases is to assign wavelengths so as to minimize the total number of used SONET ADMs.     

有固定波长转换器的全光环网波长分配算法

采用波分复用技术的全光网是目前宽带网络研究的方向之一,波长分配是其中主要的算法问题,具有重要的理论和应用价值.研究了具有任意固定波长转换器的环形光网上的波长分配问题.首先,提出了两个对环网上的请求集合预处理的算法,这两个算法可以将请求集合分解成一些连续的循环序列;然后,采用置换群来描述具有固定波长转换器的光环网,基于这种数学表示,提出了对环网上的波长信道进行分解的算法;基于这些算法,进一步提出了一个波长分配算法,该算法对于环形光网上的任意固定转换模式都能给出一个较好的波长分配方案.