咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Modified distributed relative ... 收藏

Modified distributed relative capacity loss algorithm for WDM optical networks

作     者:Dante, RG Moschim, E Martins, JF 

作者机构:Univ Estadual Campinas Fac Engn Elect Computacao Dept Semicond Instrumentos & Foton Lab Tecnol Fot Campinas SP Brazil CEFET SP Dept Automacao Sertaozinho SP Brazil 

出 版 物:《JOURNAL OF OPTICAL NETWORKING》 (J. Opt. Networking)

年 卷 期:2005年第4卷第5期

页      面:271-284页

核心收录:

学科分类:0810[工学-信息与通信工程] 070207[理学-光学] 07[理学] 08[工学] 0803[工学-光学工程] 0812[工学-计算机科学与技术(可授工学、理学学位)] 0702[理学-物理学] 

主  题:Assignment algorithms Dense wavelength division multiplexing Optical networks Wavelength assignment Wavelength conversion Wavelength routing 

摘      要:We focus on the routing and wavelength assignment (RWA) problem in intelligent and transparent optical networks operating under no wavelength conversion constraint for end-to-end connections in distributed environments. We propose and demonstrate what we believe to be a novel wavelength assignment algorithm based on hop counts and relative capacity loss, called modified distributed relative capacity loss (MDRCL). It consists of grouping end-to-end routes with the same number of hops in MDRCL tables. Unlike the distributed relative capacity loss (DRCL) algorithm, MDRCL offers a new strategy for wavelength assignment, including the destination node in its analysis and assuming one, more than one, or even all potential routes from source node to destination nodes combined by the same number of hops in its tables. We present simulation results of dynamic traffic in a hypothetical meshed network in terms of blocking probabilities as a function of network load. We show that our MDRCL algorithm outperforms the traditional wavelength assignment algorithms. (c) 2005 Optical Society of America.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分