不同通信模型下的全光树环网波长分配算法

许胤龙; 王启华; 陈国良

引用本文:	许胤龙,王启华,陈国良.不同通信模型下的全光树环网波长分配算法.软件学报,2006,17(2):200-208

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 4487次下载 5782次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
不同通信模型下的全光树环网波长分配算法
许胤龙^1,2, 王启华¹, 陈国良^1,2
1.中国科学技术大学,计算机科学与技术系,安徽,合肥,230027;2.省部共建重点实验室"高性能计算与应用",安徽,合肥,230027

摘要:

研究了波分复用全光树环网在不同通信模型下的波长分配算法及其最坏性能分析.对于静态模型,证明了5L/2是树环网所需波长数的紧界.对于动态模型,提出了一种近似比为∑_i=1^hmax_{r∈R_i}[log|V(r)|]+h的波长分配算法,其中h为树环网的基树的层数,R_i为树环网中处于第i层的环的集合,|V(r)|为环r上的节点数.对于增量模型,提出了一种近似度为O[log₂(t+1)]的波长分配算法,其中t为树环网中的环数.

关键词: WDM 全光网波长分配树环近似比

DOI：

分类号:

基金项目:Supported by the National Natural Science Foundation of China under Grant No60173048 (国家自然科学基金)

Wavelength Assignment Algorithms on Trees of Rings under Different Communication Models

XU Yin-Long,WANG Qi-Hua,CHEN Guo-Liang

Abstract:

This paper studies wavelength assignment algorithms on WDM all-optical trees of rings under different models: static, incremental and dynamic. It is shown that 5L/2 is the tight bound of the number of required wavelengths for static trees of rings with load L. This paper also proposes an O[log₂(t+1)]-approximation and a ∑_i=1^hmax_{r∈R_i}[log | V(r)|] +h-approximation algorithm for incremental and dynamic trees of rings respectively, where t,h and R_i are the number of rings, the number of the layers of the underlying tree and the set of rings of layer i in the network respectively.

Key words: WDM all-optical network wavelength allocation tree of rings approximation ratio