不同通信模型下的全光树环网波长分配算法
作者:
基金项目:

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


Wavelength Assignment Algorithms on Trees of Rings under Different Communication Models
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [16]
  • |
  • 相似文献 [6]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

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

    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[log2(t+1)]-approximation and a ∑i=1hmaxrRi[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.

    参考文献
    [1]Erlebach T,Jansen K.Call scheduling in trees,rings and meshes In:Proc.of the 30th Hawaii Int'l Conf.on System Science (HISSC-30).1997.221-222.
    [2]Gerstel O,Kutten S.Dynamic wavelength allocation in WDM ring networks In:Proc.of the ICC'97.1997.432-436.
    [3]Li GZ,Simha G.On bounds for the wavelength allocation problem on optical ring networks Journal of High Speed Networks,1999,8(4):303-310.
    [4]Gerstel O,Sasaki G,Kutten S,Ramaswami R.Worst-Case analysis of dynamic wavelength allocation in optical networks IEEE/ACM Trans.on Networking,1999,7(6):833-845.
    [5]Slusarek M.Optimal online coloring of circular arc graphs.Information Theory Application,1995,29(5):423-429.
    [6]Xu YL,Chen GL,Huang LS,Wan YY.Optimal bandwidth utilization of all-optical ring with a converter of degree 4 Journal of Computer Science & Technology,2002,17(4):411-419.
    [7]Wan YY,Chen GL,XuYL,Gu J.Wavelength assignment on all optical ring with fixed wavelength converters.Journal of Software,2002,13(8):1456-1464 (in Chinese with English abstract).http://www.jos.org.cn/1000-9825/13/1456.pdf
    [8]Kaklamanis SC,Persiano G,Erlebach T,Jansen K.Constrained bipartite edge coloring with applications to wavelength routing In:Proc.of the 24th Int'l Colloquium on Automata,Languages and Programming (ICALP'97) LNCS1256,Springer-Verlag,1997.493-504.
    [9]Erlebach T,Jansen K,Kaklamanis C,Persiano P.Optimal wavelength routing on directed fiber trees Theoretical Computer Science,1999,211:119-137.
    [10]Kumar E,Schwabe E.Improved access to optical bandwidth in trees In:Proc.of the 8th Annual ACM-SIAM Symp.on Discrete Algorithm (SODA)'97.1997.437-444.
    [11]Batal Y,Leonardi S.On-Line routing in all-optical networks.Theoretical Computer Science,1999,211:19-39.
    [12]Deng XT,Li GJ,Zang WA.Wavelength allocation on tree of rings NETWORKS,2000,35(4):248-252.
    [13]Lu X,Chen J,He S.Wavelength assignment method for WDM network of star topology.Electronics Letters,2004,40(10):625-626.
    [14]Lu X,He S.Wavelength assignment forWDM ring.Electronics Letters,2003,39(19):1400-1402.
    [15]Li GZ,Simha R.On the wavelength assignment problem in multifiber WDM star and ring networks.IEEE/ACM Trans.on Networking,2001,9(1):60-68.
    [7]万颖瑜,陈国良,许胤龙,顾钧.有固定波长转换器的全光环网波长分配算法.软件学报,2002,13(8):1456-1464.http://www.jos.org.cn/1000-9825/13/1456.pdf
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

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

复制
分享
文章指标
  • 点击次数:3918
  • 下载次数: 4928
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2003-06-23
  • 最后修改日期:2005-07-08
文章二维码
您是第19831503位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号