%0 Journal Article
%T Wavelength Assignment Algorithms on Trees of Rings under Different Communication Models<br>不同通信模型下的全光树环网波长分配算法
%A XU Yin-Long
%A WANG Qi-Hua
%A CHEN Guo-Liang
%A <br>许胤龙
%A 王启华
%A 陈国良
%J 软件学报
%D 2006
%I 
%X 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.
%K WDM
%K WDM
%K all-optical network
%K wavelength allocation
%K tree of rings
%K approximation ratio<br>全光网
%K 波长分配
%K 树环
%K 近似比
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=CCAD08293A80DDFC&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=0B39A22176CE99FB&sid=1E41DF9426604740&eid=3D9746C06EC12B45&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=16