论文部分内容阅读
研究了波分复用全光树环网在不同通信模型下的波长分配算法及其最坏性能分析.对于静态模型,证明了5L/2是树环网所需波长数的紧界.对于动态模型,提出了一种近似比为∑??ih=1maxr∈Rilog|V(r)|+h的波长分配算法,其中h为树环网的基树的层数,Ri为树环网中处于第i层的环的集合,|V(r)|为环r上的节点数.对于增量模型,提出了一种近似度为O[log2(t+1)]的波长分配算法,其中t为树环网中的环数.
The wavelength allocation algorithm and worst-case performance analysis of WDM ring networks under different communication models are studied. For the static model, it is proved that 5L / 2 is the tight bound for the number of wavelengths required by the ring network. For dynamic Model, we propose a wavelength assignment algorithm with an approximate ratio of Σ ih = 1 max r ∈ Rilog | V (r) | + h, where h is the number of layers of the tree in the ring network, Ri is the number of | V (r) | is the number of nodes on ring r. For the incremental model, a wavelength assignment algorithm with approximation O [log 2 (t + 1)] is proposed, where t The number of rings in the ring network.