| 不同通信模型下的全光树环网波长分配算法 |
| |
| 引用本文： | 许胤龙,王启华,陈国良.不同通信模型下的全光树环网波长分配算法[J].软件学报,2006,17(2):200-208. |
| |
| 作者姓名： | 许胤龙 王启华 陈国良 |
| |
| 作者单位： | 1. 中国科学技术大学,计算机科学与技术系,安徽,合肥,230027;省部共建重点实验室"高性能计算与应用",安徽,合肥,230027
2. 中国科学技术大学,计算机科学与技术系,安徽,合肥,230027 |
| |
| 摘 要： | 研究了波分复用全光树环网在不同通信模型下的波长分配算法及其最坏性能分析.对于静态模型,证明了5L/2是树环网所需波长数的紧界.对于动态模型,提出了一种近似比为∑i=1hmaxr∈Rilog|V(r)|]+h的波长分配算法,其中h为树环网的基树的层数,Ri为树环网中处于第i层的环的集合,|V(r)|为环r上的节点数.对于增量模型,提出了一种近似度为Olog2(t+1)]的波长分配算法,其中t为树环网中的环数.
|
| 关 键 词： | 全光网 波长分配 树环 近似比 |
| 收稿时间： | 2003-06-23 |
| 修稿时间： | 7/8/2005 12:00:00 AM |
Wavelength Assignment Algorithms on Trees of Rings under Different Communication Models |
| |
| XU Yin-Long,WANG Qi-Hua and CHEN Guo-Liang.Wavelength Assignment Algorithms on Trees of Rings under Different Communication Models[J].Journal of Software,2006,17(2):200-208. |
| |
| Authors: | XU Yin-Long WANG Qi-Hua and CHEN Guo-Liang |
| |
| Affiliation: | 1.Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China; 2.Anhui Province-MOST Key Co-Laboratory High Performance Computing and Its Applications, Hefei230027, China |
| |
| 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 Olog2(t+1)]-approximation and a ∑i=1h maxr∈Ri log | V(r) |] +h-approximation algorithm for incremental and dynamic trees of rings respectively, where t, h and Ri 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. |
| |
| Keywords: | WDM WDM all-optical network wavelength allocation tree of rings approximation ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
